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 subject|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) (1996). Computability, Enumerability, Unsolvability: Directions in Recursion Theory. Cambridge University Press.
Shawn Hedman (2004). A First Course in Logic: An Introduction to Model Theory, Proof Theory, Computability, and Complexity. Oxford University Press.
Matti Tedre (2011). Computing as a Science: A Survey of Competing Viewpoints. [REVIEW] Minds and Machines 21 (3):361-387.
Dag Normann (1980). Recursion on the Countable Functionals. Springer-Verlag.
Gheorghe Paun & Mario J. Pérez-Jiménez (2003). Recent Computability Models Inspired From Biology: DNA and Membrane Computing. Theoria 18 (1):71-84.
Nigel Cutland (1980). Computability, an Introduction to Recursive Function Theory. Cambridge University Press.
Amit Hagar (2007). Quantum Algorithms: Philosophical Lessons. [REVIEW] Minds and Machines 17 (2):233-247.
Dag Normann (2000). Computability Over the Partial Continuous Functionals. Journal of Symbolic Logic 65 (3):1133-1142.
Added to index2009-01-28
Total downloads2 ( #245,904 of 722,813 )
Recent downloads (6 months)0
How can I increase my downloads?