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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Peter A. Cholak / rank
Normal rank
 
Property / author
 
Property / author: Q494055 / rank
Normal rank
 
Property / author
 
Property / author: Peter A. Cholak / rank
 
Normal rank
Property / author
 
Property / author: Rodney G. Downey / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.aim.2007.09.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2171441747 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-theoretic characterizations of recursive infinite strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong jump-traceability. II: \(K\)-triviality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3530393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schnorr randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4460833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calibrating Randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness and nullsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness properties and approximations of the jump / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using random sets as oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness for the Class of Schnorr Random Reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness for the class of random sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4070739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of the Kolmogorov concept of complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness and Computability: Open Questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On initial segment complexity and degrees of randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Refinement of Lown and Highn for the R.E. Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness properties and randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5494235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cupping and randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3611832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. The theory of functions and sets of natural numbers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process complexity and effective random tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable sets and degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational randomness and lowness / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:23, 27 June 2024

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