Exact Discretization of 3-Speed Rational Signal Machines into Cellular Automata
From MaRDI portal
Publication:3186474
DOI10.1007/978-3-319-39300-1_6zbMath1365.68336OpenAlexW2480959903MaRDI QIDQ3186474
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
cellular automataunconventional models of computationabstract geometrical computationsignal machinesautomatic discretization
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Four states are enough!
- Abstract geometrical computation. IV: Small Turing universal signal machines
- Signals in one-dimensional cellular automata
- Reversible space-time simulation of cellular automata
- Abstract geometrical computation. VIII: Small machines, accumulations \& rationality
- Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4n-Steps Solution
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Irrationality Is Needed to Compute with Signal Machines with Only Three Speeds
- Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model
- Generation of Primes by a One-Dimensional Real-Time Iterative Array
- Logical Approaches to Computational Barriers
- Theory and Applications of Models of Computation
This page was built for publication: Exact Discretization of 3-Speed Rational Signal Machines into Cellular Automata
