navbar-top.gif
btn_spacer.gifHomeTopicsLatestRandomAboutFAQsParticipateAuthoring Areabtn_spacer.gif

The Wolfram 2,3 Turing Machine
The Wolfram 2,3 Turing machine is the smallest Turing machine known to have the property of computation universality. (The universality was established by the solution of the Wolfram 2,3 Turing machine research prize in October 2007 by Alex Smith.) Explore running the machine with different initial tapes.




"The Wolfram 2,3 Turing Machine" from The Wolfram Demonstrations Project
 http://demonstrations.wolfram.com/TheWolfram23TuringMachine/
Contributed by: Jesse Nochella
Based on work by: Stephen Wolfram
Free Download: Mathematica Player--Runs all Demonstrations & more
Related Topics

Some Related Demonstrations

Share & Bookmark This Demonstration

Contribute
Powered by Wolfram Mathematica
Give us your feedback
Give us your feedback

Source page:




 often  occasionally  never

Note: Please do not include anything you consider confidential or proprietary. We will keep your information private. We will not give it to any third party.
Privacy Policy »
©  2008 The Wolfram Demonstrations Project & Contributors    Wolfram Research    Site Index    Terms of Use    Privacy Policy    RSS    Atom