Church–Turingn.

Brit.

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

/ˌtʃəːtʃˈtʃʊərɪŋ/, U.S.

/ˌtʃərtʃˈt(j)ʊrɪŋ/

Origin: From proper names. Etymons: proper name Church, Turing.

Etymology: < the names of Alonzo Church (1903–95), U.S. mathematician and logician (see Church n.²), and Alan Mathison Turing (1912–54), English mathematician and computer scientist (see Turing machine n.), who are jointly credited with formulating the thesis.

Computing and Mathematics.

attributive. Designating the proposition that any function that can be computed using an algorithm can be computed by a Turing machine. Esp. in Church–Turing thesis.

ΚΠ

1961 S. C. Kleene in Fundamenta Mathematicae 50 282 Three (equivalent) notions, λ-definability, Herbrand-Gödel general recursiveness, and Turing-Post computability,..gave rise to the Church-Turing thesis.

1985 Proc. Royal Soc. A. 400 99 These limitations on what can be computed..are universal. This is called the ‘Church-Turing hypothesis’.

2005 N. Gershenfeld FAB 38 This insight, now called the Church-Turing thesis, is the key to machine literacy.

This is a new entry (OED Third Edition, September 2011; most recently modified version published online March 2022).

单词	church–turing
释义	Church–Turingn. Brit. /ˌtʃəːtʃˈtjʊərɪŋ/, /ˌtʃəːtʃˈtʃʊərɪŋ/, U.S. /ˌtʃərtʃˈt(j)ʊrɪŋ/ Origin: From proper names. Etymons: proper name Church, Turing. Etymology: < the names of Alonzo Church (1903–95), U.S. mathematician and logician (see Church n.²), and Alan Mathison Turing (1912–54), English mathematician and computer scientist (see Turing machine n.), who are jointly credited with formulating the thesis. Computing and Mathematics. attributive. Designating the proposition that any function that can be computed using an algorithm can be computed by a Turing machine. Esp. in Church–Turing thesis. ΚΠ 1961 S. C. Kleene in Fundamenta Mathematicae 50 282 Three (equivalent) notions, λ-definability, Herbrand-Gödel general recursiveness, and Turing-Post computability,..gave rise to the Church-Turing thesis. 1985 Proc. Royal Soc. A. 400 99 These limitations on what can be computed..are universal. This is called the ‘Church-Turing hypothesis’. 2005 N. Gershenfeld FAB 38 This insight, now called the Church-Turing thesis, is the key to machine literacy. This is a new entry (OED Third Edition, September 2011; most recently modified version published online March 2022). < n.1961
随便看	zygantra zygantrum zygantrums zygapophyses zygapophysial zygapophysis zygite zygnemaceous zygnemid zygnomic zygo zygo- zygobranchiate zygobranchiates zygocactus zygocardiac zygodactyl zygodactyler zygodactylest zygodactylic zygodactylous zygodactyls zygodont zygogeneses zygogenesis