Turing machine universality of the game of life

DOI10.1007/978-3-319-19842-2MaRDI QIDQ514221zbMATH OpenOpenAlexFDO

Authors P. Rendell

Publication date 28 February 2017

Published in Emergence, Complexity and Computation (Search for Journal in Brave)

Full work available at URL http://eprints.uwe.ac.uk/22323/1/thesis.pdf

zbMATH Keywords

Game of Lifecellular automatonuniversal computationTuring machine

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Cellular automata (computational aspects) (68Q80)

Recommendations

• A simple universal Turing machine for the game of life Turing machine
• A fully universal Turing machine in Conway's Game of Life
• Universality in elementary cellular automata
• scientific article; zbMATH DE number 4195207
• Game of life cellular automata

Cited in

(11)

• A simple universal Turing machine for the game of life Turing machine
• scientific article; zbMATH DE number 2150282 (Why is no real title available?)
• Some notes about the game of life cellular automaton
• Logical gates via gliders collisions
• Reversibility and universality. Essays presented to Kenichi Morita on the occasion of his 70th birthday
• A fully universal Turing machine in Conway's Game of Life
• Column representation of Sturmian words in cellular automata
• Visualization of the computation process of a universal register machine
• Introduction to the \textit{Zambelli Festschrift}
• A Yang–Baxter integrable cellular automaton with a four site update rule
• \(n\)-skip Turing machines

This page was built for publication: Turing machine universality of the game of life

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