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.

Paraconsistent mathematics is a type of mathematics in which contradictions may be true.
In such a system it is perfectly possible for a statement *A* and its negation *not A* to both be true. How can this be, and be coherent? What does it all mean?

Alan Turing is the father of computer science and contributed significantly to the WW2 effort, but his life came to a tragic end. **Stefan Kopieczek** explores his story.