Browse the Turing Digital Archive

Contents of AMT/B/11 (up to B)

Off-print, ‘Computability and λ-Definability’ from The Journal of Symbolic Logic, (Vol. 2, Dec. 1937).

Paper, 1 item in envelope. Printed.

Keywords: ‘Computability and lambda-definability’; Computable numbers

Provenance: This material was not included in either of the two earlier sections of the catalogue of Turing Papers prepared by the Contemporary Scientific Archives Centre in 1977 and 1985.

Copyright: Copyright © Association for Symbolic Logic 1937


01

01a

01b

01c

01d

01e

01f

01g

01h

01i

01j

01k

Copyright © University of Southampton and King's College Cambridge 2002,2003 — Terms of Use