Massively Parallel Automata in Euclidean Space-Time - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Massively Parallel Automata in Euclidean Space-Time

Abstract

In the cellular automata (CA) literature, discrete lines in discrete space-time diagrams are often idealized as Euclidean lines in order to design CA or analyze their dynamic behavior. In this paper, we present a parallel model of computation corresponding to this idealization: dimensionless particles move uniformely at fixed velocities along the real line and are transformed when they collide. Like CA, this model is parallel, uniform in space-time and uses local updating. The main difference is the use of the continuity of space and time, which we proceed to illustrate with a construction to solve Q-SAT, the satisfiability problem for quantified boolean formulae, in bounded space and time, and quadratic collision depth.
Fichier principal
Vignette du fichier
2010_SCW.pdf (130.4 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00511958 , version 1 (29-07-2011)

Identifiers

Cite

Denys Duchier, Jérôme Durand-Lose, Maxime Senot. Massively Parallel Automata in Euclidean Space-Time. IEEE 4th International Conference on Self-Adaptive and Self-Organizing Systems Workshops (SASOW~'10): Spatial Computing Workshop (SCW '10), 2010, Budapest, Hungary. pp.104-109, ⟨10.1109/SASOW.2010.23⟩. ⟨hal-00511958⟩
114 View
164 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More