Skip to search formSkip to main contentSkip to account menu

K-trivial set

Known as: K-trivial sets 
In mathematics, a set of natural numbers is called a K-trivial set if its initial segments viewed as binary strings are easy to describe: the prefix… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
A remarkable achievement in algorithmic randomness and algorithmic information theory was the discovery of the notions of K… 
2014
2014
Abstract The K-trivial sets form an ideal in the Turing degrees, which is generated by its computably enumerable (c.e.) members… 
2013
2013
I discuss part of the solution for the ML-covering problem [1]. This passes through analytic notions such as martingale… 
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… 
2011
2011
As part of his groundbreaking work on algorithmic randomness, Solovay demonstrated in the 1970s the remarkable fact that there… 
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… 
2007
2007
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…