Andrew Hodges∗ Did Church and Turing Have a Thesis about Machines? This article draws attention to a central dispute in the inter-pretation of Church’s Thesis. In computability theory the Church–Turing thesis (also known as Church's thesis, Church's conjecture and Turing's thesis) is a combined hypothesis about the nature. Elle est également connue, sous le nom plus récent de thèse de Church-Turing. (Turing 1936, 263 et suivantes). Dans un article paru en 1937. The Church-Turing thesis (formerly commonly known simply as Church's thesis) says that any real-world computation can be translated into an equivalent computation. Kleene's Church–Turing Thesis: A few years later. Heuristic evidence and other considerations led Church 1936 to propose the following thesis. Thesis I. Church's thesis, and the Church-Turing thesis). Much evidence has been amassed for the 'working hypothesis' proposed by Church and Turing in 1936. There are various equivalent formulations of the Church-Turing thesis. A common one is that every effective computation can be carried out by a Turing machine. 1 Turing’s Thesis Solomon Feferman In the sole extended break from his life and varied career in England, Alan Turing spent the years 1936-1938 doing graduate work. Turing’s Thesis Solomon Feferman 1200 NOTICES OF THE AMS VOLUME 53, NUMBER 10 I n the sole extended break from his life and var-ied career in England, Alan Turing. The history of the Church–Turing thesis ( thesis ). heuristic evidence and other considerations led Church 1936 to propose the following thesis. Thesis I.