Browsing by Author "NIES, Andre"

Now showing 1 - 1 of 1
  • No Thumbnail Available
    Item
    Lowness Properties and Approximations of the Jump
    (2005-11-10) FIGUEIRA, Santiago; NIES, Andre; STEPHAN, Frank
    We study and compare two combinatorial lowness notions: strong jump-traceability and well-approximability of the jump, by strengthening the notion of jump-traceability and super-lowness for sets of natural numbers. A computable non-decreasing unbounded function h is called an order function. Informally, a set A is strongly jump-traceable if for each order function h, for each input e one may effectively enumerate a set T_e of possible values for the jump J^A(e) and the number of values enumerated is at most h(e). A' is well-approximable if can be effectively approximated with less than h(x) changes at input x, for each order function h. 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 complexity, and we investigate other properties of these lowness ...