教会中的困惑-图灵论题
Confusion in the Church-Turing Thesis
摘要:
丘奇-图灵命题混淆了数值计算和符号计算。特别是,任何不能定义相等性的可计算性模型,如支撑高阶程序设计语言的可计算性模型,都不等价于图灵模型。然而,一个现代的组合演算,SF-演算,可以定义其封闭范式的相等性,因此产生一个等价于图灵模型的可计算性模型。这对程序设计语言设计有着深远的影响。
英文摘要:
The Church-Turing Thesis confuses numerical computations with symbolic computations. In particular, any model of computability in which equality is not definable, such as the lambda-models underpinning higher-order programming languages, is not equivalent to the Turing model. However, a modern combinatory calculus, the SF-calculus, can define equality of its closed normal forms, and so yields a model of computability that is equivalent to the Turing model. This has profound implications for programming language design.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。