Non-Turing Computations Via Malament–Hogarth Space-Times

@article{Etesi2001NonTuringCV,
  title={Non-Turing Computations Via Malament–Hogarth Space-Times},
  author={G{\'a}bor Etesi and Istv{\'a}n N{\'e}meti},
  journal={International Journal of Theoretical Physics},
  year={2001},
  volume={41},
  pages={341-370}
}
  • G. Etesi, I. Németi
  • Published 9 April 2001
  • Computer Science
  • International Journal of Theoretical Physics
We investigate the Church–Kalmár–Kreisel–Turing theses theoretical concerning (necessary) limitations of future computers and of deductive sciences, in view of recent results of classical general relativity theory. We argue that (i) there are several distinguished Church–Turing-type theses (not only one) and (ii) validity of some of these theses depend on the background physical theory we choose to use. In particular, if we choose classical general relativity theory as our background theory… 

Institute of Computer Science Academy of Sciences of the Czech Republic Relativistic Computers and Non-Uniform Complexity Theory 1

TLDR
In a complexity-theoretic analysis, it is shown that the (infinite) computations of S(n)-space bounded relativistic Turing machines are equivalent to (finite) Computations of Turing machines that use a S( n)-bounded advice f, which bounds the power of polynomial-space bounded relativity-based Turing machines by TM/poly.

Abstract Geometrical Computation 6: A Reversible, Conservative and Rational Based Model for Black Hole Computation

TLDR
A shrinking construction that has and preserves these properties is presented, and the black hole model of computation is implemented by a rational signal machine that is reversible and conservative.

The Extent of Computation in Malament–Hogarth Spacetimes

  • P. Welch
  • Mathematics
    The British Journal for the Philosophy of Science
  • 2008
We analyse the extent of possible computations following Hogarth ([2004]) conducted in Malament–Hogarth (MH) spacetimes, and Etesi and Németi ([2002]) in the special subclass containing rotating Kerr

Some thoughts on hypercomputation

Relativistic Computers and Non-uniform Complexity Theory

TLDR
In a complexity-theoretic analysis, it is shown that the (infinite) computations of S(n)-space bounded relativistic Turing machines are equivalent to (finite) Computations of Turing machines that use a S( n)- bounded advice f, which bounds the power of polynomial-space bounded relativity Turing machines by TM/poly.

Computing the non-computable

  • T. Kieu
  • Mathematics, Computer Science
    ArXiv
  • 2002
TLDR
It is argued that computability, and thus the limits of mathematics, ought to be determined not solely by mathematics itself but also by physical principles.

Relativistic computation

TLDR
This chapter focuses on relativistic computers and on their challenge to the physical Church-Turing thesis (PhCT), the belief that whatever physical computing device or physical thought experiment that will be designed by any future civilization, it will always be simulateable by a Turing machine, in some sense.

Computability : the hidden face of gravity ∗

In this essay we shall look at the old problem of the strong cosmic censorship from a new angle allowing us to make a contact with an apparently very different discipline of science namely

A Proof of the Geroch–Horowitz–Penrose Formulation of the Strong Cosmic Censor Conjecture Motivated by Computability Theory

TLDR
A mathematical version of the strong cosmic censor conjecture attributed to Geroch–Horowitz and Penrose but formulated explicitly by Wald is presented, based on the existence of future-inextendible causal curves in causal pasts of events on the future Cauchy horizon in a non-globally hyperbolic space-time.

Computation as an unbounded process

...

References

SHOWING 1-10 OF 32 REFERENCES

The Geometry Of Kerr Black Holes

This book offers an up-to-date look at black holes from a mathematical perspective containing many results never before published. It can be read as a broadly based introduction to modern techniques

The Large Scale Structure of Space–Time

Inner structure of a charged black hole: An exact mass-inflation solution.

  • Ori
  • Physics
    Physical review letters
  • 1991
TLDR
An exact mass-inflation solution of the Einstein-Maxwell equations is constructed, and it is found that this singularity is weak enough that its tidal gravitational forces do not necessarily destroy physical objects which attempt to cross it.

Radiation-reaction-induced evolution of circular orbits of particles around Kerr black holes.

  • KennefickOri
  • Physics
    Physical review. D, Particles and fields
  • 1996
TLDR
It is demonstrated that, in the adiabatic approximation, nonequatorial circular orbits of particles in the Kerr metric remain circular under the influence of gravitational radiation reaction.

Are physical objects necessarily burnt up by the blue sheet inside a black hole?

  • BurkoOri
  • Physics
    Physical review letters
  • 1995
TLDR
The electromagnetic radiation that falls into a Reissner-Nordstrom black hole develops a "blue sheet" of infinite energy density at the Cauchy horizon, and the effects of these fields on infalling objects within a simplified model are investigated.

Radiative Evolution of Orbits around a Kerr Black Hole

We propose a simple approach for the radiative evolution of generic orbits around a Kerr black hole. For a scalar-field, we recover the standard results for the evolution of the energy E and the

Quantum algorithms for the Hilbert's tenth problem

Forever Is a Day: Supertasks in Pitowsky and Malament-Hogarth Spacetimes

The standard theory of computation excludes computations whose completion requires an infinite number of steps. Malament-Hogarth spacetimes admit observers whose pasts contain entire future-directed,

Can an Infinitude of Operations be performed in a Finite Time

In his book Philosophy of Mathematics and Natural Science, the renowned mathematical physicist Hermann Weyl raised the following question: Is it kinematically feasible that a machine carry out an

Comments on Laraudogoitia's ‘Classical Particle Dynamics, Indeterminism and a Supertask’

We discuss two supertasks invented recently by Laraudogoitia [1996, 1997]. Both involve an infinite number of particle collisions within a finite amount of time and both compromise determinism. We