Wolfram Research  Mathematica    MathWorld    Wolfram Science    More »    Wolfram Web Resources
HOME
TOPICS
LATEST
ABOUT
FAQS
PARTICIPATE
AUTHORING AREA

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
comments
Interact with Demonstrations using the latest version of the free Mathematica Player—Download Now
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. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed.
Privacy Policy »
Note: To run this Demonstration you need the free
Mathematica Player or Mathematica 7+
Download or upgrade to Mathematica Player 7
I already have Mathematica Player or Mathematica 7+