Church–Turing thesis
Jump to navigation
Jump to search
Church–Turing thesis(Q309157) is a conjecture in computer science.
Excerpts from Wikipedia
{{QuoteText=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. |signed=Wikipedia}}