HOW TO SIMULATE TURING MACHINES BY INVERTIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA

From MaRDI portal

Revision as of 04:21, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4867410

Jump to:navigation, search

DOI10.1142/S0129054195000202zbMath0843.68076OpenAlexW2020738082MaRDI QIDQ4867410

J.-C. Dubacq

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

zbMATH Keywords

Turing Machine invertibility of cellular automata

Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).

Related Items (4)

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

This page was built for publication: HOW TO SIMULATE TURING MACHINES BY INVERTIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4867410&oldid=19227669"

Pages with script errors