Modèle géométrique de calcul : fractales et barrières de complexité

Maxime Senot 1
1 GAMoC
LIFO - Laboratoire d'Informatique Fondamentale d'Orléans
Abstract : Geometrical models of computation allow to compute by using geometrical elementary operations. Among them, the signal machines model distinguishes itself by its simplicity, along with its power to realize efficiently various computations. We propose here an illustration and a study of this ability, especially in the case of massively parallel processes. We show first, throught a study of fractals, that signal machines are able to make a massive and parallel use of space. Then, a framework of geometrical modular programmation is proposed for designing machines from basic geometrical components --called modules-- supplied with given functionnalities. This method fits particulary with the conception of geometrical parallel computations. Finally, the joint use of this method and of fractal structures provides a geometrical resolution of difficult problems such as the boolean satisfiability problems SAT and Q-SAT. These ones, as well as several variants, are solved by signal machines with a model-specific time complexity, called collisions depth, which is polynomial, illustrating thus the efficiency and the parallel computational abilities of signal machines.
Complete list of metadatas

Cited literature [143 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00870600
Contributor : Maxime Senot <>
Submitted on : Tuesday, February 11, 2014 - 3:52:50 PM
Last modification on : Thursday, January 17, 2019 - 3:06:06 PM
Long-term archiving on : Sunday, April 9, 2017 - 10:49:39 AM

Identifiers

  • HAL Id : tel-00870600, version 2

Collections

Citation

Maxime Senot. Modèle géométrique de calcul : fractales et barrières de complexité. Complexité [cs.CC]. Université d'Orléans, 2013. Français. ⟨tel-00870600v2⟩

Share

Metrics

Record views

435

Files downloads

4284