Difference between revisions of "Church–Turing thesis"
Jump to navigation
Jump to search
| Line 2: | Line 2: | ||
=Excerpts from Wikipedia= | =Excerpts from Wikipedia= | ||
{{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. | {{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 | |sign=Wikipedia | ||
}} | }} | ||
Revision as of 00:20, 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.
— Wikipedia