s and k can be composed to produce combinators that are extensionally equal to "any" lambda term, and therefore, by church's thesis, to any computable function whatsoever. the proof is to present a transformation, "t"[ ], which converts an arbitrary lambda term into an equivalent combinator.