ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS (Q5737950): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5773777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A separation of two randomness concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Martin-Löf Randomness to Effective Probability Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilities over rich languages, testing and randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Martin-Löf random points satisfy Birkhoff’s ergodic theorem for effectively closed sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points / rank
 
Normal rank
Property / cites work
 
Property / cites work: The perception of randomness / 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: Algorithmic information theory and undecidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of Kurtz randomness by a differentiation theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The definition of random sequences / rank
 
Normal rank

Latest revision as of 22:23, 13 July 2024

scientific article; zbMATH DE number 6724399
Language Label Description Also known as
English
ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS
scientific article; zbMATH DE number 6724399

    Statements