An incomplete set of shortest descriptions (Q5388731): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008534491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520520 / 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: Incompleteness theorems for random reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Immunity and Btt-Reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of computability theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Index Sets and Universal Numberings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On btt‐Degrees of Sets of Minimal Numbers in Gödel Numberings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursion theoretic properties of frequency computation and bounded queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: The definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Program size in restricted programming languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation and embedding in the recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Enumerability and the Jump Operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: The recursively enumerable degrees are dense / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guided tour of minimal indices and shortest descriptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Immunity and hyperimmunity for sets of minimal indices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Turing degrees of minimal index sets / 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 02:48, 5 July 2024

scientific article; zbMATH DE number 6025971
Language Label Description Also known as
English
An incomplete set of shortest descriptions
scientific article; zbMATH DE number 6025971

    Statements

    An incomplete set of shortest descriptions (English)
    0 references
    0 references
    0 references
    19 April 2012
    0 references
    shortest descriptions
    0 references
    domain-random strings
    0 references
    truth-table degrees
    0 references
    retraceability
    0 references
    approximability
    0 references

    Identifiers

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