Site Navigation
Categories:
Recursion theory
Cellular automata
Computational models
English inventions
Theoretical computer science
Mathematics of computing
Summary Of: Wolfram's 2-state 3-symbol Turing machine
Encyclodia Page On: Wolfram's 2-state 3-symbol Turing machine
These Are Links To Other Documents
|
disputed
|
unverified
|
talk page
|
A New Kind of Science
|
Stephen Wolfram
|
Turing machine
|
universal
|
universal Turing machine
|
|
Alex Smith
|
University of Birmingham
|
tag system
|
Vaughan Pratt
|
linear bounded automaton
|
Noam Chomsky
|
Turing machine
|
Universal Turing machine
|
Turing machine examples
|
Turing completeness
|
Rule 110
|
tag system
|
automata theory
|
finite state machine
|
Wolfram, S
|
A New Kind of Science
|
Marvin Minsky
|
Turing, A
|
Categories
|
Recursion theory
|
Cellular automata
|
Computational models
|
English inventions
|
Theoretical computer science
|
Mathematics of computing
|
This article is licensed under the
GNU Free Documentation License
. It uses material from the
Wikipedia article "Wolfram's 2-state 3-symbol Turing machine"
.