## The Church Turing Thesis: Turing Machine = Max Logical Power

### Church turing thesis explained - King's Road Angkor

Church had arrived at the same negative result a few months earlier, employing the concept of lambda-definability in place of computability by Turing machine. Church and Turing discovered the result quite independently of one another. Turing's method of obtaining it is rather more satisfying than Church's, as Church himself acknowledged in a review of Turing's work:

### paper - Extended church turing thesis wikiErosion research paper

replaced Strong Church Turing Thesis" with "Complexity-theoretic Turing Thesis" claiming that "strong" is a weasel word. I've reverted it because does not apply to terminology quoted as such. 04:53, 8 December 2009 (UTC)

Church had arrived at the same negative result a few months earlier,employing the concept of lambda-definability in place of computabilityby Turing machine. Church and Turing discovered the result quiteindependently of one another. Turings method of obtaining it israther more satisfying than Churchs, as Church himself acknowledgedin a review of Turings work:

computability by a Turing machine ... has the advantage of making theidentification with effectiveness in the ordinary (not explicitlydefined) sense evident immediately. (1937a: 43.)(Another aspect in which their approaches differ is that Turingsconcerns were rather more general than Churchs, in that the latterconsidered only functions of positive integers (see below), whereasTuring described his work as encompassing "computable functions of anintegral variable or a real or computable variable, computablepredicates, and so forth" (1936: 230). He intended to pursue thetheory of computable functions of a real variable in a subsequentpaper, but in fact did not do so.)