A fully universal Turing machine in Conway's Game of Life

MaRDI QIDQ5396377zbMATH OpenFDO

Authors P. Rendell

Publication date 5 February 2014

zbMATH Keywords

Conway's Game of LifeGollyHashLifeuniversal Turing machine

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• A simple universal Turing machine for the game of life Turing machine
• Turing machine universality of the game of life
• Small Turing universal signal machines
• Universality in elementary cellular automata
• The Complexity of Small Universal Turing Machines: A Survey

Cited in

(9)

• Turing Tumble is Turing-complete
• A symbolic dynamics perspective of Conway's game of life
• A simple universal Turing machine for the game of life Turing machine
• Some more algorithms for Conway's universal automaton
• Visualization of the computation process of a universal register machine
• Turing machine universality of the game of life
• Glider collisions in hybrid cellular automaton with memory rule (43,74)
• Machines, Computations, and Universality
• Analysing emergent dynamics of evolving computation in 2D cellular automata

This page was built for publication: A fully universal Turing machine in Conway's Game of Life

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5396377)