lambda calculus is considered "universal" because it can be used to both create and find the answer to any computable function. this is exactly what a turing machine can do, so lambda calculus and turing machines are said to be equivalent. however, lambda calculus focuses more on the use of transformation rules. it does not care about the actual machine that puts those rules into place. it is an approach more related to software than to hardware.