Lowness Properties and Approximations of the Jump

  title={Lowness Properties and Approximations of the Jump},
  author={Santiago Figueira and Andr{\'e} Nies and Frank Stephan},
  journal={Electr. Notes Theor. Comput. Sci.},
We study and compare two combinatorial lowness notions: strong jump-traceability and wellapproximability of the jump, by strengthening the notion of jump-traceability and ω-r.e. for sets of natural numbers. We prove that there is a strongly jump-traceable set which is not computable, and that if A′ is well-approximable then A is strongly jump-traceable. For r.e. sets, the converse holds as well. We characterize jump-traceability and the corresponding strong variant in terms of Kolmogorov… CONTINUE READING

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 33 extracted citations


Publications referenced by this paper.
Showing 1-10 of 11 references

Classical recursion theory

  • P. G. Odifreddi
  • Volume 1, North-Holland, Amsterdam 1989,
  • 1999

An algebraic decomposition of the recursively enumerable degrees and classes equal to the promptly simple degrees

  • K. Ambos-Spies, C. Jockusch, R. Shore
  • Transactions of the American Mathematical Society…
  • 1984

Lowness properties of r.e

  • M. Bickford, F. Mills
  • UW Madison,
  • 1982
1 Excerpt

Similar Papers

Loading similar papers…