Define the syntax and the three primary reduction rules of the untyped lambda calculus: alpha conversion, beta reduction, and eta conversion. Show how to represent basic arithmetic operations and boolean logic using lambda expressions. Explain its role as a universal model of computation equivalent to Turing machines.