On the public citation graph

Lowness for the class of random sets

0 signed · 66 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-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferredcites →https://doi.org/10.1007/bf02757864openalex-snapshot
Subsequences of normal sequences
inferredcites →https://doi.org/10.1007/bfb0076224openalex-snapshot
Measure, Π 1 0 -classes and complete extensions of PA
inferredcites →https://doi.org/10.1016/0168-0072(93)90209-vopenalex-snapshot
On relative randomness
inferredcites →https://doi.org/10.1016/s0019-9958(66)80018-9openalex-snapshot
The definition of random sequences
inferredcites →https://doi.org/10.1016/s0019-9958(86)80004-3openalex-snapshot
Every sequence is reducible to a random one
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://doi.org/10.2307/2274480openalex-snapshot
The axiomatization of randomness

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.200710012openalex-snapshot
Almost everywhere domination and superhighness
inferred← citeshttps://doi.org/10.1002/malq.200710013openalex-snapshot
Mass problems and almost everywhere domination
inferred← citeshttps://doi.org/10.1002/malq.200910128openalex-snapshot
Truth-table Schnorr randomness and truth-table reducible randomness
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-540-28629-5_3openalex-snapshot
Some Recent Progress in Algorithmic Randomness
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_8openalex-snapshot
Working with the LR Degrees
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_14openalex-snapshot
K-Trivial Closed Sets and Continuous Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-39053-1_26openalex-snapshot
Computing K-Trivial Sets by Incomplete Random Sets
inferred← citeshttps://doi.org/10.1007/978-3-662-04978-5_7openalex-snapshot
Computably Enumerable Random Reals
inferred← citeshttps://doi.org/10.1007/978-94-015-9757-9_23openalex-snapshot
On the Quantitative Structure of Δ 2 0
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-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.06.005openalex-snapshot
Characterizing the strongly jump-traceable sets via randomness
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.jco.2006.03.007openalex-snapshot
Random non-cupping revisited
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.03.055openalex-snapshot
On Kurtz randomness
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.09.020openalex-snapshot
On the number of infinite sequences with trivial initial segment complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.08.010openalex-snapshot
Lowness and logical depth
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80377-3openalex-snapshot
Trivial Reals
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/cbo9780511750762.008openalex-snapshot
The Gödel hierarchy and reverse mathematics
inferred← citeshttps://doi.org/10.1017/jsl.2013.21openalex-snapshot
CHARACTERIZING LOWNESS FOR DEMUTH RANDOMNESS
inferred← citeshttps://doi.org/10.1090/s0002-9939-06-08540-6openalex-snapshot
Non-cupping and randomness
inferred← citeshttps://doi.org/10.1090/s0002-9939-2014-11997-6openalex-snapshot
Cupping with random sets
inferred← citeshttps://doi.org/10.1090/s0002-9947-08-04395-xopenalex-snapshot
On initial segment complexity and degrees of randomness
inferred← citeshttps://doi.org/10.1093/logcom/exn021openalex-snapshot
K-Triviality of Closed Sets and Continuous Functions
inferred← citeshttps://doi.org/10.1093/logcom/exq049openalex-snapshot
Prompt enumerations and relative 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.1137/s0097539704446323openalex-snapshot
Lowness for the Class of Schnorr Random Reals
inferred← citeshttps://doi.org/10.1142/9789812794055_0001openalex-snapshot
FIVE LECTURES ON ALGORITHMIC RANDOMNESS
inferred← citeshttps://doi.org/10.1142/9789812796554_0005openalex-snapshot
LOWNESS FOR COMPUTABLE MACHINES
inferred← citeshttps://doi.org/10.1142/9789814324359_0039openalex-snapshot
Interactions of Computability and Randomness
inferred← citeshttps://doi.org/10.1142/9789814449274_0016openalex-snapshot
Calibrating the complexity of $\Delta^{0}_{2}$ sets via their changes
inferred← citeshttps://doi.org/10.1215/00294527-2010-012openalex-snapshot
Relative Randomness and Cardinality
inferred← citeshttps://doi.org/10.2178/bsl/1107959497openalex-snapshot
Mass Problems and Randomness
inferred← citeshttps://doi.org/10.2178/bsl/1154698741openalex-snapshot
Calibrating Randomness
inferred← citeshttps://doi.org/10.2178/bsl/1255526083openalex-snapshot
2009 North American Annual Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.2178/bsl/1264433799openalex-snapshot
2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09
inferred← citeshttps://doi.org/10.2178/jsl/1120224726openalex-snapshot
Randomness, relativization and Turing degrees
inferred← citeshttps://doi.org/10.2178/jsl/1146620156openalex-snapshot
Enumerations of the Kolmogorov function
inferred← citeshttps://doi.org/10.2178/jsl/1154698590openalex-snapshot
Lowness and nullsets
inferred← citeshttps://doi.org/10.2178/jsl/1208359060openalex-snapshot
Randomness, lowness and degrees
inferred← citeshttps://doi.org/10.2178/jsl/1243948325openalex-snapshot
Low upper bounds of ideals
inferred← citeshttps://doi.org/10.2178/jsl/1294171001openalex-snapshot
Benign cost functions and lowness properties
inferred← citeshttps://doi.org/10.2307/2695101openalex-snapshot
Computational randomness and lowness
inferred← citeshttps://doi.org/10.3233/com-12014openalex-snapshot
Incompleteness, Approximation and Relative Randomness
inferred← citeshttps://doi.org/10.4171/022-2/1openalex-snapshot
Algorithmic randomness and computability
inferred← citeshttps://doi.org/10.4171/jems/602openalex-snapshot
Coherent randomness tests and computing the $K$-trivial sets
inferred← citeshttps://doi.org/10.48550/arxiv.1109.6749openalex-snapshot
Characterizing the strongly jump-traceable sets via randomness
inferred← citeshttps://doi.org/10.48550/arxiv.1302.0454openalex-snapshot
Calibrating the complexity of Delta 2 sets via their changes
inferred← citeshttps://doi.org/10.48550/arxiv.1703.01577openalex-snapshot
Calculus of Cost Functions
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.