 Using the ingredients provided by the \(\lambda\)-calculus, one can represent all recursive functions. This shows that the model is exactly as expressive as other models of computing, such as Turing machines and register machines. Priority goes to Turing’s definition of his machine, but Church’s proposal of the \(\lambda\)-calculus was developed at almost exactly the same time.