Strong jump-traceability. I: The computably enumerable case (Q2474313)

From MaRDI portal
Revision as of 21:46, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Strong jump-traceability. I: The computably enumerable case
scientific article

    Statements

    Strong jump-traceability. I: The computably enumerable case (English)
    0 references
    0 references
    0 references
    0 references
    5 March 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    strongly jump-traceable
    0 references
    \(K\)-trivial
    0 references
    Martin-Löf random
    0 references
    computability
    0 references
    computably enumerable
    0 references
    Turing degree
    0 references
    0 references