Wolfram 2,3 Turing Machine

From: Tom Caylor <daddycaylor.domain.name.hidden>
Date: Wed, 24 Oct 2007 11:32:24 -0700

This might be of interest to some of you, for instance Bruno, since
one of the ideals expounded here is "keep it simple". Sorry I haven't
been participating here.

>From Wolfram Science Group:

We're excited to announce that the $25,000 Wolfram 2,3 Turing Machine
Research Prize has been won.

Alex Smith, a 20-year-old undergraduate in Birmingham, UK, has given a
40-page proof that Wolfram's 2,3 Turing machine is indeed universal.
This result ends a half-century quest to find the simplest possible
universal Turing machine. It also provides strong further evidence for
Wolfram's Principle of Computational Equivalence. The official prize
ceremony is planned for November at Bletchley Park, UK, site of Alan
Turing's wartime work.

For more information about the prize and the solution, see:

http://www.wolframprize.org

Stephen Wolfram has posted his personal reaction to the prize at:

http://blog.wolfram.com/2007/10/the_prize_is_won_the_simplest.html


--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Everything List" group.
To post to this group, send email to everything-list.domain.name.hidden
To unsubscribe from this group, send email to everything-list-unsubscribe.domain.name.hidden
For more options, visit this group at http://groups.google.com/group/everything-list?hl=en
-~----------~----~----~----~------~----~------~--~---
Received on Wed Oct 24 2007 - 14:32:41 PDT

This archive was generated by hypermail 2.3.0 : Fri Feb 16 2018 - 13:20:14 PST