| Church-Turing Thesis: The Church-Turing thesis is the thesis according to which there are no principally calculable functions that cannot be calculated by a Turing machine. The thesis is not proved since the set of principally (or intuitively) calculable functions cannot be definitively determined. It follows from the Church-Turing thesis that a computer can execute any algorithm if its storage capacity is sufficient. See also Turing machine, predictability._____________Annotation: The above characterizations of concepts are neither definitions nor exhausting presentations of problems related to them. Instead, they are intended to give a short introduction to the contributions below. – Lexicon of Arguments. |
