Skip to Main content Skip to Navigation
New interface
Reports (Research report)

Abstract geometrical computation for Black hole computation (extended abstract)

Abstract : 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 enumerable (\RE) problem. In this article, we provide a geometric model of computation, conservative abstract geometrical computation, that has the same property: it can simulate any Turing machine and can decide any \RE 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 artifact.
Document type :
Reports (Research report)
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Colette ORANGE Connect in order to contact the contributor
Submitted on : Wednesday, April 17, 2019 - 9:06:23 AM
Last modification on : Wednesday, October 26, 2022 - 8:14:44 AM


Files produced by the author(s)


  • HAL Id : hal-02101791, version 1



Jérôme Durand-Lose. Abstract geometrical computation for Black hole computation (extended abstract). [Research Report] LIP RR-2004-15, Laboratoire de l'informatique du parallélisme. 2004, 2+11p. ⟨hal-02101791⟩



Record views


Files downloads