Algorithmic complexity as a criterion of unsolvability (Q2383595): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.04.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997448562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive inference and unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4436369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The position of index sets of identifiable sets in the arithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized kolmogorov complexity and other dual complexity measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic approach to dynamic information theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic complexity of recursive and inductive algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Length of Programs for Computing Finite Binary Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic entropy of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Program size, oracles, and the jump operation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2709403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4259438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT / rank
 
Normal rank

Latest revision as of 15:51, 26 June 2024

scientific article
Language Label Description Also known as
English
Algorithmic complexity as a criterion of unsolvability
scientific article

    Statements

    Algorithmic complexity as a criterion of unsolvability (English)
    0 references
    19 September 2007
    0 references
    0 references
    Kolmogorov complexity
    0 references
    recursive algorithmic complexity
    0 references
    inductive Turing machine
    0 references
    algorithmic problem
    0 references
    inductive algorithmic complexity
    0 references
    decidability
    0 references
    super-recursive algorithm
    0 references
    0 references
    0 references