Alan Turing and the Power of Negative Thinking
Turing’s diagonalization proof is a version of this game where the questions run through the infinite list of possible algorithms, repeatedly asking, “Can this algorithm solve the problem we’d like to prove uncomputable?” “It’s sort of ‘infinity questions,’” Williams said. To win the game, Turing needed to craft a problem where the answer is no […]
Read More