Question: is lambda calculus turing complete?
Answer: The untyped lambda calculus is Turing-complete, but many typed lambda calculi, including System F, are not. The value of typed systems is based in their ability to represent most typical computer programs while detecting more errors. Rule 110 and Conway's Game of Life, both cellular automata, are Turing-complete.