Inherent enumerability of strong jump-traceability

preprint2011arXivOpen access

Abstract

We show that every strongly jump-traceable set obeys every benign cost function. Moreover, we show that every strongly jump-traceable set is computable from a computably enumerable strongly jump-traceable set. This allows us to generalise properties of c.e.\ strongly jump-traceable sets to all such sets. For example, the strongly jump-traceable sets induce an ideal in the Turing degrees; the strongly jump-traceable sets are precisely those that are computable from all superlow Martin-Löf random sets; the strongly jump-traceable sets are precisely those that are a base for DemuthBLR\text{Demuth}_{\text{BLR}}-randomness; and strong jump-traceability is equivalent to strong superlowness.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.