Reversible parallel computation: an evolving space-model
Theoretical Computer Science
Universal computation and other capabilities of hybrid and continuous dynamical systems
Theoretical Computer Science - Special issue on hybrid systems
On the computational power of neural nets
Journal of Computer and System Sciences
Recursion theory on the reals and continuous-time computation
Theoretical Computer Science - Special issue on real numbers and computers
On optimal solutions to the firing squad synchronization problem
Theoretical Computer Science - Special issue on universal machines and computations
Complexity and real computation
Complexity and real computation
Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy
Theoretical Computer Science - Special issue on real numbers and computers
Parallel transient time of one-dimensional sand pile
Theoretical Computer Science
Signals in one-dimensional cellular automata
Theoretical Computer Science - Special issue: cellular automata
Generation of Primes by a One-Dimensional Real-Time Iterative Array
Journal of the ACM (JACM)
Computable analysis: an introduction
Computable analysis: an introduction
Reversible space-time simulation of cellular automata
Theoretical Computer Science
Computing with continuous-time Liapunov systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Minds and Machines
Collision-based computing
Collision-based computing
Computing with solitons: a review and prospectus
Collision-based computing
Some Bounds on the Computational Power of Piecewise Constant Derivative Systems (Extended Abstract)
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Achilles and the Tortoise Climbing Up the Arithmetical Hierarchy
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Cellular Automata: A Discrete Universe
Cellular Automata: A Discrete Universe
Computation: finite and infinite machines
Computation: finite and infinite machines
Abstract geometrical computation for black hole computation
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Pictures worth a thousand tiles, a geometrical programming language for self-assembly
Theoretical Computer Science
Abstract geometrical computation 4: Small Turing universal signal machines
Theoretical Computer Science
Reversible conservative rational abstract geometrical computation is turing-universal
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Abstract geometrical computation 7: geometrical accumulations and computably enumerable real numbers
Natural Computing: an international journal
| Hi-index | 0.00 |
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 purposes. In this article, we present a parallel analog model of computation corresponding to this idealization: dimensionless signals are moving on a continuous space in continuous time generating Euclidean lines on (continuous) space-time diagrams. Like CA, this model is parallel, synchronous, uniform in space and time, and uses local updating. The main difference is that space and time are continuous and not discrete (ie ℝ instead of ℤ). In this article, the model is restricted to ℚ in order to remain inside Turing-computation theory. We prove that our model can carry out any Turing-computation through two-counter automata simulation and provide some undecidability results.