On the public citation graph
Coherent randomness tests and computing the $K$-trivial sets
0 signed · 64 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.1002/malq.200710012openalex-snapshot
Almost everywhere domination and superhighness
inferredcites →https://doi.org/10.1002/malq.200710013openalex-snapshot
Mass problems and almost everywhere domination
inferredcites →https://doi.org/10.1007/978-0-387-68441-3openalex-snapshot
Algorithmic Randomness and Complexity
inferredcites →https://doi.org/10.1007/978-3-642-27654-5_12openalex-snapshot
Demuth’s Path to Randomness
inferredcites →https://doi.org/10.1007/bfb0016275openalex-snapshot
An alternative, priority-free, solution to Post's problem
inferredcites →https://doi.org/10.1016/0304-3975(76)90005-0openalex-snapshot
Information-theoretic characterizations of recursive infinite strings
inferredcites →https://doi.org/10.1016/j.aim.2004.10.006openalex-snapshot
Lowness properties and randomness
inferredcites →https://doi.org/10.1016/j.apal.2007.11.002openalex-snapshot
Lowness properties and approximations of the jump
inferredcites →https://doi.org/10.1016/j.apal.2011.01.004openalex-snapshot
Demuth randomness and computational complexity
inferredcites →https://doi.org/10.1016/j.ipl.2012.04.005openalex-snapshot
A K-trivial set which is not jump traceable at certain orders
inferredcites →https://doi.org/10.1016/j.tcs.2005.03.054openalex-snapshot
Uniform test of algorithmic randomness over a general space
inferredcites →https://doi.org/10.1016/s0022-0000(73)80030-3openalex-snapshot
Process complexity and effective random tests
inferredcites →https://doi.org/10.1017/bsl.2013.3openalex-snapshot
COMPUTINGK-TRIVIAL SETS BY INCOMPLETE RANDOM SETS
inferredcites →https://doi.org/10.1017/bsl.2016.10openalex-snapshot
USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS
inferredcites →https://doi.org/10.1090/s0002-9939-2013-11710-7openalex-snapshot
Schnorr randomness and the Lebesgue differentiation theorem
inferredcites →https://doi.org/10.1090/s0002-9947-08-04395-xopenalex-snapshot
On initial segment complexity and degrees of randomness
inferredcites →https://doi.org/10.1090/s0002-9947-2011-05306-7openalex-snapshot
Kolmogorov complexity and the Recursion Theorem
inferredcites →https://doi.org/10.1090/s0002-9947-2014-06089-3openalex-snapshot
Inherent enumerability of strong jump-traceability
inferredcites →https://doi.org/10.1093/logcom/exs083openalex-snapshot
Counting the changes of random Δ20 sets
inferredcites →https://doi.org/10.1111/j.2517-6161.1993.tb01482.xopenalex-snapshot
On the Empirical Validity of the Bayesian Method
inferredcites →https://doi.org/10.1112/jlms/jdr072openalex-snapshot
Lowness notions, measure and domination
inferredcites →https://doi.org/10.1142/9789814324359_0039openalex-snapshot
Interactions of Computability and Randomness
inferredcites →https://doi.org/10.1142/9789814327756_0017openalex-snapshot
Studying Randomness Through Computation
inferredcites →https://doi.org/10.1142/s0219061307000652openalex-snapshot
MASS PROBLEMS AND HYPERARITHMETICITY
inferredcites →https://doi.org/10.1145/321892.321894openalex-snapshot
A Theory of Program Size Formally Identical to Information Theory
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
inferredcites →https://doi.org/10.2307/44152020openalex-snapshot
MARTINGALE PROOF OF THE EXISTENCE OF LEBESGUE POINTS
inferredcites →https://doi.org/10.24033/asens.624openalex-snapshot
Sur l'intégration des fonctions discontinues
inferredcites →https://doi.org/10.4230/lipics.stacs.2012.543openalex-snapshot
The Denjoy alternative for computable functions
inferredcites →https://doi.org/10.4310/mrl.2015.v22.n3.a5openalex-snapshot
Density, forcing, and the covering problem
inferredcites →https://doi.org/10.48550/arxiv.1109.6749openalex-snapshot
Characterizing the strongly jump-traceable sets via randomness
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-40189-8_10openalex-snapshot
A Computational Approach to the Borwein-Ditor Theorem
inferred← citeshttps://doi.org/10.1007/978-3-319-40189-8_24openalex-snapshot
Lightface $$\mathop {\varPi }\nolimits _{3}^{0}$$ Π 3 0 -Completeness of Density Sets Under Effective Wadge Reducibility
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-319-50062-1_4openalex-snapshot
Some Questions in Computable Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_42openalex-snapshot
Lowness, Randomness, and Computable Analysis
inferred← citeshttps://doi.org/10.1007/s00224-017-9824-3openalex-snapshot
The Random Members of a Π 1 0 ${\Pi }_{1}^{0}$ Class
inferred← citeshttps://doi.org/10.1007/s11856-021-2200-7openalex-snapshot
Highness properties close to PA completeness
inferred← citeshttps://doi.org/10.1007/s11856-023-2565-xopenalex-snapshot
Martin–Löf reducibility and cost functions
inferred← citeshttps://doi.org/10.1016/j.apal.2026.103748openalex-snapshot
A variant of Chaitin's Omega function
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.2015.70openalex-snapshot
COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS
inferred← citeshttps://doi.org/10.1093/logcom/exz021openalex-snapshot
Effective aspects of Bernoulli randomness
inferred← citeshttps://doi.org/10.1142/9789813228238_0003openalex-snapshot
Limits of the Kučera–Gács Coding Method
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.4230/lipics.stacs.2020.55openalex-snapshot
Randomness and Initial Segment Complexity for Probability Measures
inferred← citeshttps://doi.org/10.48550/arxiv.1503.04884openalex-snapshot
Continuous higher randomness
inferred← citeshttps://doi.org/10.48550/arxiv.1607.07030openalex-snapshot
Lowness, randomness, and computable analysis
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.