The Wolfram 2,3 Turing Machine Research Prize Home
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

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 »