HOW TO SIMULATE TURING MACHINES BY INVERTIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA
From MaRDI portal
Publication:4867410
DOI10.1142/S0129054195000202zbMath0843.68076MaRDI QIDQ4867410
Publication date: 22 August 1996
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054195000202
68Q80: Cellular automata (computational aspects)
Related Items
Cellular automata universality revisited, A survey of cellular automata: types, dynamics, non-uniformity and applications, On a class of PCA with size-3 neighborhood and their applications in percolation games, Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata