Translator Disclaimer
March 2006 Computing with functionals—computability theory or computer science?
Dag Normann
Bull. Symbolic Logic 12(1): 43-59 (March 2006). DOI: 10.2178/bsl/1140640943

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.

Citation

Download Citation

Dag Normann. "Computing with functionals—computability theory or computer science?." Bull. Symbolic Logic 12 (1) 43 - 59, March 2006. https://doi.org/10.2178/bsl/1140640943

Information

Published: March 2006
First available in Project Euclid: 22 February 2006

zbMATH: 1104.03039
MathSciNet: MR2209329
Digital Object Identifier: 10.2178/bsl/1140640943

Rights: Copyright © 2006 Association for Symbolic Logic

JOURNAL ARTICLE
17 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.12 • No. 1 • March 2006
Back to Top