Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model - Archive ouverte HAL Access content directly
Conference Papers Year : 2007

Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model

Abstract

Abstract geometrical computation naturally arises as a continuous counterpart of cellular automata. It relies on signals (dimensionless points) traveling at constant speed in a continuous space in continuous time. When signals collide, they are replaced by new signals according to some collision rules. This simple dynamics relies on real numbers with exact precision and is already known to be able to carry out any (discrete) Turing-computation. The Blum, Shub and Small (BSS) model is famous for computing over ℝ (considered here as a ℝ unlimited register machine) by performing algebraic computations. We prove that signal machines (set of signals and corresponding rules) and the infinite-dimension linear (multiplications are only by constants) BSS machines can simulate one another.
Fichier principal
Vignette du fichier
2007_CiE.pdf (157.35 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00144173 , version 1 (18-01-2017)

Identifiers

Cite

Jérôme Durand-Lose. Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model. 3rd Conference on Computability in Europe (CiE '07), Jun 2007, Sienne, Italy. pp.238-247, ⟨10.1007/978-3-540-73001-9_25⟩. ⟨hal-00144173⟩
310 View
173 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More