On the public citation graph
On Approximating Real-World Halting Problems
0 signed · 35 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/3-540-46691-6_32openalex-snapshot
The Non-recursive Power of Erroneous Computation
inferredcites →https://doi.org/10.1007/978-1-4419-8501-9openalex-snapshot
A Recursive Introduction to the Theory of Computation
inferredcites →https://doi.org/10.1007/978-1-4757-2606-0openalex-snapshot
An Introduction to Kolmogorov Complexity and Its Applications
inferredcites →https://doi.org/10.1007/978-3-030-11298-1openalex-snapshot
An Introduction to Kolmogorov Complexity and Its Applications
inferredcites →https://doi.org/10.1007/978-3-0348-9259-9_2openalex-snapshot
Nicht Konstruktiv Beweisbare Sätze der Analysis
inferredcites →https://doi.org/10.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferredcites →https://doi.org/10.1007/bf01762189openalex-snapshot
Optimal enumerations and optimal gödel numberings
inferredcites →https://doi.org/10.1016/s0019-9958(74)90473-2openalex-snapshot
Tally languages and complexity classes
inferredcites →https://doi.org/10.1016/s0022-0000(74)80003-6openalex-snapshot
Approximations to the halting problem
inferredcites →https://doi.org/10.1016/s0304-3975(99)00159-0openalex-snapshot
Recursively enumerable reals and Chaitin Ω numbers
inferredcites →https://doi.org/10.1017/cbo9780511608858openalex-snapshot
Algorithmic Information Theory
inferredcites →https://doi.org/10.1080/0025570x.1996.11996408openalex-snapshot
Counting Arrangements of 1's and -1's
inferredcites →https://doi.org/10.1080/10586458.2002.10504481openalex-snapshot
Computing a Glimpse of Randomness
inferredcites →https://doi.org/10.1090/dimacs/043/04openalex-snapshot
Combinatorial property testing (a survey)
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.2140/pjm.1963.13.693openalex-snapshot
Approximations of functions on the integers
inferredcites →https://doi.org/10.2307/2267043openalex-snapshot
Nicht konstruktiv beweisbare Sätze der Analysis
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_18openalex-snapshot
What Percentage of Programs Halt?
inferred← citeshttps://doi.org/10.1007/s11416-010-0146-0openalex-snapshot
Filter-resistant code injection on ARM
inferred← citeshttps://doi.org/10.1016/j.aam.2007.01.001openalex-snapshot
Most programs stop quickly or never halt
inferred← citeshttps://doi.org/10.1016/j.chaos.2022.112050openalex-snapshot
Deeper investigation of modified epidemiological computer virus model containing the Caputo operator
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.05.026openalex-snapshot
Computable model discovery and high-level-programming approximations to algorithmic complexity
inferred← citeshttps://doi.org/10.1145/1653662.1653665openalex-snapshot
Filter-resistant code injection on ARM
inferred← citeshttps://doi.org/10.1613/jair.1.12202openalex-snapshot
Superintelligence Cannot be Contained: Lessons from Computability Theory
inferred← citeshttps://doi.org/10.31219/osf.io/dfmbkopenalex-snapshot
What Percentage of Programs Halt?
inferred← citeshttps://doi.org/10.31219/osf.io/yf6kjopenalex-snapshot
Generic algorithms for halting problem and optimal machines revisited
inferred← citeshttps://doi.org/10.3233/com-170073openalex-snapshot
A probabilistic anytime algorithm for the halting problem
inferred← citeshttps://doi.org/10.3233/com-190250openalex-snapshot
A statistical anytime algorithm for the Halting Problem
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.