How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme

DOI10.1016/j.tcs.2004.06.012zbMath1071.68070OpenAlexW2056484126MaRDI QIDQ1884855

Patrizia Mentrasti, Silvio Capobianco, Tommaso Toffoli

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.06.012

zbMATH Keywords

Lattice gasInversion schemeReversible computationSecond-order cellular automaton

Mathematics Subject Classification ID

Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Cellular automata (computational aspects) (68Q80)

Related Items (4)

When-and how-can a cellular automaton be rewritten as a lattice gas? ⋮ On the behavior characteristics of cellular automata ⋮ CONSTRUCTION OF REVERSIBLE LATTICE MOLECULAR AUTOMATA ⋮ Conserved quantities in discrete dynamics: what can be recovered from Noether's theorem, how, and why?

Cites Work

• Unnamed Item
• Unnamed Item
• Reversible simulation of one-dimensional irreversible cellular automata
• Reversibility of 2D cellular automata is undecidable
• Invertible cellular automata: A review
• Conservative logic
• Computation-universality of one-dimensional one-way reversible cellular automata
• Reversible space-time simulation of cellular automata
• Invariant in cellular automata
• Bicontinuous extensions of invertible combinatorial functions
• Representation of reversible cellular automata with block permutations
• Reversible cellular automaton able to simulate any other reversible one using partitioning automata

This page was built for publication: How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme