Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
K-trivial set
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Abstract The K-trivial sets form an ideal in the Turing degrees, which is generated by its computably enumerable (c.e.) members… Expand
2013
2013
I discuss part of the solution for the ML-covering problem [1]. This passes through analytic notions such as martingale… Expand
2012
2012
We show that every strongly jump-traceable set is K-trivial. Unlike other results, we do not assume that the sets in question are… Expand
2012
2012
Monotone complexity, Km, is a variant of Kolmogorov complexity that was introduced independently by Levin and Schnorr. The… Expand
2011
2011
As part of his groundbreaking work on algorithmic randomness, Solovay demonstrated in the 1970s the remarkable fact that there… Expand
2011
2011
The sequences which have trivial prefix-free initial segment complexity are known as K-trivial sets, and form a cumulative… Expand
2011
2011
The field of algorithmic randomness is concerned with making precise the intuitive notion of the randomness of individual objects… Expand
2008
2008
A real is Martin-Löf (Schnorr) random if it does not belong to any effectively presented null $${\Sigma^0_1}$$ (recursive) class… Expand
Highly Cited
2007
Highly Cited
2007
AbstractLet R be a notion of algorithmic randomness for individual subsets of ℕ. A set B is a base for R randomness if there is a… Expand
2005
2005
For given real α ∈ {0,1}∞, a presentation V of α is a prefix-free and recursively enumerable subset of {0,1}* such that $\alpha… Expand