On the public citation graph
Recursively enumerable reals and chaitin Ω numbers
0 signed · 60 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-1-4684-6802-1openalex-snapshot
Complexity Theory of Real Functions
inferredcites →https://doi.org/10.1007/978-3-642-39652-6_10openalex-snapshot
Randomness and Complexity
inferredcites →https://doi.org/10.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferredcites →https://doi.org/10.1007/bfb0076224openalex-snapshot
Measure, Π 1 0 -classes and complete extensions of PA
inferredcites →https://doi.org/10.1016/0167-6423(90)90075-oopenalex-snapshot
The universal turing machine: A half-century survey
inferredcites →https://doi.org/10.1016/0304-3975(94)00014-xopenalex-snapshot
Computational depth and reducibility
inferredcites →https://doi.org/10.1016/s0019-9958(64)90131-7openalex-snapshot
A formal theory of inductive inference. Part II
inferredcites →https://doi.org/10.1016/s0019-9958(64)90223-2openalex-snapshot
A formal theory of inductive inference. Part I
inferredcites →https://doi.org/10.1016/s0019-9958(66)80018-9openalex-snapshot
The definition of random sequences
inferredcites →https://doi.org/10.1016/s0022-0000(73)80030-3openalex-snapshot
Process complexity and effective random tests
inferredcites →https://doi.org/10.1017/cbo9780511565663openalex-snapshot
Varieties of Constructive Mathematics
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://doi.org/10.1093/oso/9780198537748.003.0008openalex-snapshot
Logical Depth and Physical Complexity
inferredcites →https://doi.org/10.1142/0531openalex-snapshot
Information, Randomness & Incompleteness
inferredcites →https://doi.org/10.1142/9789814534758openalex-snapshot
Developments in Language Theory
inferredcites →https://doi.org/10.1145/321356.321363openalex-snapshot
On the Length of Programs for Computing Finite Binary Sequences
inferredcites →https://doi.org/10.1145/321495.321506openalex-snapshot
On the Length of Programs for Computing Finite Binary Sequences
inferredcites →https://doi.org/10.1145/321892.321894openalex-snapshot
A Theory of Program Size Formally Identical to Information Theory
inferredcites →https://doi.org/10.3217/jucs-002-05-0306openalex-snapshot
Kraft-Chaitin Inequality Revisited
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1521-3870(200204)48:3<459::aid-malq459>3.0.co;2-9openalex-snapshot
Monotonically Computable Real Numbers
inferred← citeshttps://doi.org/10.1002/malq.201700041openalex-snapshot
Π11‐Martin‐Löf randomness and Π11‐Solovay completeness
inferred← citeshttps://doi.org/10.1006/jcom.2000.0561openalex-snapshot
Weakly Computable Real Numbers
inferred← citeshttps://doi.org/10.1007/11494645_57openalex-snapshot
Presentations of K-Trivial Reals and Kolmogorov Complexity
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_64openalex-snapshot
Prefix-Free Languages and Initial Segments of Computably Enumerable Degrees
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_65openalex-snapshot
Weakly Computable Real Numbers and Total Computable Real Functions
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_55openalex-snapshot
Hierarchy of Monotonically Computable Real Numbers
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_17openalex-snapshot
Randomness, Computability, and Density
inferred← citeshttps://doi.org/10.1007/3-540-44795-4_21openalex-snapshot
Convergence and Error Bounds for Universal Prediction of Nonbinary Sequences
inferred← citeshttps://doi.org/10.1007/3-540-44968-x_17openalex-snapshot
Closure Properties of Real Number Classes under Limits and Computable Operators
inferred← citeshttps://doi.org/10.1007/978-1-4471-0717-0_16openalex-snapshot
Monotonically Computable Real Numbers
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_3openalex-snapshot
Some Recent Progress in Algorithmic Randomness
inferred← citeshttps://doi.org/10.1007/978-3-642-27654-5_3openalex-snapshot
Random Semicomputable Reals Revisited
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_18openalex-snapshot
What Percentage of Programs Halt?
inferred← citeshttps://doi.org/10.1007/s10701-018-0221-9openalex-snapshot
Epistemic Horizons and the Foundations of Quantum Mechanics
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.jcss.2003.07.004openalex-snapshot
Randomness and reducibility
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.08.001openalex-snapshot
Representation of left-computable ε-random reals
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.06.007openalex-snapshot
Random reals à la Chaitin with or without prefix-freeness
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00027-5openalex-snapshot
A characterization of c.e. random reals
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00107-4openalex-snapshot
The closure properties on real numbers under limits and computable operators
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00110-4openalex-snapshot
Presentations of computably enumerable reals
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00159-0openalex-snapshot
Recursively enumerable reals and Chaitin Ω numbers
inferred← citeshttps://doi.org/10.1017/9781316755907.004openalex-snapshot
Some computability-theoretic aspects of reals and randomness
inferred← citeshttps://doi.org/10.1137/s0097539799357441openalex-snapshot
Randomness and Recursive Enumerability
inferred← citeshttps://doi.org/10.1142/s0219061305000468openalex-snapshot
RELATIVIZING CHAITIN'S HALTING PROBABILITY
inferred← citeshttps://doi.org/10.1215/00294527-2009-017openalex-snapshot
The K-Degrees, Low for K Degrees,and Weakly Low for K Sets
inferred← citeshttps://doi.org/10.2178/jsl/1122038919openalex-snapshot
Random reals and possibly infinite computations Part I: Randomness in ∅′
inferred← citeshttps://doi.org/10.2178/jsl/1231082305openalex-snapshot
From index sets to randomness in ∅n: random reals and possibly infinite computations part II
inferred← citeshttps://doi.org/10.3233/fi-1998-33201openalex-snapshot
Computable Approximations of Reals: An Information-Theoretic Analysis
inferred← citeshttps://doi.org/10.48550/arxiv.1110.5028openalex-snapshot
Random semicomputable reals revisited
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0106036openalex-snapshot
Convergence and Error Bounds for Universal Prediction of Nonbinary Sequences
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.