On the public citation graph
Irreversibility, uncertainty, relativity and computer limitations
0 signed · 24 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.1007/978-3-663-01511-6_9openalex-snapshot
Cooperative Phenomena in Data Processing
inferredcites →https://doi.org/10.1016/0001-8708(76)90167-5openalex-snapshot
The complexity of explicit definitions
inferredcites →https://doi.org/10.1090/s0002-9939-1981-0603611-1openalex-snapshot
Ergodic Undefinability in Set Theory and Recursion Theory
inferredcites →https://doi.org/10.1090/s0002-9947-1981-0590421-1openalex-snapshot
Robinson's Consistency Theorem in Soft Model Theory
inferredcites →https://doi.org/10.1112/plms/s2-42.1.230openalex-snapshot
On Computable Numbers, with an Application to the Entscheidungsproblem
inferredcites →https://doi.org/10.1147/rd.176.0525openalex-snapshot
Logical Reversibility of Computation
inferredcites →https://doi.org/10.2307/2371045openalex-snapshot
An Unsolvable Problem of Elementary Number Theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-306-47114-0_30openalex-snapshot
Physical Limits to Computation
inferred← citeshttps://doi.org/10.1007/978-94-017-3327-4_9openalex-snapshot
Strong Determinism vs. Computability
inferred← citeshttps://doi.org/10.1007/bf00670475openalex-snapshot
Cosmological limits on computation
inferred← citeshttps://doi.org/10.1007/bf01342185openalex-snapshot
Quantum mechanical hamiltonian models of turing machines
inferred← citeshttps://doi.org/10.1007/bf01857731openalex-snapshot
Uncertainty principle and minimal energy dissipation in the computer
inferred← citeshttps://doi.org/10.1007/bf02023010openalex-snapshot
A lower bound for the complexity of Craig's interpolants in sentential logic
inferred← citeshttps://doi.org/10.1007/bf02023011openalex-snapshot
Natural limitations of decision procedures for arithmetic with bounded quantifiers
inferred← citeshttps://doi.org/10.1007/bf02828740openalex-snapshot
Energy dissipation of computational processes
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70661-5openalex-snapshot
Introduction to the Theory of Logic Programming
inferred← citeshttps://doi.org/10.1103/physrevlett.48.1581openalex-snapshot
Quantum Mechanical Models of Turing Machines That Dissipate No Energy
inferred← citeshttps://doi.org/10.1103/physrevlett.48.286openalex-snapshot
Is There a Fundamental Bound on the Rate at Which Information Can Be Processed?
inferred← citeshttps://doi.org/10.1103/physrevlett.53.1203openalex-snapshot
Comment on "Dissipation in Computation"
inferred← citeshttps://doi.org/10.48550/arxiv.1210.7171openalex-snapshot
Hypercomputation: Towards an extension of the classical notion of Computability?
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.