We are at a critical time and supporting science journalism is more important than ever. Science News and our parent organization, the Society for Science, need your help to strengthen scientific ...

How can meat think? What kind of thing, or process, might thinking and problem-solving be, such that physical stuff, nicely organised, can make it happen? More generally, how does order spontaneously ...

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 ...

Turing machines are widely believed to be universal, in the sense that any computation done by any system can also be done by a Turing machine. In a new article, researchers present their work ...

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 ...

(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.

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 ...