Advantages of Lambda calculus over Turing machine and vice versa
The lambda calculus and Turing machines are equivalent models of computation, each of which formally captures the informal notion of effective calculation (this is the Church-Turing thesis). The lambda calculus is a more abstract and algebraic approach, whereas Turing machines offer a more concrete, algorithmic approach.