**Links to**: [[Turing machine]], [[Computer]], [[Computation]], [[Computability]], [[Undecidability]], [[Decision]],[[B The being of “mere” machines and “mere” propositions]], [[Iteration]], [[Translation]], [[Transduction]], [[Machine]]. >Turing’s proposal is encapsulated in the Church–Turing thesis, also known simply as Turing’s thesis: The UTM is able to perform any calculation that any human computer can carry out. An equivalent way of stating the thesis is: Any effective – or mechanical – method can be carried out by the UTM. > >B. Jack Copeland, p. 7 in “Computation”. In: Floridi, Luciano, ed. _The Blackwell guide to the philosophy of computing and information_. John Wiley & Sons, 2008. >Turing’s and Church’s theses are equivalent. We shall usually refer to them both as Church’s thesis, or in connection with that one of its . . . versions which deals with “Turing machines” as the Church–Turing thesis. > >Kleene 1967, p. 232 cited in ibid., above.