Content about “
halting problem
”

Article
carrot

This is not a carrot: Paraconsistent mathematics

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?

Article

Alan Turing: ahead of his time

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

What computers can't do

Mike Yates looks at the life and work of wartime code-breaker Alan Turing. Find out what types of numbers we can't count and why there are limits on what can be achieved with Turing machines.

Displaying 1 - 5 of 5