The result purported to solve the problem of all problems—the Holy Grail of theoretical computer science, worth a $1 million prize and fame rivaling Aristotle’s forevermore.

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 theoretical computer scientists employ a similar tool. They often ...

In the subfield of theoretical computer science called complexity theory, researchers try to pin down how easily computers can solve various types of problems.

Can generative AI solve computer science's greatest unsolved problem? The question -- Does P = NP? -- is a grand theoretical challenge.

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.

Science is always looking for more computing power and more efficient tools capable of answering its questions. Quantum computers are the new frontier in data processing, as they use the quantum ...

Assembly Theory is a way to understand how the complexity of life emerged through a mechanism of “self-assembly.” It could explain how life formed on Earth—or other planets—via the ...

To answer this question – or ask a new one – email lastword@newscientist.com. Questions should be scientific enquiries about everyday phenomena, and both questions and answers should be concise.