Difference between revisions of "Church–Turing thesis"
Jump to navigation
Jump to search
(Created page with "{{WikiEntry|key=Church–Turing thesis|qCode=309157}} is a conjecture in computer science.") |
|||
| (3 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{WikiEntry|key=Church–Turing thesis|qCode=309157}} is a conjecture in computer science. | {{WikiEntry|key=Church–Turing thesis|qCode=309157}} is a conjecture in computer science. | ||
=Excerpts from Wikipedia= | |||
{{Blockquote | |||
|text=On the other hand, the Church–Turing thesis states that the above three formally-defined classes of computable functions coincide with the informal notion of an effectively calculable function. Although the thesis has near-universal acceptance, it cannot be formally proven, as the concept of effective calculability is only informally defined. | |||
|sign=[[Wikipedia:Church–Turing thesis|Church–Turing thesis on Wikipedia]] | |||
}} | |||
Latest revision as of 00:21, 10 August 2022
Church–Turing thesis(Q309157) is a conjecture in computer science.
Excerpts from Wikipedia
On the other hand, the Church–Turing thesis states that the above three formally-defined classes of computable functions coincide with the informal notion of an effectively calculable function. Although the thesis has near-universal acceptance, it cannot be formally proven, as the concept of effective calculability is only informally defined.