Recursively enumerable reals and Chaitin \(\Omega\) numbers (Q5941066): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4040360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3754620 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4381402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Length of Programs for Computing Finite Binary Sequences / 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: Algorithmic Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2709403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational depth and reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4070738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4294173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process complexity and effective random tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness and Recursive Enumerability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability and Recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formal theory of inductive inference. Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751553 / rank
 
Normal rank

Revision as of 18:19, 3 June 2024

scientific article; zbMATH DE number 1635231
Language Label Description Also known as
English
Recursively enumerable reals and Chaitin \(\Omega\) numbers
scientific article; zbMATH DE number 1635231

    Statements

    Recursively enumerable reals and Chaitin \(\Omega\) numbers (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 August 2001
    0 references
    halting probability
    0 references
    universal self-delimiting Turing machine
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers