Lowness, Randomness, and Computable Analysis (Q2970988): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1607.07030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic density, computable traceability, and 1-randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTING<i>K</i>-TRIVIAL SETS BY INCOMPLETE RANDOM SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coherent randomness tests and computing the \(K\)-trivial sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Denjoy, Demuth and density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness and differentiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analogy between Cardinal Characteristics and Highness Properties of Oracles / 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: Density, forcing, and the covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4088797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness, Computability, and Density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4460833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness and nullsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: T-Degrees, Jump Classes, and Strong Reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indifferent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Lipschitz Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Approach to the Borwein-Ditor Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using random sets as oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic density and the coarse computability bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: The degrees of bi‐immune sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semirecursive Sets and Positive Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: ∏ 0 1 Classes and Degrees of Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: LEBESGUE DENSITY AND CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: DEMUTH’S PATH TO RANDOMNESS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Degrees of Hyperimmune Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness and Computability: Open Questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY 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: A Unifying Approach to the Gamma Question / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness properties and randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3611832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3224092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differentiability of polynomial time computable functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational aspect of the Lebesgue differentiation theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schnorr randomness and the Lebesgue differentiation theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal degree less than 0’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: The recursively enumerable degrees are dense / 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: On degrees of recursive unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational randomness and lowness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ergodic theorems for individual random sequences / rank
 
Normal rank

Latest revision as of 14:42, 13 July 2024

scientific article
Language Label Description Also known as
English
Lowness, Randomness, and Computable Analysis
scientific article

    Statements

    Lowness, Randomness, and Computable Analysis (English)
    0 references
    0 references
    4 April 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers