A Chaitin \(\Omega\) number based on compressible strings (Q1761717): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4538731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural halting probabilities, partial randomness, and zeta functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On partial randomness / 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 entropy of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness and Recursive Enumerability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3611832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4262002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process complexity and effective random tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed Point Theorems on Partial Randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Randomness and Dimension of Recursively Enumerable Reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical physics I. Equilibrium statistical mechanics. Rev. transl. from the Japanese ed. by Morikazu Toda and Nobuhiko Saitô. / 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

Latest revision as of 21:58, 5 July 2024

scientific article
Language Label Description Also known as
English
A Chaitin \(\Omega\) number based on compressible strings
scientific article

    Statements

    A Chaitin \(\Omega\) number based on compressible strings (English)
    0 references
    0 references
    15 November 2012
    0 references
    algorithmic information theory
    0 references
    algorithmic randomness
    0 references
    Chaitin \(\Omega\) number
    0 references
    compressible string
    0 references
    fixed point
    0 references
    partial randomness
    0 references
    program-size complexity
    0 references

    Identifiers