On the public citation graph
Computational randomness and lowness
0 signed · 94 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.19680140704openalex-snapshot
The Degrees of Hyperimmune Sets
inferredcites →https://doi.org/10.1007/bf02760523openalex-snapshot
A mathematical proof of S. Shelah’s theorem on the measure problem and related results
inferredcites →https://doi.org/10.1007/bfb0076224openalex-snapshot
Measure, Π 1 0 -classes and complete extensions of PA
inferredcites →https://doi.org/10.1007/bfb0112458openalex-snapshot
Zufälligkeit und Wahrscheinlichkeit
inferredcites →https://doi.org/10.1016/s0019-9958(66)80018-9openalex-snapshot
The definition of random sequences
inferredcites →https://doi.org/10.1016/s0049-237x(08)71622-7openalex-snapshot
Remarks on Constructive Mathematical Analysis
inferredcites →https://doi.org/10.1016/s0049-237x(99)x8037-2openalex-snapshot
Classical Recursion Theory
inferredcites →https://doi.org/10.1090/conm/257openalex-snapshot
Computability Theory and Its Applications
inferredcites →https://doi.org/10.1090/conm/257/04023openalex-snapshot
Randomness in computability theory
inferredcites →https://doi.org/10.1201/9780429187490openalex-snapshot
complexity, logic, and recursion theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.200310121openalex-snapshot
On Schnorr and computable randomness, martingales, and machines
inferred← citeshttps://doi.org/10.1002/malq.200710012openalex-snapshot
Almost everywhere domination and superhighness
inferred← citeshttps://doi.org/10.1002/malq.200910128openalex-snapshot
Truth-table Schnorr randomness and truth-table reducible randomness
inferred← citeshttps://doi.org/10.1002/malq.201900066openalex-snapshot
Lowness for isomorphism, countable ideals, and computable traceability
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-50062-1_30openalex-snapshot
Asymptotic Density and the Theory of Computability: A Partial Survey
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_42openalex-snapshot
Lowness, Randomness, and Computable Analysis
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-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-007-0061-3openalex-snapshot
Schnorr trivial reals: a construction
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/s00224-013-9506-8openalex-snapshot
Schnorr Triviality and Its Equivalent Notions
inferred← citeshttps://doi.org/10.1007/s00224-014-9583-3openalex-snapshot
Reducibilities Relating to Schnorr Randomness
inferred← citeshttps://doi.org/10.1007/s11856-008-1019-9openalex-snapshot
Lowness of higher randomness notions
inferred← citeshttps://doi.org/10.1007/s11856-011-0217-zopenalex-snapshot
Strong jump-traceability II: K-triviality
inferred← citeshttps://doi.org/10.1007/s11856-012-0012-5openalex-snapshot
Randomness notions and partial relativization
inferred← citeshttps://doi.org/10.1016/j.aim.2004.10.006openalex-snapshot
Lowness properties and randomness
inferred← citeshttps://doi.org/10.1016/j.aim.2007.09.008openalex-snapshot
Strong jump-traceability I: The computably enumerable case
inferred← citeshttps://doi.org/10.1016/j.aim.2012.12.018openalex-snapshot
Pseudo-jump inversion, upper cone avoidance, and strong jump-traceability
inferred← citeshttps://doi.org/10.1016/j.apal.2007.11.002openalex-snapshot
Lowness properties and approximations of the jump
inferred← citeshttps://doi.org/10.1016/j.apal.2007.11.014openalex-snapshot
On strongly jump traceable reals
inferred← citeshttps://doi.org/10.1016/j.apal.2011.06.008openalex-snapshot
Tracing and domination in the Turing degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2011.06.009openalex-snapshot
Randomness and lowness notions via open covers
inferred← citeshttps://doi.org/10.1016/j.apal.2013.06.001openalex-snapshot
Natural factors of the Muchnik lattice capturing IPC
inferred← citeshttps://doi.org/10.1016/j.apal.2016.10.017openalex-snapshot
Covering the recursive sets
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.apal.2025.103586openalex-snapshot
Some more results on relativized Chaitin's Ω
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.entcs.2006.08.008openalex-snapshot
Schnorr Trivial Reals: A construction
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.05.028openalex-snapshot
Turing degrees of reals of positive effective packing dimension
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.04.005openalex-snapshot
A K-trivial set which is not jump traceable at certain orders
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.05.001openalex-snapshot
Integer valued betting strategies and Turing degrees
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80845-4openalex-snapshot
Lowness Properties of Reals and Hyper-Immunity
inferred← citeshttps://doi.org/10.1017/9781108781718.002openalex-snapshot
Key developments in algorithmic randomness
inferred← citeshttps://doi.org/10.1017/9781316755907.004openalex-snapshot
Some computability-theoretic aspects of reals and randomness
inferred← citeshttps://doi.org/10.1017/cbo9780511605321.007openalex-snapshot
The sixth lecture on algorithmic randomness
inferred← citeshttps://doi.org/10.1017/cbo9780511605321.011openalex-snapshot
Strong minimal covers and a question of Yates: The story so far
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.005openalex-snapshot
Computability theory, algorithmic randomness and Turing's anticipation
inferred← citeshttps://doi.org/10.1017/jsl.2020.38openalex-snapshot
RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS
inferred← citeshttps://doi.org/10.1017/s0022481200010124openalex-snapshot
JSL volume 66 issue 4 Cover and Back matter
inferred← citeshttps://doi.org/10.1090/s0002-9939-09-09761-5openalex-snapshot
𝐾-trivial degrees and the jump-traceability hierarchy
inferred← citeshttps://doi.org/10.1090/s0002-9947-2014-06089-3openalex-snapshot
Inherent enumerability of strong jump-traceability
inferred← citeshttps://doi.org/10.1109/lics.2015.60openalex-snapshot
A Unifying Approach to the Gamma Question
inferred← citeshttps://doi.org/10.1112/blms/bdm083openalex-snapshot
Π10 classes, strong minimal covers and hyperimmune-free degrees
inferred← citeshttps://doi.org/10.1137/s0097539704446323openalex-snapshot
Lowness for the Class of Schnorr Random Reals
inferred← citeshttps://doi.org/10.1142/9789812796554_0004openalex-snapshot
PROMPT SIMPLICITY, ARRAY COMPUTABILITY AND CUPPING
inferred← citeshttps://doi.org/10.1142/9789812796554_0005openalex-snapshot
LOWNESS FOR COMPUTABLE MACHINES
inferred← citeshttps://doi.org/10.1142/9789814293020_0006openalex-snapshot
Lowness and highness properties for randomness notions
inferred← citeshttps://doi.org/10.1142/9789814678001_0001openalex-snapshot
An Analogy between Cardinal Characteristics and Highness Properties of Oracles
inferred← citeshttps://doi.org/10.1215/00294527-2010-017openalex-snapshot
Effective Packing Dimension and Traceability
inferred← citeshttps://doi.org/10.1215/00294527-2377878openalex-snapshot
Lowness for Difference Tests
inferred← citeshttps://doi.org/10.2178/bsl/1154698740openalex-snapshot
Randomness and Computability: Open Questions
inferred← citeshttps://doi.org/10.2178/bsl/1286284561openalex-snapshot
2009–2010 Winter Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.2178/jsl.7804170openalex-snapshot
Anti-Complex Sets and Reducibilities with Tiny Use
inferred← citeshttps://doi.org/10.2178/jsl/1120224726openalex-snapshot
Randomness, relativization and Turing degrees
inferred← citeshttps://doi.org/10.2178/jsl/1230396761openalex-snapshot
Hyperimmune-free degrees and Schnorr triviality
inferred← citeshttps://doi.org/10.2178/jsl/1294171001openalex-snapshot
Benign cost functions and lowness properties
inferred← citeshttps://doi.org/10.3233/com-170068openalex-snapshot
The search for natural definability in the Turing degrees
inferred← citeshttps://doi.org/10.3233/com-180199openalex-snapshot
Effective localization number: Building k-surviving degrees
inferred← citeshttps://doi.org/10.3233/com-180219openalex-snapshot
Cardinal invariants, non-lowness classes, and Weihrauch reducibility
inferred← citeshttps://doi.org/10.3233/com-220432openalex-snapshot
Lowness properties for strong reducibilities and the computational power of maximal sets
inferred← citeshttps://doi.org/10.4064/fm118-10-2015openalex-snapshot
Asymptotic density, computable traceability, and 1-randomness
inferred← citeshttps://doi.org/10.4171/022-2/1openalex-snapshot
Algorithmic randomness and computability
inferred← citeshttps://doi.org/10.48550/arxiv.1109.6752openalex-snapshot
Pseudo-jump inversion and SJT-hard sets
inferred← citeshttps://doi.org/10.48550/arxiv.1110.1435openalex-snapshot
Inherent enumerability of strong jump-traceability
inferred← citeshttps://doi.org/10.48550/arxiv.1210.6538openalex-snapshot
Natural Factors of the Muchnik Lattice Capturing IPC
inferred← citeshttps://doi.org/10.48550/arxiv.2107.10470openalex-snapshot
Some consequences of $\mathrm{TD}$ and $\mathrm{sTD}$
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.