Anzeige
Erschienen in:
1999 | OriginalPaper | Buchkapitel
Complexity of Primitive Recursion
verfasst von : W. G. Handley, S. S. Wainer
Erschienen in: Computational Logic
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Primitive recursion is the fundamental example of “recursive definition”. It is intimately related with “for-loops” in programming, and with the E1induction rule in proof theory. Though the primitive recursive functions contain many fast-growing “non-feasible” functions, recent work of Bellantoni-Cook and others shows how a natural two-sorted restriction of primitive recursion serves to characterize complexity classes such as polynomial time and linear space. The lectures presented here provide a technical introduction to this area.