The Church-Turing thesis (also known as Church's thesis, Church's conjecture and Turing's thesis) is a statement about computers. It says that a very simple kind of computer now named a “Turing machine” is able to compute all computable functions. The Church-Turing thesis is linked to Gödel's incompleteness theorems.
ð ə WORD_BOUNDARY t̠ʃ ɜː t̠ʃ t j ʊ ɹ ɹ ɪ ŋ WORD_BOUNDARY θ iː s ɪ s WORD_BOUNDARY ɔ l s oʊ WORD_BOUNDARY n oʊ n WORD_BOUNDARY æ z WORD_BOUNDARY t̠ʃ ɜː t̠ʃ ɪ z WORD_BOUNDARY θ iː s ɪ s WORD_BOUNDARY t̠ʃ ɜː t̠ʃ ɪ z WORD_BOUNDARY k ə n d̠ʒ ɛ k t̠ʃ ə ɹ WORD_BOUNDARY æ n d WORD_BOUNDARY t j ʊ ɹ ɹ ɪ ŋ z WORD_BOUNDARY θ iː s ɪ s WORD_BOUNDARY ɪ z WORD_BOUNDARY ʌ WORD_BOUNDARY s t eɪ t m ə n t WORD_BOUNDARY ʌ b aʊ t WORD_BOUNDARY k ə m p j uː t ə ɹ z WORD_BOUNDARY ɪ t WORD_BOUNDARY s ɛ z WORD_BOUNDARY ð æ t ə WORD_BOUNDARY v ɛ ɹ i WORD_BOUNDARY s ɪ m p ə l WORD_BOUNDARY k aɪ n d WORD_BOUNDARY ʌ v WORD_BOUNDARY k ə m p j uː t ə ɹ WORD_BOUNDARY n aʊ WORD_BOUNDARY n eɪ m d WORD_BOUNDARY ʌ WORD_BOUNDARY t j ʊ ɹ ɹ ɪ ŋ WORD_BOUNDARY m ə ʃ iː n WORD_BOUNDARY ɪ z WORD_BOUNDARY eɪ b ə l WORD_BOUNDARY t ə WORD_BOUNDARY k ə m p j uː t WORD_BOUNDARY ɔ l WORD_BOUNDARY k ə m p j uː t ə b ə l WORD_BOUNDARY f ʌ ŋ k ʃ ə n z WORD_BOUNDARY ð ə WORD_BOUNDARY t̠ʃ ɜː t̠ʃ t j ʊ ɹ ɹ ɪ ŋ WORD_BOUNDARY θ iː s ɪ s WORD_BOUNDARY ɪ z WORD_BOUNDARY l ɪ ŋ k t WORD_BOUNDARY t ə WORD_BOUNDARY ɡ ɜː d ə l z WORD_BOUNDARY ɪ ŋ k ə m p l iː t n ə s WORD_BOUNDARY θ iə ɹ ə m z WORD_BOUNDARY