Euclidian geometry in terms of automata theory
Theoretical Computer Science
Reversible parallel computation: an evolving space-model
Theoretical Computer Science
A result about the power of geometric oracle machines
Theoretical Computer Science
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
Theoretical Computer Science - Special issue on computability and complexity in analysis
Computable analysis: an introduction
Computable analysis: an introduction
Minds and Machines
Minds and Machines
µ-recursion and infinite limits
Theoretical Computer Science
Infinite limits and R-recursive functions
Acta Cybernetica
Abstract Geometrical Computation 1: Embedding Black Hole Computations with Rational Numbers
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
A new conceptual framework for analog computation
Theoretical Computer Science
Type-2 Computability and Moore's Recursive Functions
Electronic Notes in Theoretical Computer Science (ENTCS)
On the computational capabilities of several models
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
A survey of infinite time turing machines
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Can general relativistic computers break the turing barrier?
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Forecasting black holes in abstract geometrical computation is highly unpredictable
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Abstract Geometrical Computation and Computable Analysis
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
Abstract geometrical computation 4: Small Turing universal signal machines
Theoretical Computer Science
Geometrical accumulations and computably enumerable real numbers
UC'11 Proceedings of the 10th international conference on Unconventional computation
Abstract geometrical computation 7: geometrical accumulations and computably enumerable real numbers
Natural Computing: an international journal
| Hi-index | 0.00 |
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 working at "normal pace". The key stone is that after a finite duration, the observer has received the information or knows that no information was ever sent by the device which had an infinite time to complete its computation. This allows to decide semi-decidable problems and clearly falls out of classical computability. A setting in a continuous Euclidean space-time that mimics this is presented. Not only is Zeno effect possible but it is used to unleash the black hole power. Both discrete (classical) computation and analog computation (in the understanding of Blum, Shub and Smale) are considered. Moreover, using nested singularities (which are built), it is shown how to decide higher levels of the corresponding arithmetical hierarchies.