Abstract:
An introductory talk on what it means to be computable. For example, we would expect f(x) = x + 1 to be a computable function, but not f(x) = "Saturday's winning lotto number". We shall conclude with a discussion on how to spot, and avoid, functions that are computable but very hard (NP-Hard) to compute.
Speaker
Daniel Mansfield
Research Area
Postgraduate Seminar
Affiliation
The University of New South Wales
Date
Thu, 03/05/2012 - 4:00pm to 4:30pm
Venue
RC- 4080