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

NEW YORK, August 16, 2018 - The 2018 Donald E. Knuth Prize will be awarded to Johan Torkel Håstad of the KTH Royal Institute of Technology (Sweden) for his long and sustained record of milestone ...

The axiomatic treatment of the computational complexity of partial recursive functions initiated by Blum is extended to relatively computable functions (as computed, for example, by Turing machines ...

Physicists and computer scientists have recently expanded the modern theory of the thermodynamics of computation. By combining approaches from statistical physics and computer science, the researchers ...

Our research area encompasses the study of computation, computational models, computational complexity, algorithm design, algorithm verification, combinatorial optimization, computational biology and ...

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

A major advance reveals deep connections between the classes of problems that computers can — and can’t — possibly do. At first glance, the big news coming out of this summer’s conference on the ...

Northwestern is a world leader in the design of soft materials, and the Center for Computation and Theory of Soft Materials (CCTSM) is at the forefront of this effort. Providing computational ...

The original version of this story appeared in Quanta Magazine. They say a bird in the hand is worth two in the bush, but for computer scientists, two birds in a hole are better still. That’s because ...