Advertisement

Universal Counter Machine—Turing Machine

  • Paul RendellEmail author
Chapter
  • 1.2k Downloads
Part of the Emergence, Complexity and Computation book series (ECC, volume 18)

Abstract

Paul Chapman’s universal counter machine described in Chap.  3 is universal because it can simulate an arbitrary counter machine. It has been shown by Minsky that a counter machine can also simulate an arbitrary Turing machine. This chapter describes such a machine implemented by the author in Conway’s Game of Life and compares this with Paul Chapman’s machine. It is based on the Paul Chapman’s machine and the design from Minsky. The full universal counter machine program is listed in Appendix B.

Keywords

Universal Counter Counter Machines Turing machineTuring Machine Minsky transitionsTransition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, New Jersey (1967)Google Scholar
  2. 2.
    Rendell., P.: Java Applet Counter Machine Simulator/gol Counter Machine Generator. http://www.rendell-attic.org/gol/UCM/index.htm (2011)

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of the West of EnglandBristolUK

Personalised recommendations