Random reals and possibly infinite computations Part I: Randomness in ∅′ (Q5718694): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q61927044, #quickstatements; #temporary_batch_1712272666262
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptive set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Program Size Formally Identical to Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adherences of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The topological structure of adherences of regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presentations of computably enumerable reals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness, Computability, and Density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic entropy of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process complexity and effective random tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337021 / rank
 
Normal rank

Revision as of 14:18, 11 June 2024

scientific article; zbMATH DE number 2247451
Language Label Description Also known as
English
Random reals and possibly infinite computations Part I: Randomness in ∅′
scientific article; zbMATH DE number 2247451

    Statements

    Random reals and possibly infinite computations Part I: Randomness in ∅′ (English)
    0 references
    0 references
    0 references
    16 January 2006
    0 references
    monotone Turing machine
    0 references
    random real in \(0'\)
    0 references
    infinite computation
    0 references
    program-size complexity
    0 references

    Identifiers

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