GEWU
EN

搜索科普文

输入关键词搜索已发表科普文。

    Scientists / Open questions

    艾伦·图灵

    Alan Turing

    计算理论、数理逻辑、密码分析

    3 个问题

    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?

    返回开放问题