Abstract geometrical computation. VIII: Small machines, accumulations \& rationality

DOI10.1016/J.JCSS.2018.06.001zbMATH Open1398.68158arXiv1307.6468OpenAlexW2963279843MaRDI QIDQ1672012FDOQ1672012

Vincent Levorato, Mathieu Chapelle, Jérôme O. Durand-Lose, Maxime Senot, Florent Becker

Publication date: 7 September 2018

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

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).

Full work available at URL: https://arxiv.org/abs/1307.6468

zbMATH Keywords

Euclidean geometrysignal machineunconventional computingabstract geometrical computationEuclid's algorithmaccumulation

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16)

Cites Work

• Euclidean geometry in terms of automata theory
• Abstract geometrical computation. VII: Geometrical accumulations and computably enumerable real numbers
• Fractal Parallelism: Solving SAT in Bounded Space and Time
• Abstract Geometrical Computation and Computable Analysis
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Title not available (Why is that?)
• Abstract geometrical computation. III: Black holes for classical and analog computing
• Reversible parallel computation: An evolving space-model
• Title not available (Why is that?)
• Title not available (Why is that?)
• Four states are enough!
• Computations on one-dimensional cellular automata
• Title not available (Why is that?)
• Some bounds on the computational power of piecewise constant derivative systems (extended abstract)
• Small universal Turing machines
• Frontier between decidability and undecidability: A survey
• Signals in one-dimensional cellular automata
• Small Semi-weakly Universal Turing Machines
• Abstract geometrical computation. IV: Small Turing universal signal machines
• Computing in the Fractal Cloud: Modular Generic Solvers for SAT and Q-SAT Variants
• Irrationality Is Needed to Compute with Signal Machines with Only Three Speeds
• The Euclid Abstract Machine: Trisection of the Angle and the Halting Problem

Cited In (1)

• 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)