Abstract geometrical computation 5: embedding computable analysis (2010)
Extended Signal machines are proven capable to compute any computable function in the understanding of recursive/computable analysis (CA), represented here with type-2 Turing machines (T2-TM) and...
Abstract geometrical computation 5: embedding computable analysis (2010)
Extended Signal machines are proven capable to compute any computable function in the understanding of recursive/computable analysis (CA), represented here with type-2 Turing machines (T2-TM) and...
Abstract geometrical computation 5: embedding computable analysis (2010)
Extended Signal machines are proven capable to compute any computable function in the understanding of recursive/computable analysis (CA), represented here with type-2 Turing machines (T2-TM) and...
Abstract geometrical computation 5: embedding computable analysis (2010)
Extended Signal machines are proven capable to compute any computable function in the understanding of recursive/computable analysis (CA), represented here with type-2 Turing machines (T2-TM) and...
Abstract geometrical computation 5: embedding computable analysis (2010)
Extended Signal machines are proven capable to compute any computable function in the understanding of recursive/computable analysis (CA), represented here with type-2 Turing machines (T2-TM) and...
Small Turing universal signal machines (2009)
This article aims at providing signal machines as small as possible able to perform any computation (in the classical understanding). After presenting signal machines, it is shown how to get...
Small Turing universal signal machines (2009)
This article aims at providing signal machines as small as possible able to perform any computation (in the classical understanding). After presenting signal machines, it is shown how to get...
Small Turing universal signal machines (2009)
This article aims at providing signal machines as small as possible able to perform any computation (in the classical understanding). After presenting signal machines, it is shown how to get...
Abstract Geometrical Computation and Computable Analysis (2009)
Extended Signal machines are proven able to compute any computable function in the understanding of recursive/computable analysis (CA), here type-2 Turing machines (T2-TM) with signed binary...
Abstract geometrical computation~3: Black holes for classical and analog computing (2009)
The so-called Black Hole model of computation involves a non Euclidean space-time where one device is infinitely ``accelerated'' on one world-line but can send some limited information to an observer...
Abstract Geometrical Computation and Computable Analysis (2009)
Extended Signal machines are proven able to compute any computable function in the understanding of recursive/computable analysis (CA), here type-2 Turing machines (T2-TM) with signed binary...
Abstract geometrical computation~3: Black holes for classical and analog computing (2009)
The so-called Black Hole model of computation involves a non Euclidean space-time where one device is infinitely ``accelerated'' on one world-line but can send some limited information to an observer...
Abstract Geometrical Computation and Computable Analysis (2009)
Extended Signal machines are proven able to compute any computable function in the understanding of recursive/computable analysis (CA), here type-2 Turing machines (T2-TM) with signed binary...
Abstract geometrical computation 3: Black holes for classical and analog computing (2009)
The so-called Black Hole model of computation involves a non Euclidean space-time where one device is infinitely ``accelerated'' on one world-line but can send some limited information to an observer...
Abstract Geometrical Computation and Computable Analysis (2009)
Extended Signal machines are proven able to compute any computable function in the understanding of recursive/computable analysis (CA), here type-2 Turing machines (T2-TM) with signed binary...
Abstract geometrical computation 3: Black holes for classical and analog computing (2009)
The so-called Black Hole model of computation involves a non Euclidean space-time where one device is infinitely ``accelerated'' on one world-line but can send some limited information to an observer...
Abstract geometrical computation 3: Black holes for classical and analog computing (2009)
The so-called Black Hole model of computation involves a non Euclidean space-time where one device is infinitely ``accelerated'' on one world-line but can send some limited information to an observer...
Abstract Geometrical Computation and Computable Analysis (2009)
Extended Signal machines are proven able to compute any computable function in the understanding of recursive/computable analysis (CA), here type-2 Turing machines (T2-TM) with signed binary...
The signal point of view: from cellular automata to signal machines (2008)
After emphasizing on the use of discrete signals in the literature on cellular automata, we show how these signals have been considered on their own. We then present their continuous counterpart:...
The signal point of view: from cellular automata to signal machines (2008)
After emphasizing on the use of discrete signals in the literature on cellular automata, we show how these signals have been considered on their own. We then present their continuous counterpart:...
reversible cellular automata with reversible block cellular automata
The signal point of view: from cellular automata to signal machines (2008)
After emphasizing on the use of discrete signals in the literature on cellular automata, we show how these signals have been considered on their own. We then present their continuous counterpart:...
The signal point of view: from cellular automata to signal machines (2008)
After emphasizing on the use of discrete signals in the literature on cellular automata, we show how these signals have been considered on their own. We then present their continuous counterpart:...
Abstract geometrical computation with accumulations: Beyond the Blum, Shub and Smale model (2008)
Abstract geometrical computation (AGC) naturally arises as a continuous counterpart of cellular automata. It relies on signals (dimensionless points) traveling and colliding. It can carry out any...
Abstract geometrical computation with accumulations: Beyond the Blum, Shub and Smale model (2008)
Abstract geometrical computation (AGC) naturally arises as a continuous counterpart of cellular automata. It relies on signals (dimensionless points) traveling and colliding. It can carry out any...
Abstract geometrical computation with accumulations: Beyond the Blum, Shub and Smale model (2008)
Abstract geometrical computation (AGC) naturally arises as a continuous counterpart of cellular automata. It relies on signals (dimensionless points) traveling and colliding. It can carry out any...
The signal point of view: from cellular automata to signal machines (2008)
After emphasizing on the use of discrete signals in the literature on cellular automata, we show how these signals have been considered on their own. We then present their continuous counterpart:...
Abstract geometrical computation with accumulations: Beyond the Blum, Shub and Smale model (2008)
Abstract geometrical computation (AGC) naturally arises as a continuous counterpart of cellular automata. It relies on signals (dimensionless points) traveling and colliding. It can carry out any...
Abstract geometrical computation with accumulations: Beyond the Blum, Shub and Smale model (2008)
Abstract geometrical computation (AGC) naturally arises as a continuous counterpart of cellular automata. It relies on signals (dimensionless points) traveling and colliding. It can carry out any...
About the Universality of the Billiard ball model (2007)
Block cellular automata (BCA) make local, parallel, synchronous and uniform updates of infinite lattices. In the one-dimensional case, there exist BCA with 11 states which are universal for...
Grain Sorting in the One-dimensional Sand Pile Model (2007)
Jérôme Durand-Lose, De Recherche
We study the evolution of a one-dimensional pile, empty at first, which receives a grain in its first stack at each iteration. The final position of grains is singular: grains are sorted according to...
Abstract geometrical computation 1: embedding Black hole computations with rational numbers (2006)
The Black hole model of computation provides super-Turing computing power since it offers the possibility to decide in finite (observer's) time any recursively enumerable (r.e.) problem. In this...
Abstract geometrical computation 1: embedding Black hole computations with rational numbers (2006)
The Black hole model of computation provides super-Turing computing power since it offers the possibility to decide in finite (observer's) time any recursively enumerable (r.e.) problem. In this...
Abstract geometrical computation 1: embedding Black hole computations with rational numbers (2006)
The Black hole model of computation provides super-Turing computing power since it offers the possibility to decide in finite (observer's) time any recursively enumerable (r.e.) problem. In this...
Abstract geometrical computation 1: embedding Black hole computations with rational numbers (2006)
The Black hole model of computation provides super-Turing computing power since it offers the possibility to decide in finite (observer's) time any recursively enumerable (r.e.) problem. In this...
Abstract geometrical computation 1: embedding Black hole computations with rational numbers (2006)
The Black hole model of computation provides super-Turing computing power since it offers the possibility to decide in finite (observer's) time any recursively enumerable (r.e.) problem. In this...
Abstract geometrical computation 1: embedding Black hole computations with rational numbers (2006)
The Black hole model of computation provides super-Turing computing power since it offers the possibility to decide in finite (observer's) time any recursively enumerable (r.e.) problem. In this...
Abstract geometrical computation 1: embedding Black hole computations with rational numbers (2006)
The Black hole model of computation provides super-Turing computing power since it offers the possibility to decide in finite (observer's) time any recursively enumerable (r.e.) problem. In this...
Abstract Geometrical Computation: Turing-Computing Ability and Undecidability (2005)
In the Cellular Automata (CA) literature, discrete lines inside (discrete) space-time diagrams are often idealized as Euclidean lines in order to analyze a dynamics or to design CA for special...
Abstract Geometrical Computation: Turing-Computing Ability and Undecidability (2005)
In the Cellular Automata (CA) literature, discrete lines inside (discrete) space-time diagrams are often idealized as Euclidean lines in order to analyze a dynamics or to design CA for special...
Abstract Geometrical Computation: Turing-Computing Ability and Undecidability (2005)
In the Cellular Automata (CA) literature, discrete lines inside (discrete) space-time diagrams are often idealized as Euclidean lines in order to analyze a dynamics or to design CA for special...
Abstract Geometrical Computation: Turing-Computing Ability and Undecidability (2005)
In the Cellular Automata (CA) literature, discrete lines inside (discrete) space-time diagrams are often idealized as Euclidean lines in order to analyze a dynamics or to design CA for special...
Abstract Geometrical Computation: Turing-Computing Ability and Undecidability (2005)
In the Cellular Automata (CA) literature, discrete lines inside (discrete) space-time diagrams are often idealized as Euclidean lines in order to analyze a dynamics or to design CA for special...
Abstract Geometrical Computation: Turing-Computing Ability and Undecidability (2005)
In the Cellular Automata (CA) literature, discrete lines inside (discrete) space-time diagrams are often idealized as Euclidean lines in order to analyze a dynamics or to design CA for special...
Abstract Geometrical Computation: Turing-Computing Ability and Undecidability (2005)
In the Cellular Automata (CA) literature, discrete lines inside (discrete) space-time diagrams are often idealized as Euclidean lines in order to analyze a dynamics or to design CA for special...
Abstract geometrical computation for Black hole computation (extended abstract). (2004)
Laboratoire De L'informatique Du Parallélisme, Durand-Lose, Jérôme
(eng) The Black hole model of computation provides a computing power that goes beyond the classical Turing computability since it offers the possibility to decide in finite time any recursively...
Laboratoire De L'informatique Du Parallélisme, Durand-Lose, Jérôme
(eng) In the Cellular Automata (CA) literature, discrete lines inside (discrete) space-time diagrams are often idealized as Euclidean lines in order to analyze a dynamics or to design CA for special...
A Kleene Theorem for Piecewise Constant Signals Automata (2004)
In this paper, we consider timed automata for piecewise constant signals and prove that they recognize exactly the languages denoted by signal regular expressions with intersection and renaming. The...
Abstract geometrical computation for Black hole computation (extended abstract) (2004)
The Black hole model of computation provides super-Turing computing power since it offers the possibility to decide in finite (observer's) time any recursively enumerable (r.e.) problem. In this...
A Kleene Theorem for Piecewise Constant Signals Automata (2004)
In this paper, we consider timed automata for piecewise constant signals and prove that they recognize exactly the languages denoted by signal regular expressions with intersection and renaming. The...
Abstract geometrical computation for Black hole computation (extended abstract) (2004)
The Black hole model of computation provides super-Turing computing power since it offers the possibility to decide in finite (observer's) time any recursively enumerable (r.e.) problem. In this...
A Kleene Theorem for Piecewise Constant Signals Automata (2004)
In this paper, we consider timed automata for piecewise constant signals and prove that they recognize exactly the languages denoted by signal regular expressions with intersection and renaming. The...
Abstract geometrical computation for Black hole computation (extended abstract) (2004)
The Black hole model of computation provides super-Turing computing power since it offers the possibility to decide in finite (observer's) time any recursively enumerable (r.e.) problem. In this...
A Kleene Theorem for Piecewise Constant Signals Automata (2004)
In this paper, we consider timed automata for piecewise constant signals and prove that they recognize exactly the languages denoted by signal regular expressions with intersection and renaming. The...
Abstract geometrical computation for Black hole computation (extended abstract) (2004)
The Black hole model of computation provides super-Turing computing power since it offers the possibility to decide in finite (observer's) time any recursively enumerable (r.e.) problem. In this...
Abstract. In the Cellular Automata (CA) literature, discrete lines inside (discrete) space-time diagrams are often idealized as Euclidean lines in order to analyze a dynamics or to design CA for...
A Kleene Theorem for Piecewise Constant Signals Automata (2004)
In this paper, we consider timed automata for piecewise constant signals and prove that they recognize exactly the languages denoted by signal regular expressions with intersection and renaming. The...
Abstract geometrical computation for Black hole computation (extended abstract) (2004)
The Black hole model of computation provides super-Turing computing power since it offers the possibility to decide in finite (observer's) time any recursively enumerable (r.e.) problem. In this...
A Kleene Theorem for Piecewise Constant Signals Automata (2004)
In this paper, we consider timed automata for piecewise constant signals and prove that they recognize exactly the languages denoted by signal regular expressions with intersection and renaming. The...
Abstract geometrical computation for Black hole computation (extended abstract) (2004)
The Black hole model of computation provides super-Turing computing power since it offers the possibility to decide in finite (observer's) time any recursively enumerable (r.e.) problem. In this...
A Kleene Theorem for Piecewise Constant Signals Automata (2004)
In this paper, we consider timed automata for piecewise constant signals and prove that they recognize exactly the languages denoted by signal regular expressions with intersection and renaming. The...
Abstract geometrical computation for Black hole computation (extended abstract) (2004)
The Black hole model of computation provides super-Turing computing power since it offers the possibility to decide in finite (observer's) time any recursively enumerable (r.e.) problem. In this...
A Kleene Theorem for Piecewise Constant Signals Automata (extended abstract). (2002)
Laboratoire De L'informatique Du Parallélisme, Durand-Lose, Jérôme
(eng) In this paper, we consider timed automata for piecewise constant signals.In the model presented here, time elapses only during transitions; any constraint on clocks should be satisfied during...
A Kleene Theorem for Piecewise Constant Signals Automata (extended abstract) (2002)
École Normale, Supérieure Lyon, École Normale Supérieure De, Jérôme Durand-lose
In this paper, we consider timed automata for piecewise constant signals. In the model presented here, time elapses only during transitions; any constraint on clocks should be satisfied during all...
Representing reversible cellular automata with reversible block (2001)
Cellular automata are mappings over infinite lattices such that each cell is updated according to the states around it and a unique local function. Block permutations are mappings that generalize a...