## Abstract geometrical computation: Turing-computing ability and undecidability (2004)

Citations: | 3 - 1 self |

### BibTeX

@TECHREPORT{Durand-Lose04abstractgeometrical,

author = {Jérôme Durand-Lose},

title = {Abstract geometrical computation: Turing-computing ability and undecidability},

institution = {},

year = {2004}

}

### OpenURL

### Abstract

In the Cellular Automata (CA) literature, discrete lines inside (discrete) space-time diagrams are often idealized as Euclidean lines in order to analyze a dynamics or to design CA for special purposes. In this article, we present a parallel analog model of computation corresponding to this idealization: dimensionless signals are moving on a continuous space in continuous time generating Euclidean lines on (continuous) space-time diagrams. Like CA, this model is parallel, synchronous, uniform in space and time, and uses local updating. The main difference is that space and time are continuous and not discrete (i.e. R instead of Z). In this article, the model is restricted to Q in order to remain inside Turing-computation theory. We prove that our model can carry out any Turing-computation through two-counter automata simulation and provide some undecidability results.