Turing-Machine Computable Functionals of Finite Types I

, , &
Journal of Symbolic Logic 35 (4):588-589 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271480

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Review: S. C. Kleene, Ernest Nagel, Patrick Suppes, Alfred Tarski, Turing-Machine Computable Functionals of Finite Types I; S. C. Kleene, Turing-Machine Computable Functionals of Finite Types II. [REVIEW]D. A. Clarke - 1970 - Journal of Symbolic Logic 35 (4):588-589.
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.
Infinite Time Turing Machines With Only One Tape.D. E. Seabold & J. D. Hamkins - 2001 - Mathematical Logic Quarterly 47 (2):271-287.
Review: S. C. Kleene, Countable Functionals; S. C. Kleene, Recursive Functionals of Higher Finite Types. [REVIEW]Donald L. Kreider - 1962 - Journal of Symbolic Logic 27 (3):359-360.
Is there a nonrecursive decidable equational theory?Benjamin Wells - 2002 - Minds and Machines 12 (2):301-324.
Unimonotone functions of finite types (recursive functionals and quantifiers of finite types revisited IV).S. C. Kleene - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion Theory. American Mathematical Society. pp. 42--119.
Turing degrees of certain isomorphic images of computable relations.Valentina S. Harizanov - 1998 - Annals of Pure and Applied Logic 93 (1-3):103-113.
Computable Diagonalizations and Turing’s Cardinality Paradox.Dale Jacquette - 2014 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 45 (2):239-262.
A Turing Machine for Exponential Function.P. M. F. Lemos - manuscript
Turing computable embeddings.F. Knight Julia, Miller Sara & M. Vanden Boom - 2007 - Journal of Symbolic Logic 72 (3):901-918.
The hereditary partial effective functionals and recursion theory in higher types.G. Longo & E. Moggi - 1984 - Journal of Symbolic Logic 49 (4):1319-1332.
Turing L -machines and recursive computability for L -maps.Giangiacomo Gerla - 1989 - Studia Logica 48 (2):179 - 192.
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Computable isomorphisms, degree spectra of relations, and Scott families.Bakhadyr Khoussainov & Richard A. Shore - 1998 - Annals of Pure and Applied Logic 93 (1-3):153-193.
Functional interpretation of Aczel's constructive set theory.Wolfgang Burr - 2000 - Annals of Pure and Applied Logic 104 (1-3):31-73.

Analytics

Added to PP
2015-02-05

Downloads
15 (#893,994)

6 months
1 (#1,459,555)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Subrecursive functions on partial sequences.Karl-Heinz Niggl - 1999 - Archive for Mathematical Logic 38 (3):163-193.

Add more citations

References found in this work

No references found.

Add more references