On the public citation graph
Does general relativity allow an observer to view an eternity in a finite time?
0 signed · 119 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1017/cbo9780511524646openalex-snapshot
The Large Scale Structure of Space-Time
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45833-6_2openalex-snapshot
Hypercomputation in the Chinese Room
inferred← citeshttps://doi.org/10.1007/978-0-387-68546-5_17openalex-snapshot
A Survey on Continuous Time Computations
inferred← citeshttps://doi.org/10.1007/978-1-4020-9107-0_21openalex-snapshot
Quantum Gravity Computers: On the Theory of Computation with Indefinite Causal Structure
inferred← citeshttps://doi.org/10.1007/978-3-030-14799-0_60openalex-snapshot
Approximate Outputs of Accelerated Turing Machines Closest to Their Halting Point
inferred← citeshttps://doi.org/10.1007/978-3-030-59234-9_6openalex-snapshot
A Survey on Analog Models of Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-64187-0_7openalex-snapshot
The Significance of Relativistic Computation for the Philosophy of Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-030-77799-9_9openalex-snapshot
What is the Church-Turing Thesis?
inferred← citeshttps://doi.org/10.1007/978-3-319-20028-6_25openalex-snapshot
Weihrauch Degrees of Finding Equilibria in Sequential Games
inferred← citeshttps://doi.org/10.1007/978-3-319-65826-1_11openalex-snapshot
Computability and Complexity of Unconventional Computing Devices
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_25openalex-snapshot
An Analog Characterization of Elementarily Computable Functions over the Real Numbers
inferred← citeshttps://doi.org/10.1007/978-3-540-31834-7_9openalex-snapshot
Real Recursive Functions and Real Extensions of Recursive Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_82openalex-snapshot
Turing Unbound: Transfinite Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_86openalex-snapshot
(Short) Survey of Real Hypercomputation
inferred← citeshttps://doi.org/10.1007/978-3-540-85194-3_18openalex-snapshot
Ultrafilter and Non-standard Turing Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_8openalex-snapshot
Hyperloops Do Not Threaten the Notion of an Effective Procedure
inferred← citeshttps://doi.org/10.1007/978-3-642-03745-0_11openalex-snapshot
Relativistic Computers and Transfinite Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-03745-0_26openalex-snapshot
On the Brightness of the Thomson Lamp: A Prolegomenon to Quantum Recursion Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-30870-3_53openalex-snapshot
Existence of Faster than Light Signals Implies Hypercomputation already in Special Relativity
inferred← citeshttps://doi.org/10.1007/978-3-642-37225-4_13openalex-snapshot
Oracle Hypermachines Faced with the Verification Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-05642-4_6openalex-snapshot
Hypercomputational Models
inferred← citeshttps://doi.org/10.1007/s10701-009-9390-xopenalex-snapshot
On the Possibility of Supertasks in General Relativity
inferred← citeshttps://doi.org/10.1007/s10701-023-00718-6openalex-snapshot
On the Boundary of the Cosmos
inferred← citeshttps://doi.org/10.1007/s10773-005-8984-0openalex-snapshot
Computational Power of Infinite Quantum Parallelism
inferred← citeshttps://doi.org/10.1007/s10773-026-06498-9openalex-snapshot
Combinatorial Barriers to a Unique Theory of Everything
inferred← citeshttps://doi.org/10.1007/s10817-013-9292-7openalex-snapshot
Using Isabelle/HOL to Verify First-Order Relativity Theory
inferred← citeshttps://doi.org/10.1007/s11023-007-9058-2openalex-snapshot
Physical Computation: How General are Gandy’s Principles for Mechanisms?
inferred← citeshttps://doi.org/10.1007/s11023-011-9238-yopenalex-snapshot
Do Accelerating Turing Machines Compute the Uncomputable?
inferred← citeshttps://doi.org/10.1007/s11023-018-9465-6openalex-snapshot
What is a Computer? A Survey
inferred← citeshttps://doi.org/10.1007/s11047-009-9115-2openalex-snapshot
The computational status of physics
inferred← citeshttps://doi.org/10.1007/s11047-009-9116-1openalex-snapshot
A new problem for rule following
inferred← citeshttps://doi.org/10.1007/s11047-010-9197-xopenalex-snapshot
Output concepts for accelerated Turing machines
inferred← citeshttps://doi.org/10.1007/s11047-011-9280-yopenalex-snapshot
Supertasks do not increase computational power
inferred← citeshttps://doi.org/10.1007/s11229-006-9099-8openalex-snapshot
Why we view the brain as a computer
inferred← citeshttps://doi.org/10.1007/s11229-014-0502-6openalex-snapshot
A quantum-information-theoretic complement to a general-relativistic implementation of a beyond-Turing computer
inferred← citeshttps://doi.org/10.1007/s13194-024-00584-7openalex-snapshot
On quantum computing for artificial superintelligence
inferred← citeshttps://doi.org/10.1016/b978-0-12-386980-7.50025-3openalex-snapshot
Can Digital Computers Think?: Intelligent Machinery: A Heretical Theory: Can Automatic Calculating Machines Be Said To Think?
inferred← citeshttps://doi.org/10.1016/j.amc.2005.09.067openalex-snapshot
The case for hypercomputation
inferred← citeshttps://doi.org/10.1016/j.amc.2005.09.086openalex-snapshot
The Church–Turing thesis: Still valid after all these years?
inferred← citeshttps://doi.org/10.1016/j.endeavour.2020.100724openalex-snapshot
Our human quest with the Black Hole
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.04.001openalex-snapshot
On Fixpoint Arithmetic and Infinite Time Turing Machines
inferred← citeshttps://doi.org/10.1016/j.shpsb.2017.03.003openalex-snapshot
How device-independent approaches change the meaning of physical theory
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.12.007openalex-snapshot
Super-tasks, accelerating Turing machines and uncomputability
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.12.010openalex-snapshot
The modal argument for hypercomputing minds
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.12.014openalex-snapshot
Hypercomputation: philosophical issues
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.09.010openalex-snapshot
Elementarily computable functions over the real numbers and R -sub-recursive functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.09.050openalex-snapshot
Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and Normal Form theorems
inferred← citeshttps://doi.org/10.1017/s0960129510000344openalex-snapshot
A note on accelerated Turing machines
inferred← citeshttps://doi.org/10.1023/a:1021180801870openalex-snapshot
Infinite Time Turing Machines
inferred← citeshttps://doi.org/10.1023/a:1021341202779openalex-snapshot
Computation and Hypercomputation
inferred← citeshttps://doi.org/10.1023/a:1021365222692openalex-snapshot
Physical Hypercomputation and the Church–Turing Thesis
inferred← citeshttps://doi.org/10.1080/00048409912348801openalex-snapshot
Beyond the universal Turing machine
inferred← citeshttps://doi.org/10.1080/17445760701536068openalex-snapshot
Accelerating machines: a review
inferred← citeshttps://doi.org/10.1086/289716openalex-snapshot
Forever is a Day: Supertasks in Pitowsky and Malament-Hogarth Spacetimes
inferred← citeshttps://doi.org/10.1086/psaprocbienmeetp.1994.1.193018openalex-snapshot
Non-Turing Computers and Non-Turing Computability
inferred← citeshttps://doi.org/10.1093/bjps/55.4.681openalex-snapshot
Deciding Arithmetic UsingSADComputers
inferred← citeshttps://doi.org/10.1093/bjps/axn031openalex-snapshot
The Extent of Computation in Malament–Hogarth Spacetimes
inferred← citeshttps://doi.org/10.1093/bjps/axp038openalex-snapshot
SAD Computers and Two Versions of the Church–Turing Thesis
inferred← citeshttps://doi.org/10.1093/logcom/11.1.25openalex-snapshot
Revision Sequences and Computers with an Infinite Amount of Time
inferred← citeshttps://doi.org/10.1093/oso/9780197552384.001.0001openalex-snapshot
The Nature of Physical Computation
inferred← citeshttps://doi.org/10.1093/oso/9780197552384.003.0002openalex-snapshot
Desiderata of a Theory of Computation
inferred← citeshttps://doi.org/10.1093/oso/9780197552384.003.0003openalex-snapshot
Turing’s Computability
inferred← citeshttps://doi.org/10.1093/oso/9780197552384.003.0004openalex-snapshot
Preamble to Machine Computation
inferred← citeshttps://doi.org/10.1093/oso/9780197552384.003.0005openalex-snapshot
Computation as Step-Satisfaction
inferred← citeshttps://doi.org/10.1093/oso/9780197552384.003.0006openalex-snapshot
Computation as Implementation
inferred← citeshttps://doi.org/10.1093/oso/9780197552384.003.0007openalex-snapshot
Computation as Mechanism
inferred← citeshttps://doi.org/10.1093/oso/9780197552384.003.0008openalex-snapshot
The Semantic View of Computation
inferred← citeshttps://doi.org/10.1093/oso/9780197552384.003.0009openalex-snapshot
An Argument for the Semantic View
inferred← citeshttps://doi.org/10.1093/oso/9780197552384.003.0010openalex-snapshot
Computing as Modeling
inferred← citeshttps://doi.org/10.1103/physrevd.104.024063openalex-snapshot
Singularity theorems for the Reissner-Nordström spacetime and topology change in regular black holes
inferred← citeshttps://doi.org/10.1103/physrevd.92.064036openalex-snapshot
Comparison theorems for causal diamonds
inferred← citeshttps://doi.org/10.1109/models.2015.7338239openalex-snapshot
Beyond discrete modeling: A continuous and efficient model for IoT
inferred← citeshttps://doi.org/10.1111/phpr.13084openalex-snapshot
Infinite inference and mathematical conventionalism
inferred← citeshttps://doi.org/10.1142/s0129626412020033openalex-snapshot
GUEST EDITOR'S NOTE: SPECIAL ISSUE ON HYPERCOMPUTATION, PHYSICS AND COMPUTATION
inferred← citeshttps://doi.org/10.1142/s0129626412400105openalex-snapshot
CLOSED TIMELIKE CURVES IN RELATIVISTIC COMPUTATION
inferred← citeshttps://doi.org/10.1142/s0218271826500513openalex-snapshot
Decidability, observational bridges and finite-information quantum gravity
inferred← citeshttps://doi.org/10.14236/ewic/vocs2008.33openalex-snapshot
Grand Challenge 7: Journeys in Non-Classical Computation
inferred← citeshttps://doi.org/10.14288/1.0302406openalex-snapshot
The limits of predictability : indeterminism and undecidability in classical and quantum physics
inferred← citeshttps://doi.org/10.17791/jcs.2011.12.4.361openalex-snapshot
Beyond Formal Structure: A Mechanistic Perspective on Computation and Implementation
inferred← citeshttps://doi.org/10.2307/2183531openalex-snapshot
On the Possibility of Completing an Infinite Process
inferred← citeshttps://doi.org/10.25088/complexsystems.29.2.599openalex-snapshot
Some Relativistic and Gravitational Properties of the Wolfram Model
inferred← citeshttps://doi.org/10.31235/osf.io/hywjzopenalex-snapshot
SAD computers and two versions of the Church–Turing Thesis
inferred← citeshttps://doi.org/10.31235/osf.io/pqd8popenalex-snapshot
Hyperloops do not threaten the notion of an effective procedure
inferred← citeshttps://doi.org/10.3390/e14101939openalex-snapshot
Programming Unconventional Computers: Dynamics, Development, Self-Reference
inferred← citeshttps://doi.org/10.3390/philosophies11050171openalex-snapshot
The Mathematical Objection to Artificial (Machine) Intelligence
inferred← citeshttps://doi.org/10.3390/universe8010040openalex-snapshot
Fundamental Physics and Computation: The Computer-Theoretic Framework
inferred← citeshttps://doi.org/10.37467/revtechno.v13.5005openalex-snapshot
¿Existen las máquinas aceleradas de Turing?
inferred← citeshttps://doi.org/10.4000/philosophiascientiae.766openalex-snapshot
La thèse de l’hyper-calcul : enjeux et problèmes philosophiques
inferred← citeshttps://doi.org/10.4115/jla.2017.9.c3openalex-snapshot
How constructive is constructing measures?
inferred← citeshttps://doi.org/10.48550/arxiv.0804.2934openalex-snapshot
The Aleph-zero or zero dichotomy
inferred← citeshttps://doi.org/10.48550/arxiv.0805.1443openalex-snapshot
The Computational Status of Physics: A Computable Formulation of Quantum Theory
inferred← citeshttps://doi.org/10.48550/arxiv.1001.4224openalex-snapshot
On Bifurcated supertasks and related questions
inferred← citeshttps://doi.org/10.48550/arxiv.1003.1238openalex-snapshot
Can a computer be "pushed" to perform faster-than-light?
inferred← citeshttps://doi.org/10.48550/arxiv.1211.6468openalex-snapshot
Using Isabelle to verify special relativity, with application to hypercomputation theory
inferred← citeshttps://doi.org/10.48550/arxiv.1307.6599openalex-snapshot
Towards a Church-Turing-Thesis for Infinitary Computations
inferred← citeshttps://doi.org/10.48550/arxiv.1409.3428openalex-snapshot
How constructive is constructing measures?
inferred← citeshttps://doi.org/10.48550/arxiv.1702.02980openalex-snapshot
Computability and Complexity of Unconventional Computing Devices
inferred← citeshttps://doi.org/10.48550/arxiv.math/0209332openalex-snapshot
Hypercomputation: computing more than the Turing machine
inferred← citeshttps://doi.org/10.48550/arxiv.math/0212047openalex-snapshot
Infinite Time Turing Machines: Supertask Computation
inferred← citeshttps://doi.org/10.48550/arxiv.math/9808093openalex-snapshot
Infinite Time Turing Machines
inferred← citeshttps://doi.org/10.48550/arxiv.physics/0505042openalex-snapshot
Zeno meets modern science
inferred← citeshttps://doi.org/10.5772/intechopen.1006028openalex-snapshot
Quantum Complexity and Emulation of Black Holes
inferred← citeshttps://doi.org/10.70675/0b3f6ab0zc577z499azb8e6z4a0425f88e23openalex-snapshot
L'hyper-calcul : de la logique a la physique
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.