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

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

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

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

“Imagine a computation that produces a new bit of information in every step, based on the bits that it has computed so far. Over t steps of time, it may generate up to t new bits of information in ...

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

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

Part of “Complexity Theory,” a new column on the tangled questions of our technological age. The very first introductory seminar that I was enrolled in at Stanford was CS 56N: Great Inventions and ...

On Saturday, British mathematician Alan Turing would have turned 100 years old. It is barely fathomable to think that none of the computing power surrounding us today was around when he was born. But ...