Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,620,078 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
12 relations
Broader (2)
Algorithmic information theory
Computability theory
Algorithmically random sequence
Arithmetical hierarchy
Chaitin's constant
Computer science
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Nullifying randomness and genericity using symmetric difference
R. Kuyper
,
Joseph S. Miller
Ann. Pure Appl. Log.
2017
Corpus ID: 38872363
Review
2015
Review
2015
K-trivial, K-low and MLR-low Sequences: A Tutorial
L. Bienvenu
,
A. Shen
Fields of Logic and Computation II
2015
Corpus ID: 10435847
A remarkable achievement in algorithmic randomness and algorithmic information theory was the discovery of the notions of K…
Expand
2014
2014
EXACT PAIRS FOR THE IDEAL OF THE K-TRIVIAL SEQUENCES IN THE TURING DEGREES
George Barmpalias
,
R. Downey
The Journal of Symbolic Logic
2014
Corpus ID: 14951494
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
Computing K-Trivial Sets by Incomplete Random Sets
Noam Greenberg
CiE
2013
Corpus ID: 8702614
I discuss part of the solution for the ML-covering problem [1]. This passes through analytic notions such as martingale…
Expand
2012
2012
Strong jump-traceability II: K-triviality
R. Downey
,
Noam Greenberg
2012
Corpus ID: 10451270
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
2011
2011
On the number of infinite sequences with trivial initial segment complexity
George Barmpalias
,
T. Sterkenburg
Theor. Comput. Sci.
2011
Corpus ID: 15138081
2011
2011
Solovay functions and K-triviality
L. Bienvenu
,
W. Merkle
,
A. Nies
STACS
2011
Corpus ID: 16410588
As part of his groundbreaking work on algorithmic randomness, Solovay demonstrated in the 1970s the remarkable fact that there…
Expand
2008
2008
Schnorr trivial reals: a construction
Johanna N. Y. Franklin
Arch. Math. Log.
2008
Corpus ID: 9274995
A real is Martin-Löf (Schnorr) random if it does not belong to any effectively presented null $${\Sigma^0_1}$$ (recursive) class…
Expand
2007
2007
Schnorr Trivial Reals: A construction
Johanna N. Y. Franklin
Electron. Notes Theor. Comput. Sci.
2007
Corpus ID: 43572052
2005
2005
Presentations of K-Trivial Reals and Kolmogorov Complexity
F. Stephan
,
Guohua Wu
CiE
2005
Corpus ID: 39007433
For given real α ∈ {0,1}∞, a presentation V of α is a prefix-free and recursively enumerable subset of {0,1}* such that $\alpha…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE