 |
|
|
|
| HAL: hal-00511958, version 1 |
| DOI: 10.1109/SASOW.2010.23 |
| Detailed view |  Export this paper |
|
|
| IEEE 4th International Conference on Self-Adaptive and Self-Organizing Systems Workshops (SASOW~'10): Spatial Computing Workshop (SCW '10), Budapest : Hungary (2010) |
|
|
|
|
| Massively Parallel Automata in Euclidean Space-Time |
|
|
| Denys Duchier 1Jérôme Durand-Lose 1 |
|
|
| (2010) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) |
|
|
|
Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges |
|
|
|
|
|
|
|
|
|
| GAMoC & CA (LIFO) |
|
|
|
|
| Subject | : | Computer Science/Computational Complexity Computer Science/Logic in Computer Science |
|
|
| Abstract geometrical computation – Signal machine – Continuous space-time – Cellular automata – Massive parallelism – Model of computation. |
|
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00511958, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00511958 | |
| oai:hal.archives-ouvertes.fr:hal-00511958 | |
| From: Maxime Senot | |
| Submitted on: Friday, 29 July 2011 19:29:20 | |
| Updated on: Sunday, 31 July 2011 07:05:31 | |
