Abstract Geometrical Computation 1: Embedding Black Hole Computations with Rational Numbers

Authors:
Jérôme Durand-Lose
Affiliations:
Laboratoire d'Informatique Fondamentale d'Orléans, Université d'Orléans, B.P. 6759, F-45067 Orléans Cedex 2, France. E-mail: jerome.durand-lose@univ-orleans.fr
Venue:
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Year:
2006

Citing 13
Cited 1

Reversible parallel computation: an evolving space-model

Theoretical Computer Science
On optimal solutions to the firing squad synchronization problem

Theoretical Computer Science - Special issue on universal machines and computations
Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy

Theoretical Computer Science - Special issue on real numbers and computers
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)
Upper bound on the products of particle interactions in cellular automata

Physica D
Infinite Time Turing Machines

Minds and Machines
Computing with solitons: a review and prospectus

Collision-based computing
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

Abstract geometrical computation 7: geometrical accumulations and computably enumerable real numbers

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 paper, we provide a geometric model of computation, conservative abstract geometrical computation, that, although being based on rational numbers (and not real numbers), has the same property: it can simulate any Turing machine and can decide any R.E. problem through the creation of an accumulation. Finitely many signals can leave any accumulation, and it can be known whether anything leaves. This corresponds to a black hole effect.