Theory of Computation offers a rigorous mathematical framework that underpins our understanding of what can be computed and how efficiently these computations may be performed. It encompasses ...

Mathematician Alan Turing invented an imaginary computer known as the Turing Machine; in an age before computers, he explored the concept of what it meant to be computable, creating the field of ...

Computational complexity and computability are central themes in theoretical computer science that address the fundamental question of what can be computed and at what cost. Computability theory ...

This year a series of events around the world will celebrate the work of Alan Turing, the father of the modern computer, as the 100th anniversary of his birthday approaches on June 23. In a book ...

Vol. 95, No. 1/2, The Contributions of Logic to the Foundations of Physics (June/July 2010), pp. 279-300 (22 pages) Earlier, we have studied computations possible by physical systems and by algorithms ...

(Follow the appropriate link above for Elga or Klein's office hours and contact information.) The final exam will be a take-home exam distributed on Tuesday, May 13, and due at noon on Monday, May 19.