Well, normally one makes the thesis concrete by saying that lambda calculus and Turing machines yield an equivalent notion of computability.