Tic Tac Toe

Alex Smith, a 20 year old Birmingham undergraduate, has been awarded the Wolfram prize for proving that the (2,3) Turing machine is universal. This is a very basic machine with a three letter alphabet (say 0,1 and 2) and only two states, obeying the state diagram where $m:n$ represents a substitution of the letter $m$ for the letter $n$. The third number on an arrow labels the offset of the head for that move.

Wolfram says that such a universal machine could be used as a basis for building computers from simple molecules, such as DNA.

2 Responses so far »

  1. 1

    kneemo said,

    The solution isn’t hugely relevant to modern computer science, says Scott Aaronson, a computer scientist at the Massachusetts Institute of Technology (MIT) in Cambridge, Massachusetts.

    lol Clearly, this guy doesn’t know about the implications for black hole research.

  2. 2

    Anonymous said,

    Update: Aaronson pontificating on his own brilliance once again.


Comment RSS · TrackBack URI

Leave a Reply

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

WordPress.com Logo

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

Google photo

You are commenting using your Google 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 )

Connecting to %s

%d bloggers like this: