Currently being updated. Automatic reload in seconds. | ||

Follow @WotDpod | Subscribe: |
Buy WotD Stuff!! |

← Episode 85 |
For current episodes, or for the rest of the Wiki of the Day family of podcasts go here. | Episode 87 → |

Churchâ€“Turing thesisFri, 2017-Jul-28 01:40 UTC Length - 4:38 Welcome to popular Wiki of the Day where we read the summary of a popular Wikipedia page every day. With 357,237 views on Thursday, 27 July 2017 our article of the day is Church–Turing thesis. In computability theory, the Church–Turing thesis (also known as computability thesis, the Turing–Church thesis, the Church–Turing conjecture, Church's thesis, Church's conjecture, and Turing's thesis) is a hypothesis about the nature of computable functions. It states that a function on the natural numbers is computable by a human being following an algorithm, ignoring resource limitations, if and only if it is computable by a Turing machine. The thesis is named after American mathematician Alonzo Church and the British mathematician Alan Turing. Before the precise definition of computable function, mathematicians often used the informal term effectively calculable to describe functions that are computable by paper-and-pencil methods. In the 1930s, several independent attempts were made to formalize the notion of computability: In 1933, Austrian-American mathematician Kurt Gödel, with Jacques Herbrand, created a formal definition of a class called general recursive functions. The class of general recursive functions is the smallest class of functions (possibly with more than one argument) which includes all constant functions, projections, the successor function, and which is closed under function composition, recursion, and minimization. In 1936, Alonzo Church created a method for defining functions called the λ-calculus. Within λ-calculus, he defined an encoding of the natural numbers called the Church numerals. A function on the natural numbers is called λ-computable if the corresponding function on the Church numerals can be represented by a term of the λ-calculus. Also in 1936, before learning of Church's work, Alan Turing created a theoretical model for machines, now called Turing machines, that could carry out calculations from inputs by manipulating symbols on a tape. Given a suitable encoding of the natural numbers as sequences of symbols, a function on the natural numbers is called Turing computable if some Turing machine computes the corresponding function on encoded natural numbers. Church and Turing proved that these three formally defined classes of computable functions coincide: a function is λ-computable if and only if it is Turing computable if and only if it is general recursive. This has led mathematicians and computer scientists to believe that the concept of computability is accurately characterized by these three equivalent processes. Other formal attempts to characterize computability have subsequently strengthened this belief (see below). 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. Since, as an informal notion, the concept of effective calculability does not have a formal definition, the thesis, although it has near-universal acceptance, cannot be formally proven. Since its inception, variations on the original thesis have arisen, including statements about what can physically be realized by a computer in our universe (Physical Church-Turing Thesis) and what can be efficiently computed (Complexity-Theoretic Church–Turing Thesis). These variations are not due to Church or Turing, but arise from later work in complexity theory and digital physics. The thesis also has implications for the philosophy of mind (see below). This recording reflects the Wikipedia text as of 01:40 UTC on Friday, 28 July 2017. For the full current version of the article, search Wikipedia for Church–Turing thesis. This podcast is produced by Abulsme Productions based on Wikipedia content and is released under a Creative Commons Attribution-ShareAlike License. Abulsme Productions also produces Curmudgeon's Corner, a weekly current events podcast where the hosts discuss whatever is hot in the news each week. Check it out in your podcast player of choice. This has been Joey. Thank you for listening to popular Wiki of the Day. If you enjoyed this podcast, you can find our archive, and our sister podcasts random Wiki of the Day and featured Wiki of the Day at wikioftheday.com. Subscribe and tell your friends to listen as well! |

Episodes 1-100 Episodes 101-200 Episodes 201-300 Episodes 301-400 Episodes 401-441

Feedback welcome at feedback@wikioftheday.com.

These podcasts are produced by Abulsme Productions based on Wikipedia content.

They are released under a Creative Commons Attribution-ShareAlike 3.0 Unported License.

Abulsme Productions also produces Curmudgeon's Corner, a current events podcast.

If you like that sort of thing, check it out too!

Page cached at 2018-07-18 07:36:53 UTC

Original calculation time was 0.3938 seconds

Page displayed at 2018-07-19 01:38:18 UTC

Page generated in 0.0047 seconds