Turing machine computable functionals finite types von kleene stephen (1 Ergebnisse)

Kleene, Stephen C. (1909-94). Turing-machine computable functionals of finite types I. Offprint from Logic, Methodology and Philosophy of Science: Proceedings of the 1960 International Congress, ed. E. Nagel, P. Suppes and A. Tarski (Stanford: Stanford University Press, 1962). 38-45pp. 262 x 179 mm. Without wrappers; stapled. Light creasing. With: Turing-machine computable functionals of finite types II. Offprint from Proceedings of the London Mathematical Society, 3rd series, 12 (1962). 245-258pp. 237 x 153 mm. Original printed wrappers. Together 2 items. Very good. First Editions, Offprint Issues. In the 1950s and 60s "Kleene opened the frontiers of computability on higher type objects" (Soare, p. 22); i.e., those greater than type 0 (numbers) and type 1 (n + 1). In the present papers Kleene developed Turing-machine computable functionals of higher types. R. Soare, "Computability and recursion," Bulletin of Symbolic Logic 2 (1996): 284-321. From the library of Martin Davis. . …