Define the syntax and reduction rules (alpha, beta, and eta conversion) of the untyped lambda calculus. Demonstrate how basic arithmetic and logical operations can be encoded using Church numerals and Church booleans. Theoretically compare the computational power of the lambda calculus to that of Turing machines and discuss the significance of the Church-Turing thesis.