Random Strings and Truth-table Degrees of Turing Complete C.e. Sets

Abstract

We investigate the truth-table degrees of (co-)c.e. sets, in particular, sets of random strings. It is known that the set of random strings with respect to any universal prefix-free machine is Turing complete, but that truthtable completeness depends on the choice of universal machine. We show that for such sets of random strings, any finite set of their… (More)

Topics

Cite this paper

@inproceedings{Cai2014RandomSA, title={Random Strings and Truth-table Degrees of Turing Complete C.e. Sets}, author={Mingzhong Cai and Rodney G. Downey and Rachel Epstein and Joseph S. Miller}, year={2014} }