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 new AI developed at Duke University can uncover simple, readable rules behind extremely complex systems. It studies how systems evolve over time and reduces thousands of variables into compact ...

Henry Yuen is developing a new mathematical language to describe problems whose inputs and outputs aren’t ordinary numbers.

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 those cohabiting birds are the protagonists of a deceptively ...

Assembly theory bridges the gap between physics and biology in explaining how complex objects are identifiable as products of evolution and how reusability of parts allows novelty and identical ...

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

Physicists know about the huge chasm between quantum physics and the theory of gravity. However, in recent decades, theoretical physics has provided some plausible conjecture to bridge this gap and to ...

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