K-trivial set
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Computing from Projections of Random Points: a Dense Hierarchy of Subideals of the K-trivial Degrees
- 2016
We study the sets that are computable from both halves of some (Martin-Löf) random sequence, which we call 1{2-bases. We show… (More)
Is this relevant?
2015
2015
- 2015
We introduce Oberwolfach randomness, a notion within Demuth’s framework of statistical tests with moving components; here the… (More)
Is this relevant?
Review
2015
Review
2015
- Fields of Logic and Computation II
- 2015
A remarkable achievement in algorithmic randomness and algorithmic information theory was the discovery of the notions of K… (More)
Is this relevant?
2014
2014
- J. Symb. Log.
- 2014
The K-trivial sets form an ideal in the Turing degrees, which is generated by its computably enumerable (c.e.) members and has an… (More)
Is this relevant?
2013
2013
- CiE
- 2013
Every K-trivial set is computable from an incomplete Martin-Löf random set, i.e., a Martin-Löf random set that does not compute… (More)
Is this relevant?
2012
2012
- Inf. Process. Lett.
- 2012
We construct a K-trivial c.e. set which is not jump traceable at any order in o(log x).Â
Is this relevant?
2010
2010
- 2010
In [RS07, RS08], Reimann and Slaman raise the question “For which infinite binary sequences X do there exist continuous… (More)
Is this relevant?
2006
2006
- 2006
Let R be a notion of algorithmic randomness for individual subsets of N. We say B is a base for R randomness if there is a Z >T B… (More)
Is this relevant?
2005
2005
- 2005
An analog of ML-randomness in the effective descriptive set theory setting is studied, where the r.e. objects are replaced by… (More)
Is this relevant?
2005
2005
- 2005
We investigate combinatorial lowness properties of sets of natural numbers (reals). The real A is super-low if A′ ≤tt ∅′, and A… (More)
Is this relevant?