In computational complexity theory, P and NP are two classes of problems. P is the class of decision problems that a deterministic Turing machine can solve in polynomial time. In useful terms, any ...

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

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

The Journal of Symbolic Logic (JSL) was founded in 1936 and it has become the leading research journal in the field. It is issued quarterly. Volume 71, being published during 2006, will consist of ...

The prolific researcher found deep connections between randomness and computation and spent a career influencing cryptographers, complexity researchers and more. For more than 40 years, Avi Wigderson ...

This course gives an introduction to the mathematical foundations of computation. The course will look at Turing machines, universal computation, the Church-Turing thesis, the halting problem and ...

Since the 1930s, the theory of computation has profoundly influenced philosophical thinking about topics such as the theory of the mind, the nature of mathematical knowledge and the prospect of ...