Probabilistic Algorithmic Randomness (Q5300079): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to the definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3611832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical metaphysics of randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on effective randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to Kolmogorov complexity and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing notions of randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why computational complexity requires stricter martingales / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank

Latest revision as of 13:22, 6 July 2024

scientific article; zbMATH DE number 6180300
Language Label Description Also known as
English
Probabilistic Algorithmic Randomness
scientific article; zbMATH DE number 6180300

    Statements

    Probabilistic Algorithmic Randomness (English)
    0 references
    0 references
    0 references
    24 June 2013
    0 references
    algorithmic randomness
    0 references
    (partially) computable martingales
    0 references
    Martin-Löf randomness
    0 references
    computable randomness
    0 references
    partial computable randomness
    0 references

    Identifiers