Abstract Geometrical Computation 6: A Reversible, Conservative and Rational Based Model for Black Hole Computation
In the context of Abstract geometrical computation, the Black hole model of computation (and SAD computers) have been implemented. In the present paper, based on reversible and (energy) conservative stacks, reversible Turing machines are simulated. A shrinking construction that has and preserves these properties is then presented. All together, the black hole model of computation is implemented by a rational signal machine that is reversible and conservative.
Keywords: Abstract geometrical computation; Black hole model of computation; Energy conservation; Reversibility; Signal machine.