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.

from The Universal Machine


About driwatson
I'm a New Zealand author, computer scientist and blogger specialising in Artificial Intelligence. I also have an interest in the history of computing and have just written a popular science book called "The Universal Machine - from the dawn of computing to digital consciousness."

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: