On the public citation graph

Counting the changes of random Δ20 sets

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.
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-0-387-68441-3openalex-snapshot
Algorithmic Randomness and Complexity
inferredcites →https://doi.org/10.1007/978-3-540-73001-9_49openalex-snapshot
A Weakly 2-Random Set That Is Not Generalized Low
inferredcites →https://doi.org/10.1007/978-3-642-13962-8_18openalex-snapshot
Counting the Changes of Random ${\Delta^0_2}$ Sets
inferredcites →https://doi.org/10.1016/j.apal.2011.01.004openalex-snapshot
Demuth randomness and computational complexity
inferredcites →https://doi.org/10.1016/j.apal.2011.06.008openalex-snapshot
Tracing and domination in the Turing degrees
inferredcites →https://doi.org/10.1016/j.apal.2011.12.011openalex-snapshot
Computably enumerable sets below random sets
inferredcites →https://doi.org/10.1016/s0019-9958(66)80018-9openalex-snapshot
The definition of random sequences
inferredcites →https://doi.org/10.1090/s0002-9939-2010-10513-0openalex-snapshot
Difference randomness
inferredcites →https://doi.org/10.1093/acprof:oso/9780199230761.001.0001openalex-snapshot
Computability and Randomness
inferredcites →https://doi.org/10.2140/pjm.1972.40.605openalex-snapshot
Degrees of members of Π10classes
inferredcites →https://doi.org/10.2178/bsl/1154698740openalex-snapshot
Randomness and Computability: Open Questions
inferredcites →https://doi.org/10.2178/jsl/1120224726openalex-snapshot
Randomness, relativization and Turing degrees
inferredcites →https://doi.org/10.2178/jsl/1294171001openalex-snapshot
Benign cost functions and lowness properties

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-319-50062-1_4openalex-snapshot
Some Questions in Computable Mathematics
inferred← citeshttps://doi.org/10.1007/s11856-012-0012-5openalex-snapshot
Randomness notions and partial relativization
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105384openalex-snapshot
Randomness with respect to c.e. semimeasures
inferred← citeshttps://doi.org/10.1017/9781108781718.002openalex-snapshot
Key developments in algorithmic randomness
inferred← citeshttps://doi.org/10.1017/bsl.2016.10openalex-snapshot
USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS
inferred← citeshttps://doi.org/10.1017/jsl.2019.50openalex-snapshot
RANDOMNESS NOTIONS AND REVERSE MATHEMATICS
inferred← citeshttps://doi.org/10.1093/logcom/exs075openalex-snapshot
Computability in Europe 2010
inferred← citeshttps://doi.org/10.1142/s0219061317500040openalex-snapshot
Continuous higher randomness
inferred← citeshttps://doi.org/10.1142/s0219061319500144openalex-snapshot
Computing from projections of random points
inferred← citeshttps://doi.org/10.1215/00294527-3443549openalex-snapshot
Guessing, Mind-Changing, and the Second Ambiguous Class
inferred← citeshttps://doi.org/10.4171/jems/602openalex-snapshot
Coherent randomness tests and computing the $K$-trivial sets
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.