On the public citation graph

Lowness for Weakly 1-generic and Kurtz-Random

0 signed · 38 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/11672142_11openalex-snapshot
Kolmogorov Complexity and the Recursion Theorem
inferredcites →https://doi.org/10.1007/978-1-4757-3860-5openalex-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-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferredcites →https://doi.org/10.1007/s00153-005-0306-yopenalex-snapshot
Lowness for genericity
inferredcites →https://doi.org/10.1016/j.aim.2004.10.006openalex-snapshot
Lowness properties and randomness
inferredcites →https://doi.org/10.1016/j.tcs.2004.03.055openalex-snapshot
On Kurtz randomness
inferredcites →https://doi.org/10.1016/s0049-237x(99)x8037-2openalex-snapshot
Classical Recursion Theory
inferredcites →https://doi.org/10.1017/cbo9780511629167.005openalex-snapshot
Array nonrecursive degrees and genericity
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.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://doi.org/10.1112/blms/25.6.611openalex-snapshot
CLASSICAL RECURSION THEORY
inferredcites →https://doi.org/10.1137/s0097539704446323openalex-snapshot
Lowness for the Class of Schnorr Random Reals
inferredcites →https://doi.org/10.1142/s0219061305000468openalex-snapshot
RELATIVIZING CHAITIN'S HALTING PROBABILITY
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/bsl/1154698740openalex-snapshot
Randomness and Computability: Open Questions
inferredcites →https://doi.org/10.2307/2695101openalex-snapshot
Computational randomness and lowness

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-540-73420-8_56openalex-snapshot
Reconciling Data Compression and Kolmogorov Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_17openalex-snapshot
Lowness for Demuth Randomness
inferred← citeshttps://doi.org/10.1007/s00153-010-0187-6openalex-snapshot
Relativized Schnorr tests with universal behavior
inferred← citeshttps://doi.org/10.1007/s00153-014-0413-8openalex-snapshot
Unified characterizations of lowness properties via Kolmogorov complexity
inferred← citeshttps://doi.org/10.1007/s11856-008-1019-9openalex-snapshot
Lowness of higher randomness notions
inferred← citeshttps://doi.org/10.1016/j.apal.2020.102872openalex-snapshot
Computable analogs of cardinal characteristics: Prediction and rearrangement
inferred← citeshttps://doi.org/10.1017/cbo9780511605321.007openalex-snapshot
The sixth lecture on algorithmic randomness
inferred← citeshttps://doi.org/10.1017/fms.2017.27openalex-snapshot
HIGHER RANDOMNESS AND GENERICITY
inferred← citeshttps://doi.org/10.1017/jsl.2013.21openalex-snapshot
CHARACTERIZING LOWNESS FOR DEMUTH RANDOMNESS
inferred← citeshttps://doi.org/10.1017/jsl.2022.69openalex-snapshot
PARTITION GENERICITY AND PIGEONHOLE BASIS THEOREMS
inferred← citeshttps://doi.org/10.1090/s0002-9947-2011-05306-7openalex-snapshot
Kolmogorov complexity and the Recursion Theorem
inferred← citeshttps://doi.org/10.1093/logcom/ext054openalex-snapshot
Uniform Kurtz randomness
inferred← citeshttps://doi.org/10.1109/ccc.2007.17openalex-snapshot
On C-Degrees, H-Degrees and T-Degrees
inferred← citeshttps://doi.org/10.1112/blms/bdr007openalex-snapshot
Relativizations of randomness and genericity notions
inferred← citeshttps://doi.org/10.1142/9789814293020_0006openalex-snapshot
Lowness and highness properties for randomness notions
inferred← citeshttps://doi.org/10.1142/s0219061323500058openalex-snapshot
Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics
inferred← citeshttps://doi.org/10.2178/bsl/1154698740openalex-snapshot
Randomness and Computability: Open Questions
inferred← citeshttps://doi.org/10.2178/jsl/1243948333openalex-snapshot
Lowness for Kurtz randomness
inferred← citeshttps://doi.org/10.2178/jsl/1305810761openalex-snapshot
Jump inversions inside effectively closed sets and applications to randomness
inferred← citeshttps://doi.org/10.3233/com-180219openalex-snapshot
Cardinal invariants, non-lowness classes, and Weihrauch reducibility
inferred← citeshttps://doi.org/10.4171/022-2/1openalex-snapshot
Algorithmic randomness and 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.