Computing with functionals—computability theory or computer science?
Dag Normann
Source: Bull. Symbolic Logic Volume 12, Issue 1
(2006), 43-59.
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.
First Page:
Show
Hide
Full-text: Access denied (no subscription
detected)
We're sorry, but we are unable to provide
you with the full text of this article because we are not able to identify
you as a subscriber.
If you have a personal subscription to
this journal, then please login. If you are already logged in, then you
may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.bsl/1140640943
Digital Object Identifier: doi:10.2178/bsl/1140640943
Mathematical Reviews number (MathSciNet): MR2209329
Zentralblatt MATH identifier: 1104.03039
