Time-bounded Kolmogorov complexity and Solovay functions (Q1946499): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q324249
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Rupert Hölzl / 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-9413-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048167699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 𝐾-trivial degrees and the jump-traceability hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kolmogorov Complexity and Solovay Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong jump-traceability. I: The computably enumerable case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong jump-traceability. II: \(K\)-triviality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Bounded Kolmogorov Complexity and Solovay Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational depth and reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness and Recursive Enumerability / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to Kolmogorov complexity and its applications / 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: Process complexity and effective random tests / rank
 
Normal rank

Latest revision as of 08:23, 6 July 2024

scientific article
Language Label Description Also known as
English
Time-bounded Kolmogorov complexity and Solovay functions
scientific article

    Statements

    Time-bounded Kolmogorov complexity and Solovay functions (English)
    0 references
    0 references
    0 references
    0 references
    15 April 2013
    0 references
    Kolmogorov complexity
    0 references
    Solovay function
    0 references
    computational depth
    0 references
    Kummer's gap theorem
    0 references
    traceability
    0 references
    high degree
    0 references

    Identifiers