complexity
In this podcast we explore how ants have helped humans to solve some very difficult problems.
Sophie tells us how computer algorithms that, in theory, are hopelessly inefficient, perform extraordinary well in practice.
Find out how these humble animals have inspired computer algorithms to solve complex real-world problems.
In time for pancake day here's a problem about flipping pancakes. It turns out to be surprisingly hard.
The Nevanlinna prize winner Constantinos Daskalakis explains why equilibrium may be unattainable and why it's good to be constructive.
Daskalakis tells us about the work he is being honoured for, which involves complexity theory, game theory, online dating and traffic jams.
The pioneering mathematician talks about his work, computer science and artificial intelligence.
We talk to pioneering mathematician Stephen Cook, who came up with the concept of NP-complete problems, about his work, computer science, and artificial intelligence.
There are problems that are easy to solve in theory, but impossible to solve in practice. Intrigued? Then join us on a journey through the world of complexity, all the way to the famous P versus NP conjecture.
Quantum particles that are both light and matter help solve infamous NP hard problems.