Abstract geometrical computation 1: embedding Black hole computations with rational numbers

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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00079720
Contributor : Jérôme Durand-Lose <>
Submitted on : Tuesday, June 13, 2006 - 4:20:27 PM
Last modification on : Thursday, February 7, 2019 - 5:25:45 PM
Long-term archiving on : Monday, April 5, 2010 - 10:44:22 PM

Identifiers

  • HAL Id : hal-00079720, version 1

Collections

Citation

Jérôme Durand-Lose. Abstract geometrical computation 1: embedding Black hole computations with rational numbers. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2006, 74 (4), pp.491-450. ⟨hal-00079720⟩

Share

Metrics

Record views

176

Files downloads

151