| 释义 |
Turing's thesis
图灵论题；［杜林论题］
In 1936, Turing, an English computer scientist, put forward a mathematic model for describing a computing process. Later, this model is called as the Turing machine. Turing's thesis is that all functions that could be taken as “computable” are exactly the ones that could be computed by Turing machine. It is a thesis that could not be proved nor denied.
英国计算机科学家图灵在1936年提出了一种描述计算过程的数字模型。后来，人们就称这个 数字模型为图灵机。图灵论题认为：所有能称为“可计算的”函数恰恰就是用图灵机可计算 的函数。这是一个既不能证明又无法否定的论题。 |