On the public citation graph

Kolmogorov Complexity and the Recursion Theorem

0 signed · 27 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

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/bfb0076224openalex-snapshot
Measure, Π 1 0 -classes and complete extensions of PA
inferredcites →https://doi.org/10.1016/s0049-237x(08)70045-4openalex-snapshot
Degrees of Functions with no Fixed Points
inferredcites →https://doi.org/10.1016/s0049-237x(99)x8037-2openalex-snapshot
Classical Recursion Theory
inferredcites →https://doi.org/10.1090/s0002-9904-1944-08111-1openalex-snapshot
Recursively enumerable sets of positive integers and their decision problems
inferredcites →https://doi.org/10.1137/s0097539704446323openalex-snapshot
Lowness for the Class of Schnorr Random Reals
inferredcites →https://doi.org/10.1145/262301.1040343openalex-snapshot
Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series))
inferredcites →https://doi.org/10.2178/jsl/1102022212openalex-snapshot
Comparing DNR and WWKL
inferredcites →https://doi.org/10.2178/jsl/1146620156openalex-snapshot
Enumerations of the Kolmogorov function

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11494645_57openalex-snapshot
Presentations of K-Trivial Reals and Kolmogorov Complexity
inferred← citeshttps://doi.org/10.1007/11750321_72openalex-snapshot
Lowness for Weakly 1-generic and Kurtz-Random
inferred← citeshttps://doi.org/10.1007/978-3-319-43669-2_12openalex-snapshot
Calculus of Cost Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-85780-8_13openalex-snapshot
Universal Recursively Enumerable Sets of Strings
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_28openalex-snapshot
Index Sets and Universal Numberings
inferred← citeshttps://doi.org/10.1007/s10114-017-6585-5openalex-snapshot
Non-low2-ness and computable Lipschitz reducibility
inferred← citeshttps://doi.org/10.1016/j.apal.2020.102872openalex-snapshot
Computable analogs of cardinal characteristics: Prediction and rearrangement
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.05.025openalex-snapshot
Lowness Properties and Approximations of the Jump
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.06.006openalex-snapshot
Kolmogorov complexity of initial segments of sequences and arithmetical definability
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.09.020openalex-snapshot
On the number of infinite sequences with trivial initial segment complexity
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.005openalex-snapshot
Computability theory, algorithmic randomness and Turing's anticipation
inferred← citeshttps://doi.org/10.1109/ccc.2007.17openalex-snapshot
On C-Degrees, H-Degrees and T-Degrees
inferred← citeshttps://doi.org/10.1145/2287718.2287724openalex-snapshot
Arithmetic complexity via effective names for random sequences
inferred← citeshttps://doi.org/10.1215/00294527-2010-026openalex-snapshot
Subclasses of the Weakly Random Reals
inferred← citeshttps://doi.org/10.2178/jsl/1243948334openalex-snapshot
Automorphisms of the truth-table degrees are fixed on a cone
inferred← citeshttps://doi.org/10.2748/tmj/1325886278openalex-snapshot
Mass problems associated with effectively closed sets
inferred← citeshttps://doi.org/10.3233/com-170076openalex-snapshot
Pointed computations and Martin-Löf randomness
inferred← citeshttps://doi.org/10.3233/com-180219openalex-snapshot
Cardinal invariants, non-lowness classes, and Weihrauch reducibility
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.