Wednesday, September 26, 2012

Monopoly and the unsolvability of #Turing's Halting Problem

In a guest blog for the Guardian Prof. Barry S. Cooper shows how the game of Monopoly can (in a sense) be used to exploreof Turing's discovery of the " unsolvability of the Halting Problem for the Universal Turing Machine. Turing showed that computers, though very useful, are not that clever. And that most complex problems are actually incomputable."  The blog is an interesting read and includes a link to Bletchley Park's shop where you can pre-order your very own copy of the special issue Turing Monopoly set. Get in quick as only 2,000 have been made and Google have already bought 1,000.