Abstract geometrical computation 8: Small machines, accumulations & rationality

Abstract : In the context of abstract geometrical computation, computing with coloured line segments, we consider the possibility of an accumulation-topologycal limit point of segment intersections/collisions-with small signal machines, i.e. having only a very limited number of distinct slopes/speeds when started with finitely many segments/signals. The cases of 2 and 4 speeds are trivial: no machine can produce an accumulation with only 2 speeds and an accumulation can be generated with 4 speeds. The main result is the twofold 3-speed case. No accumulation can happen when all ratios between speeds and all ratios between initial distances are rational. Accumulation is possible in the case of an irrational ratio between two speeds or of an irrational ratio between two distances in the initial configuration. This dichotomy is explained by the presence of a phenomenon computing Euclid's gcd algorithm: it stops if and only if its input is commensurable, i.e., of rational ratio.
Document type :
Journal articles
Liste complète des métadonnées

Contributor : Jérôme Durand-Lose <>
Submitted on : Tuesday, July 3, 2018 - 12:07:55 PM
Last modification on : Tuesday, April 2, 2019 - 1:39:42 AM

Links full text



Florent Becker, Jérôme Durand-Lose, Vincent Levorato, Mathieu Chapelle, Maxime Senot. Abstract geometrical computation 8: Small machines, accumulations & rationality. Journal of Computer and System Sciences (JCSS), Elsevier, 2018, 97, pp.182-198. 〈10.1016/j.jcss.2018.06.001〉. 〈hal-01828619〉



Record views