Lowness properties and approximations of the jump (Q2478546)

From MaRDI portal
Revision as of 20:26, 27 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Lowness properties and approximations of the jump
scientific article

    Statements

    Lowness properties and approximations of the jump (English)
    0 references
    0 references
    0 references
    0 references
    28 March 2008
    0 references
    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).
    0 references
    0 references
    0 references
    0 references
    0 references
    lowness
    0 references
    strong jump-traceability
    0 references
    well-approximation of the jump
    0 references
    0 references