Definition of Church–Turing in English:


Pronunciation /ˌtʃəːtʃˈtjʊərɪŋ/ /ˌtʃəːtʃˈtʃʊərɪŋ/


Computing Mathematics
  • Attributive Designating the proposition that any function that can be computed using an algorithm can be computed by a Turing machine. Especially in "Church–Turing thesis".


1960s; earliest use found in Stephen Kleene (b. 1909). From the names of Alonzo Church, U.S. mathematician and logician, and Alan Mathison Turing, English mathematician and computer scientist, who are jointly credited with formulating the thesis.