Abstract recursion and intrinsic complexity

New York, NY: Cambridge University Press (2019)
  Copy   BIBTEX

Abstract

Presents a new framework for the complexity of algorithms, for all readers interested in the theory of computation.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,423

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Recursion theory for metamathematics.Raymond Merrill Smullyan - 1993 - New York: Oxford University Press.
Recursion theorems and effective domains.Akira Kanda - 1988 - Annals of Pure and Applied Logic 38 (3):289-300.
On generalized computational complexity.Barry E. Jacobs - 1977 - Journal of Symbolic Logic 42 (1):47-58.
Self-Referential Recursion.Ilexa Yardley - 2018 - Https://Medium.Com/the-Circular-Theory.
Algebraic recursion theory.Ljubomir Lalov Ivanov - 1986 - New York: Halsted Press.
Recursion theory.Anil Nerode & Richard A. Shore (eds.) - 1985 - Providence, R.I.: American Mathematical Society.
Canonical Forms and Hierarchies in Generalized Recursion Theory.Phokion G. Kolaitis - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion Theory. American Mathematical Society. pp. 42--139.
Techniques of admissible recursion theory.C.-T. Chong - 1984 - New York: Springer Verlag.
Generalized recursion theory.Jens Erik Fenstad & Peter G. Hinman (eds.) - 1974 - New York,: American Elsevier Pub. Co..

Analytics

Added to PP
2022-12-05

Downloads
5 (#1,514,558)

6 months
5 (#638,139)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references