Computing K-Trivial Sets by Incomplete Random Sets

arxiv: 1305.5514 · v1 · pith:PYIMLMCTnew · submitted 2013-05-23 · 🧮 math.LO

Laurent Bienvenu , Adam R. Day , Noam Greenberg , Anton\'in Ku\v{c}era , Joseph S. Miller , Andr\'e Nies , Dan Turetsky This is my paper

classification 🧮 math.LO

keywords randomincompletek-trivialmartin-lsetscomputablecomputecomputing

0 comments

read the original abstract

Every K-trivial set is computable from an incomplete Martin-L\"of random set, i.e., a Martin-L\"of random set that does not compute 0'.

This paper has not been read by Pith yet.