So far, attempts to relate physics to com-plexity — such as the reaction–diffusion equation, chaos theory, the renormalization group, complexity theory — take us only a small step on this road.

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

Part of “Complexity Theory,” a new column on the tangled questions of our technological age. By some accounts, the western world is experiencing a backlash against the same technologies which ...

But is there a simpler way? Questions like this one, about the most efficient way to solve problems, are at the heart of the branch of computer science known as computational complexity theory.

We preselected all newsletters you had before unsubscribing.

I've got an article in the pipeline on the union of complexity theory and evolutionary biology, and over the next few days will publish outtakes from the interviews here. One interviewee was Carl ...

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

Part of “Complexity Theory,” a column on the tangled questions of our technological age. On Jan. 29, RStudio, an integrated development environment for the programming language R, announced ...

Complexity Theory experts suggest that when systems are complex and less predictable that we should consider moving away from hierarchical, to more heterarchical structures – where information ...