Turing degrees and randomness for continuous measures (Q6178468): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00153-023-00873-7 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W4380843013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability and Randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4109577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measures and their random reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness for non-computable measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Members of countable \(\Pi ^ 0_ 1\) classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: K-TRIVIALS ARE NEVER CONTINUOUSLY RANDOM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective randomness for continuous measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing Computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effectively closed sets of measures and randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323294 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00153-023-00873-7 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:10, 30 December 2024

scientific article; zbMATH DE number 7790930
Language Label Description Also known as
English
Turing degrees and randomness for continuous measures
scientific article; zbMATH DE number 7790930

    Statements

    Turing degrees and randomness for continuous measures (English)
    0 references
    0 references
    0 references
    18 January 2024
    0 references
    A real is never continuous random (NCR for short) if it is not random with respect to any continuous measure. This notion has been studied by a number of people. But it is still unknown which Turing degree can contain such reals. In the paper under review, the authors prove some nice results to make some contributions to the topic. The major results are that any \(n\)-REA Turing degree contains an NCR real; and any selfmodule Turing degree contains an NCR real.
    0 references
    0 references
    algorithmic randomness
    0 references
    continuous measures
    0 references
    Turing degrees
    0 references
    recursively enumerable and above
    0 references
    moduli of computation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references