Lowness properties and approximations of the jump (Q2478546): Difference between revisions

The paper compares two combinatorial lowness notions: strong jump-traceability and well-ap\-prox\-i\-mation of the jump. It constructs a non-computable strongly jump-traceable set and proves that if \(A'\) is well-approximable then \(A\) is strongly jump-traceable (for c.e.\ sets the converse is also true).