- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Computing with functionals: Computability theory or computer science?
Bulletin of Symbolic Logic 12 (1):43-59 (2006)
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 subjectAuthor's Profile
Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Combinatorics, Computability and Logic: Proceedings of the Third International Conference on Combinatorics, Computability and Logic, (DMTCS’01).C. S. Calude - 2001 - Springer.
Dag Normann. Degrees of functionals. Annals of mathematical logic, vol. 16 , pp. 269–304.E. R. Griffor - 1983 - Journal of Symbolic Logic 48 (1):212-213.
Normann Dag. Recursion on the countable functionals. Lecture notes in mathematics, vol. 811. Springer-Verlag, Berlin, Heidelberg, and New York, 1980, VIII + 191 pp.Normann Dag. The continuous functionals; computations, recursions and degrees. Annals of mathematical logic, vol. 21 , pp. 1–26. [REVIEW]Peter G. Hinman - 1984 - Journal of Symbolic Logic 49 (2):668-670.
Domains and Processes: Proceedings of the 1st International Symposium on Domain Theory Shanghai, China, October 1999.Klaus Keimel, Guo-Qiang Zhang & Ying-Ming Liu (eds.) - 2001 - Dordrecht, Netherland: Springer.
Turing oracle machines, online computing, and three displacements in computability theory.Robert I. Soare - 2009 - Annals of Pure and Applied Logic 160 (3):368-399.
Computability, Complexity, and Languages. Fundamentals of Theoretical Computer Science.Martin D. Davis & Elaine J. Weyuker - 1987 - Journal of Symbolic Logic 52 (1):293-294.
Computability over the Partial Continuous Functionals.Dag Normann - 2000 - Journal of Symbolic Logic 65 (3):1133-1142.
Analytics
Added to PP
2009-01-28
Downloads
320 (#87,537)
6 months
17 (#176,747)
2009-01-28
Downloads
320 (#87,537)
6 months
17 (#176,747)
Historical graph of downloads
Author's Profile
Citations of this work
A constructive manifestation of the Kleene–Kreisel continuous functionals.Martín Escardó & Chuangjie Xu - 2016 - Annals of Pure and Applied Logic 167 (9):770-793.
References found in this work
Interpretation of analysis by means of constructive functionals of finite types.Georg Kreisel - 1959 - In A. Heyting (ed.), Constructivity in mathematics. Amsterdam,: North-Holland Pub. Co.. pp. 101--128.
The continuous functionals; computations, recursions and degrees.Dag Normann - 1981 - Annals of Mathematical Logic 21 (1):1.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-lxkd2 dc2