The Extent of Computation in Malament–Hogarth Spacetimes

DOI10.1093/bjps/axn031zbMath1154.83301arXivgr-qc/0609035WikidataQ55968654 ScholiaQ55968654MaRDI QIDQ5302226

No author found.

Publication date: 6 January 2009

Published in: The British Journal for the Philosophy of Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/gr-qc/0609035

Mathematics Subject Classification ID

03E15: Descriptive set theory

83A05: Special relativity

03D20: Recursive functions and relations, subrecursive hierarchies

Related Items

The Significance of Relativistic Computation for the Philosophy of Mathematics, A Survey on Analog Models of Computation, Physical Computability Theses, The dependence of computability on numerical notations, A proof of the Geroch-Horowitz-Penrose formulation of the strong cosmic censor conjecture motivated by computability theory, Computation as an unbounded process, A quantum-information-theoretic complement to a general-relativistic implementation of a beyond-Turing computer, General relativistic hypercomputing and foundation of mathematics, Abstract geometrical computation. III: Black holes for classical and analog computing, Pi on earth, or mathematics in the real world, Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems, Supertasks do not increase computational power, Hyperloops Do Not Threaten the Notion of an Effective Procedure