Universal computably enumerable sets and initial segment prefix-free complexity (Q391648): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ic.2013.12.001 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963582254 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1110.1864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal pairs of computably enumerable sets in the computably Lipschitz degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Computational Paradigms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary differences between the degrees of unsolvability and degrees of compressibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative randomness and cardinality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the gap between trivial and nontrivial initial segment prefix-free complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analogues of Chaitin's Omega in the computably enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chaitin's halting probability and the compression of strings using oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kolmogorov complexity and computably enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cupping, measure and computably enumerable splittings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kolmogorov complexity of initial segments of sequences and arithmetical definability / 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: A minimal pair of 𝐾-degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness and reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of the structure of the Solovay degrees of c.e. reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness, Computability, and Density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4460833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness notions, measure and domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On initial segment complexity and degrees of randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oscillation in the initial segment complexity of random reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness properties and randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3611832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Kolmogorov complexity of random reals / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IC.2013.12.001 / rank
 
Normal rank

Latest revision as of 16:13, 9 December 2024

scientific article
Language Label Description Also known as
English
Universal computably enumerable sets and initial segment prefix-free complexity
scientific article

    Statements

    Universal computably enumerable sets and initial segment prefix-free complexity (English)
    0 references
    0 references
    10 January 2014
    0 references
    universal sets
    0 references
    computably enumerable
    0 references
    Kolmogorov complexity
    0 references
    initial segment complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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