News story
Cut your cake and eat it (eventually)
Computer scientists have made a breakthrough in the theory of cake cutting.
Are there problems computers will never be able to solve, no matter how powerful they become?
In the 1930s Alan Turing discovered a computer program that is logically impossible. What other limits are there to computation?
Journey to the limits of computation with a number that's easy to describe but can't be calculated.
Here's the ancient proof that there are infinitely many prime numbers.