A one-dimensional physically universal cellular automaton
From MaRDI portal
Publication:2011676
DOI10.1007/978-3-319-58741-7_35zbMATH Open1489.68147arXiv1501.03988OpenAlexW2963990926MaRDI QIDQ2011676FDOQ2011676
Authors: Ville Salo, Ilkka A. Törmä 
Publication date: 4 August 2017
Abstract: Physical universality of a cellular automaton was defined by Janzing in 2010 as the ability to implement an arbitrary transformation of spatial patterns. In 2014, Schaeffer gave a construction of a two-dimensional physically universal cellular automaton. We construct a one-dimensional version of the automaton.
Full work available at URL: https://arxiv.org/abs/1501.03988
Recommendations
Cites Work
- Universality in elementary cellular automata
- Title not available (Why is that?)
- Universal pattern generation by cellular automata
- P-completeness of Cellular Automaton Rule 110
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Physically Universal Cellular Automaton
- A Physically Universal Quantum Cellular Automaton
Cited In (11)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constructibility of speed one signal on cellular automata
- Glider automorphisms and a finitary Ryan's theorem for transitive subshifts of finite type
- Universal pattern generation by cellular automata
- Title not available (Why is that?)
- Glider automorphisms on some shifts of finite type and a finitary Ryan's theorem
- On the absence of homogeneous scalar unitary cellular automata.
- Glider automata on all transitive sofic shifts
- A physically universal Turing machine
This page was built for publication: A one-dimensional physically universal cellular automaton
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011676)
