Abstract geometrical computation. VIII: Small machines, accumulations \& rationality
From MaRDI portal
(Redirected from Publication:1672012)
Abstract geometrical computation. VIII: Small machines, accumulations \& rationality
Abstract geometrical computation. VIII: Small machines, accumulations \& rationality
Abstract: In the context of abstract geometrical computation, computing with colored line segments, we study the possibility of having an accumulation with small signal machines, ie, signal machines having only a very limited number of distinct speeds. The cases of 2 and 4 speeds are trivial: we provide a proof that no machine can produce an accumulation in the case of 2 speeds and exhibit an accumulation with 4 speeds. The main result is the twofold case of 3 speeds. On the one hand, we prove that accumulations cannot happen when all ratios between speeds and all ratios between initial distances are rational. On the other hand, we provide examples of an accumulation in the case of an irrational ratio between 2 speeds and in the case of an irrational ratio between two distances in the initial configuration. This dichotomy is explained by the presence of a phenomenon computing Euclid's algorithm (gcd): it stops if and only if its input is commensurate (ie, of rational ratio).
Recommendations
- Abstract geometrical computation. VII: Geometrical accumulations and computably enumerable real numbers
- Geometrical accumulations and computably enumerable real numbers
- Irrationality Is Needed to Compute with Signal Machines with Only Three Speeds
- Abstract geometrical computation. I: Embedding black hole computations with rational numbers
- Abstract geometrical computation. IX: Exact discretization of 3-speed rational signal machines
Cites work
- scientific article; zbMATH DE number 3141365 (Why is no real title available?)
- scientific article; zbMATH DE number 3518324 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- Abstract Geometrical Computation and Computable Analysis
- Abstract geometrical computation. III: Black holes for classical and analog computing
- Abstract geometrical computation. IV: Small Turing universal signal machines
- Abstract geometrical computation. VII: Geometrical accumulations and computably enumerable real numbers
- Computations on one-dimensional cellular automata
- Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants
- Euclidean geometry in terms of automata theory
- Four states are enough!
- Fractal Parallelism: Solving SAT in Bounded Space and Time
- Frontier between decidability and undecidability: A survey
- Irrationality Is Needed to Compute with Signal Machines with Only Three Speeds
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Reversible parallel computation: An evolving space-model
- Signals in one-dimensional cellular automata
- Small Semi-weakly Universal Turing Machines
- Small universal Turing machines
- Some bounds on the computational power of piecewise constant derivative systems
- The Euclid Abstract Machine: Trisection of the Angle and the Halting Problem
- Universality in elementary cellular automata
Cited in
(4)- Abstract geometrical computation. VII: Geometrical accumulations and computably enumerable real numbers
- Geometrical accumulations and computably enumerable real numbers
- Abstract geometrical computation. 11: Slanted firing squad synchronisation on signal machines
- Exact Discretization of 3-Speed Rational Signal Machines into Cellular Automata
This page was built for publication: Abstract geometrical computation. VIII: Small machines, accumulations \& rationality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1672012)
