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

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

A concept developed for computer science could have a key role in fundamental physics — and point the way to a new understanding of space and time. When physicist Leonard Susskind gives talks these ...

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

The historical pursuit of creating intelligent machines has culminated in the modern era of artificial intelligence. However, the efficacy of AI applications is contingent upon a nuanced understanding ...

Computational neuroscientists taught an artificial neural network to imitate a biological neuron. The result offers a new way to think about the complexity of single brain cells. Our mushy brains seem ...

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

MIP * = RE is not a typo. It is a groundbreaking discovery and the catchy title of a recent paper in the field of quantum complexity theory. Complexity theory is a zoo of “complexity classes” – ...