Turing-Machine Computable Functionals of Finite Types II†

DOI10.1112/PLMS/S3-12.1.245zbMath0192.05306OpenAlexW1999479735MaRDI QIDQ5586297

Stephen C. Kleene

Publication date: 1962

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/plms/s3-12.1.245

zbMATH Keywords

recursion theory, constructive mathematics

Related Items (5)

Discrete Transfinite Computation ⋮ On computability with functionals ⋮ Speed-up theorems in type-2 computations using oracle Turing machines ⋮ Turing oracle machines, online computing, and three displacements in computability theory ⋮ Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines

This page was built for publication: Turing-Machine Computable Functionals of Finite Types II^†