
 The ChurchTuring Thesis 
  Turing introduced this thesis in the course of arguing that the Entscheidungsproblem, or decision problem, for the predicate calculus  posed by Hilbert (Hilbert and Ackermann 1928)  is unsolvable. 
  Other writers maintain thesis M (or some equivalent or near equivalent) on the spurious ground that the various and prima facie very different attempts  by Turing, Church, Post, Markov, and others  to characterise in precise terms the informal notion of an effective procedure have turned out to be equivalent to one another. 
  Turing introduces his machines with the intention of providing an idealised description of a certain human activity, the tedious one of numerical computation, which until the advent of automatic computing machines was the occupation of many thousands of people in commerce, government, and research establishments. 
 setis.library.usyd.edu.au /stanford/archives/win1998/entries/churchturing (4902 words) 
