tlooto
Sign up
MathematicsPhilosophy

On Computable Numbers, with an Application to the Entscheidungsproblem.

A. Turing

1937JOURNAL OF SYMBOLIC LOGIC

DOI: 10.2307/2268810

tlooto Summary

A description of the diagonal process of the universal computing machine, which automates the enumeration of computable sequences and numbers in circle and circle-free numbers.

Abstract

Abstract is not available.

Citation format

TURING, A. On computable numbers, with an application to the entscheidungsproblem. JOURNAL OF SYMBOLIC LOGIC, 1937, 2: 42.