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

Complexity theory is a fundamental branch of theoretical computer science that categorises computational problems according to their inherent difficulty and the resources required to solve them. At ...

The original version of this story appeared in Quanta Magazine. Pose a question to a Magic 8 Ball, and it’ll answer yes, no, or something annoyingly indecisive. We think of it as a kid’s toy, but ...

A solution to P vs NP could unlock countless computational problems—or keep them forever out of reach. 1. On Monday, July 19, 2021, in the middle of another strange pandemic summer, a leading computer ...

Imagine you’re on a quest to understand the very nature of computation. You’re deep in the wilderness, far from any paths, and inscrutable messages are carved into the trunks of trees all around you — ...

My past research has existed in the intersection of logic and descriptive set theory with computational complexity theory. Particular topics relevant to this research have centered around oracle ...

Kolmogorov complexity uses computer science to measure the amount of information (or randomness) contained in finite objects. In addition to being interesting philosophically, Kolmogorov complexity ...

Veronika Koren talks about pursuing a theory of neural coding that doesn’t fit a simple narrative, and the resilience it took to see it through.