Random strings and tt-degrees of Turing complete C.E. sets

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 truth-table completeness depends on the choice of universal machine. We show tha...

Full description

Bibliographic Details

Published in:	Logical Methods in Computer Science
Main Authors:	Mingzhong Cai, Rodney G Downey, Rachel Epstein, Steffen Lempp, Joseph Miller
Format:	Article
Language:	English
Published:	Logical Methods in Computer Science e.V. 2014-09-01
Subjects:	computer science - logic in computer science
Online Access:	https://lmcs.episciences.org/1126/pdf