Exact Discretization of 3-Speed Rational Signal Machines into Cellular Automata

DOI10.1007/978-3-319-39300-1_6MaRDI QIDQ3186474zbMATH OpenOpenAlexFDO

Authors Tom Besson, Jérôme O. Durand-Lose

Publication date 10 August 2016

Published in Cellular Automata and Discrete Complex Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-39300-1_6

zbMATH Keywords

abstract geometrical computationautomatic discretizationcellular automatasignal machinesunconventional models of computation

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80)

Recommendations

• Abstract geometrical computation. IX: Exact discretization of 3-speed rational signal machines
• Constructibility of speed one signal on cellular automata
• scientific article; zbMATH DE number 4074493
• Three-state von Neumann cellular automata and pattern generation
• Realization of a tri-valued programmable cellular automata with ternary optimal computer
• Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
• scientific article; zbMATH DE number 2063252
• Cellular automata, decidability and phasespace
• scientific article; zbMATH DE number 1886334
• Cellular automata and -uniform BSS machines

Cites work

• Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model
• Abstract geometrical computation. IV: Small Turing universal signal machines
• Abstract geometrical computation. VIII: Small machines, accumulations \& rationality
• Four states are enough!
• Generation of Primes by a One-Dimensional Real-Time Iterative Array
• scientific article; zbMATH DE number 1136074 (Why is no real title available?)
• Irrationality Is Needed to Compute with Signal Machines with Only Three Speeds
• Logical Approaches to Computational Barriers
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Reversible space-time simulation of cellular automata
• Signals in one-dimensional cellular automata
• Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4n-Steps Solution
• Theory and Applications of Models of Computation
• Universality in elementary cellular automata

Cited in

(2)

• Abstract geometrical computation. IX: Exact discretization of 3-speed rational signal machines
• Irrationality Is Needed to Compute with Signal Machines with Only Three Speeds

This page was built for publication: Exact Discretization of 3-Speed Rational Signal Machines into Cellular Automata

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