It is the height of the Second World War. A group of codebreakers stands in a dimly lit warehouse 50 miles northwest of London, a giant machine composed of spinning drums and wires looms in front of ...

However, there's a problem with this, which I can't resolve. Anyone who's done a computing machinery course will have heard of the Halting Problem, or Self Applicability, or some variant thereof.

Turing machines were first proposed by British mathematician Alan Turing in 1936, and are a theoretical mathematical model of what it means for a system to "be a computer." In a paper published in the ...