On the gap between trivial and nontrivial initial segment prefix-free complexity (Q1946508): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q342723
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: George Barmpalias / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-012-9400-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2040912355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compactness arguments with effectively closed sets for the study of relative randomness / 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: \(\Pi_1^0 \) classes, LR degrees and Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of infinite sequences with trivial initial segment complexity / 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: Information-theoretic characterizations of recursive infinite strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal pair of 𝐾-degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing degrees of reals of positive effective packing dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: RELATIVIZING CHAITIN'S HALTING PROBABILITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using random sets as oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing incomparability in Scott sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(K\)-degrees, low for \(K\) degrees, and weakly low for \(K\) sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3611832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measures and their random reals / rank
 
Normal rank

Latest revision as of 09:24, 6 July 2024

scientific article
Language Label Description Also known as
English
On the gap between trivial and nontrivial initial segment prefix-free complexity
scientific article

    Statements

    On the gap between trivial and nontrivial initial segment prefix-free complexity (English)
    0 references
    0 references
    0 references
    15 April 2013
    0 references
    0 references
    Kolmogorov complexity
    0 references
    initial segment prefix-free complexity
    0 references
    \(K\)-triviality
    0 references
    low for \(\varOmega \)
    0 references
    0 references