- Abstract:
-
This is the first of a series of three articles devoted to the conceptual problem of identifying the natural notions of computability at higher types (over the natural numbers) and establishing the relationships between these notions. In the present paper, we undertake an extended survey of the different strands of research to date on higher type computability, bringing together material from recursion theory, constructive logic and computer science, and emphasizing the historical development of the ideas. The paper thus serves as a reasonably comprehensive survey of the literature on higher type computability.
- Links To Paper
- 1st Link
- Bibtex format
- @InProceedings{EDI-INF-RR-0576,
- author = {
John Longley
},
- title = {Notions of computability at higher types I},
- book title = {Proceedings of Logic Colloquium 2000},
- publisher = {ASL},
- year = 2005,
- volume = {# 19},
- pages = {32-142},
- url = {http://homepages.inf.ed.ac.uk/jrl/Research/notions1.pdf},
- }
|
