 The replacement predicates that Turing and Church proposed were, on the face of it, very different from one another. However, these predicates turned out to be equivalent, in the sense that each picks out the same set, call it S, of mathematical functions. The Church-Turing thesis is the assertion that this set S contains every function whose values can be obtained by a method satisfying the above conditions for effectiveness.