GEWU
中

Search articles

Type keywords to search published articles.

    Scientists / Open questions

    Alan Turing

    Computability; mathematical logic; cryptanalysis

    3 questions

    1. Status of the type-α\alpha axiom of infinity YαY^\alpha at oo-only types in Church's simple theory of types

    2. Completing Turing's parabolic-contour extension of his 1943 method for calculating the zeta-function

    3. Turing's 1936 question on the extent of the computable numbers: can the identification of 'naturally regarded as computable' with Turing-machine-computable be grounded or refuted beyond appeals to intuition?

    Back to open problems