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

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

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