wolframscience.com
The Wolfram 2,3 Turing Machine Research Prize
Wolfram's 2,3 Turing machine is universal!

The lower limit on Turing machine universality is proved--providing new evidence for Wolfram's Principle of Computational Equivalence. Wolfram's Principle of Computational Equivalence
Alex Smith
The Wolfram 2,3 Turing Machine Research Prize has been won by 20-year-old Alex Smith of Birmingham, UK.
Smith's Proof (to be published in Complex Systems):
 

BACKGROUND » TECHNICAL DETAILS » GALLERY »
PRIZE COMMITTEE » RULES & GUIDELINES » FAQs »

What is a Turing Machine? »  |  Notable Universal Turing Machines »

PRINTABLE POSTER »        NKS|ONLINE »        WOLFRAM PRIZE DEMONSTRATIONS »
 


© 2009 Wolfram Institute | Contact
Get prize update emails