✦ LIBER ✦

A new recursion-theoretic characterization of the polytime functions

✍ Scribed by Spephen Bellantoni; Stephen Cook

Publisher: Springer
Year: 1992
Tongue: English
Weight: 883 KB
Volume: 2
Category: Article
ISSN: 1016-3328
DOI: 10.1007/bf01201998

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Function algebraic characterizations of

Function algebraic characterizations of the polytime functions

✍ H. Ishihara 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 226 KB

A learning-theoretic characterization of

A learning-theoretic characterization of classes of recursive functions

✍ Martin Kummer 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 673 KB

A term rewriting characterization of the

A term rewriting characterization of the polytime functions and related complexity classes

✍ Arnold Beckmann; Andreas Weiermann 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 233 KB

Recursion theoretic characterizations of

Recursion theoretic characterizations of complexity classes of counting functions

✍ Heribert Vollmer; Klaus W. Wagner 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 918 KB

A new system of proof-theoretic ordinal

A new system of proof-theoretic ordinal functions

✍ W. Buchholz 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 701 KB

A Classification of the Recursive Functi

A Classification of the Recursive Functions

✍ Albert R. Meyer; Dennis M. Ritchie 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 744 KB

This research was supported in part by NSF Grant GP-2880, ARPA grant SD-146, and 2) We use L L C" to denote proper inclusion, and ''2" for improper inclusion. DSR 79457 under Project MAC. I) The operation of substitution consists of composition of functions and explicit transformation. \*) We use '