Non-Turing computations via Malament--Hogarth space-times
From MaRDI portal
Publication:5959223
DOI10.1023/A:1014019225365zbMath0991.83030arXivgr-qc/0104023OpenAlexW1874721034MaRDI QIDQ5959223
Publication date: 26 March 2002
Published in: International Journal of Theoretical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/gr-qc/0104023
Black holes (83C57) Einstein's equations (general structure, canonical formalism, Cauchy problems) (83C05) Special relativity (83A05)
Related Items
The physical Church thesis as an explanation of the Galileo thesis, Membrane system models for super-Turing paradigms, What is the Church-Turing Thesis?, Exotica or the failure of the strong cosmic censorship in four dimensions, A proof of the Geroch-Horowitz-Penrose formulation of the strong cosmic censor conjecture motivated by computability theory, Specification, testing and verification of unconventional computations using generalizedX-machines, Remarks on black hole complexity puzzle, Reversible Limited Automata, A broader view on the limitations of information processing and communication by nature, On the boundary of the Cosmos, How We Think of Computing Today, Computation as an unbounded process, Physical Computability Theses, Perfect nonlinear S-boxes on the real-line, Hypercomputation by definition, Malament-Hogarth machines and Tait's axiomatic conception of mathematics, THE PHYSICAL CHURCH-TURING THESIS AND THE PRINCIPLES OF QUANTUM THEORY, HYPERCOMPUTATION: FANTASY OR REALITY? A POSITION PAPER, A quantum-information-theoretic complement to a general-relativistic implementation of a beyond-Turing computer, A twist in the geometry of rotating black holes: seeking the cause of acausality, Hyperloops Do Not Threaten the Notion of an Effective Procedure, Physical constraints on hypercomputation, Interval-valued computations and their connection with PSPACE, Abstract geometrical computation. V: Embedding computable analysis, Supertasks do not increase computational power, Real recursive functions and their hierarchy, Why there is no such discipline as hypercomputation, The case for hypercomputation, Embedding infinitely parallel computation in Newtonian kinematics, Definability as hypercomputational effect, Analog computation beyond the Turing limit, Relativistic computers and the Turing barrier, The many forms of hypercomputation, Computational power of infinite quantum parallelism, Zeno machines and hypercomputation, Twin paradox and the logical foundation of relativity theory, On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism, A note on accelerated Turing machines, Accelerating machines: a review, General relativistic hypercomputing and foundation of mathematics, The computational status of physics, A new problem for rule following, Abstract geometrical computation. III: Black holes for classical and analog computing, Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems, Gödel incompleteness and the Black hole information paradox, A new conceptual framework for analog computation, Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics, CLOSED TIMELIKE CURVES IN RELATIVISTIC COMPUTATION, Note on a reformulation of the strong cosmic censor conjecture based on computability, Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions, The Significance of Relativistic Computation for the Philosophy of Mathematics, Using Isabelle/HOL to verify first-order relativity theory, A Survey on Analog Models of Computation, Abstract geometrical computation. VII: Geometrical accumulations and computably enumerable real numbers
