Universality of Wolfram's 2, 3 Turing Machine

@article{Smith2020UniversalityOW,
  title={Universality of Wolfram's 2, 3 Turing Machine},
  author={A. Smith},
  journal={Complex Syst.},
  year={2020},
  volume={29}
}
  • A. Smith
  • Published 2020
  • Philosophy, Computer Science
  • Complex Syst.
(This is known as “system 0” in the proof below.) The proof I intend to give demonstrates that this Turing machine can emulate any twocolor cyclic tag system for an infinite number of steps; in order to do this, I first show that this Turing machine can emulate any two-color cyclic tag system for an arbitrary finite number of steps (with the number of steps encoded in the initial condition), and then use this result as a basis for proving the more general result that this Turing machine can… Expand
7 Citations
Turing machine universality of the game of life
  • 19
  • PDF
Computability and Tiling Problems
  • PDF
Honest universality.
  • N. Dershowitz, E. Falkovich
  • Medicine
  • Philosophical transactions. Series A, Mathematical, physical, and engineering sciences
  • 2012
  • 4
  • PDF
A Class of Models with the Potential to Represent Fundamental Physics
  • 15
  • PDF
Advances in I/O, Speedup, and Universality on Colossus, an Unconventional Computer
  • 2
Small Turing universal signal machines
  • PDF

References

SHOWING 1-10 OF 25 REFERENCES
The Universal Turing Machine: A Half-Century Survey
  • 525
The Universal Computer: The Road from Leibniz to Turing
  • M. Davis
  • Mathematics, Computer Science
  • 2000
  • 208
  • PDF
Recursive Unsolvability of a Problem of Thue
  • 422
  • PDF
Frontier between decidability and undecidability: a survey
  • 85
Computation Finite And Infinite Machines
  • 262
  • PDF
Small Universal Turing Machines
  • 183
  • PDF
...
1
2
3
...