- Abstract geometrical computation: Turing-computing ability and undecidability
- Abstract geometrical computation 1
- Black hole computation: implementations with signal Jer^ome Durand-Lose
- Fractal Parallelism: solving SAT in bounded
- Calculer gomtriquement sur le plan machines signaux
- Mod`eles de calcul et continuite Avant de definir notre mod`ele, il nous a semble utile de faire un tour d'horizon des
- Abstract Geometrical Computation and the Blum, Shub and Smale Model (CiE 2007 + 2008) Abstract Geometrical Computation and the
- Noname manuscript No. (will be inserted by the editor)
- Representing reversible cellular automata with reversible block cellular automata
- Reconnaissance de signaux par des automates finis
- Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton
- Abstract geometrical computation 6: a reversible, conservative and rational-based
- Abstract Geometrical Computation and Computable Analysis
- Automates temporiss introduction par un nophyte
- Automates finis et fonctions du continu dans un alphabet fini Jrme DURAND-LOSE
- Motifs et dynamique dans les boulements de tas de sable unidimensionnels
- Forecasting black holes in Abstract geometrical computation is highly unpredictable
- Laboratoire de l'Informatique du Paralllisme Ecole Normale Suprieure de Lyon
- Information Processing Letters 89 (2004) 237245 www.elsevier.com/locate/ipl
- Abstract geometrical computation for Black hole computation
- Laboratoire Bordelais de Recherche en Informatique, ura cnrs 1304,
- Laboratoire Bordelais de Recherche en Informatique, ura cnrs 1304,
- Signal recognition by finite automata work in progress
- Perturbations dans les automates cellulaires lmentaires de dimension deux
- A reversible and conservative model based on rational signal machines for
- J r me DURAND-LOSE Automates cellulaires,
- Laboratoire Bordelais de Recherche en Informatique, ura cnrs 1304,
- Automates temporiss introduction par un nophyte
- THE SIGNAL POINT OF VIEW: FROM CELLULAR AUTOMATA TO SIGNAL MACHINES
- Simulation Espace-Temps R versible d'Automates Cellulaires Non-R versibles
- Calculer gomtriquement sur le plan machines signaux
- Cellular Automata, Universality of Jer^ome Durand-Lose
- Noname manuscript No. (will be inserted by the editor)
- Abstract geometrical computation and the linear Blum, Shub and Small model
- Geometric computation on the plane signal machines
- No d'ordre : 1514 L'UNIVERSIT BORDEAUX I
- Randomized Uniform Self-stabilizing Mutual Jer^ome O. DURAND-LOSE y
- Solving Q-SAT in bounded space and time by geometrical computation
- Laboratoire Bordelais de Recherche en Informatique, ura cnrs 1304,
- The coordinates of isolated accumulations are exactly computable real numbers
- Abstract geometrical computation 4: small Turing universal signal machines
- Jer^ome Durand-Lose Ma^itre de conferences
- Abstract geometrical computation 4: small Turing universal signal machines
- Pavages et r versibilit des automates cellulaires J r^ome Olivier DURAND-LOSE
- About the Universality of the Billiard ball model J r me DURAND-LOSE
- Abstract geometrical computation: beyond the Blum, Shub and Smale model with accumulation
- Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning
- Reversible conservative rational abstract geometrical computation is Turing-universal
- Geometrical accumulations and computably enumerable real numbers
- Introduction Ce memoire se place dans l'etude des mod`eles du calcul continus. Nous y montrons que
- Machines signaux etmodles de calcul analogiques Machines signaux et
- Bibliographie [AD94] R. Alur et D. L. Dill A Theory of timed automata , Theoretical Computer
- HABILITATION DIRIGER DES RECHERCHES
- Geometric computation on the plane signal machines
- Calculer gomtriquement sur le plan machines signaux
