What can a computer do? Can it calculate any function? What if time and space are finite resources? What is the fastest-growing sequence of numbers and what does it have to do with all this? I will discuss the notion of a Turing machine and will answer some of these questions by explaining the theories of computability and complexity.
Date:
Thursday, January 29, 2015 - 12:00pm to 1:00pm
Host:
Speaker:
Umut Isik
Location:
NS 2, 1201
Image:
![](https://www.math.uci.edu/sites/default/files/Model_of_a_Turing_machine.jpg)