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.
Liste complète des métadonnées

Cited literature [15 references]  Display  Hide  Download
Contributor : Maxime Senot <>
Submitted on : Friday, July 29, 2011 - 7:29:20 PM
Last modification on : Thursday, February 7, 2019 - 3:09:20 PM
Document(s) archivé(s) le : Monday, November 12, 2012 - 3:06:09 PM


Files produced by the author(s)




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⟩



Record views


Files downloads