Computing K-Trivial Sets by Incomplete Random Sets
Logic
2013-05-24 v1
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'.
Cite
@article{arxiv.1305.5514,
title = {Computing K-Trivial Sets by Incomplete Random Sets},
author = {Laurent Bienvenu and Adam R. Day and Noam Greenberg and Antonín Kučera and Joseph S. Miller and André Nies and Dan Turetsky},
journal= {arXiv preprint arXiv:1305.5514},
year = {2013}
}