Computing with functionals: Computability theory or computer science?

Bulletin of Symbolic Logic 12 (1):43-59 (2006)
  Copy   BIBTEX

Abstract

We review some of the history of the computability theory of functionals of higher types, and we will demonstrate how contributions from logic and theoretical computer science have shaped this still active subject

Links

PhilArchive



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

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
301 (#64,083)

6 months
12 (#178,599)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Dag Normann
University of Oslo

Citations of this work

Add more citations

References found in this work

Countable functionals.S. C. Kleene - 1959 - Journal of Symbolic Logic 27 (3):81--100.
Countable Functionals.S. C. Kleene - 1962 - Journal of Symbolic Logic 27 (3):359-360.
[Omnibus Review].Richard A. Platek - 1969 - Journal of Symbolic Logic 34 (1):115-116.

View all 7 references / Add more references