Algorithmic complexity of recursive and inductive algorithms (Q1434367): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3692867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4749828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3699678 / 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: Q4278590 / 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: A Theory of Program Size Formally Identical to Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal-program complexity of sequences with restricted resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4862313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What is complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language identification in the limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4162439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Overview of the Theory of Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3238703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4070738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of the Kolmogorov concept of complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4160889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complexity Measure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process complexity and effective random tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3754606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formal theory of inductive inference. Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cost of Developing Large-Scale Software / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002171 / 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

Revision as of 17:32, 6 June 2024

scientific article
Language Label Description Also known as
English
Algorithmic complexity of recursive and inductive algorithms
scientific article

    Statements

    Algorithmic complexity of recursive and inductive algorithms (English)
    0 references
    4 August 2004
    0 references
    Efficiency
    0 references
    Complexity
    0 references
    Dual complexity measure
    0 references
    Kolmogorov complexity
    0 references
    Recursive algorithm
    0 references
    Turing machine
    0 references
    Super-recursive algorithm
    0 references
    Inductive Turing machine
    0 references
    0 references

    Identifiers