Characterizing strong randomness via Martin-Löf randomness (Q409318): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: \(\Pi_1^0 \) classes, LR degrees and Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness notions and partial relativization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low upper bounds in the LR degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness and nullsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativizations of randomness and genericity notions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every sequence is reducible to a random one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initial Segment Complexities of Randomness Notions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness notions, measure and domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3758821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3905266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(K\)-degrees, low for \(K\) degrees, and weakly low for \(K\) sets / 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: An extension of van Lambalgen's theorem to infinitely many relative 1-random reals / 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: Q4040892 / rank
 
Normal rank

Latest revision as of 02:21, 5 July 2024

scientific article
Language Label Description Also known as
English
Characterizing strong randomness via Martin-Löf randomness
scientific article

    Statements

    Characterizing strong randomness via Martin-Löf randomness (English)
    0 references
    0 references
    13 April 2012
    0 references
    The paper proposes a general way to measure the degree of algorithmic randomness stronger than Martin-Löf randomness.
    0 references
    0 references
    Martin-Löf randomness
    0 references
    Kolmogorov complexity
    0 references
    0 references