A formal system for expressing computation in terms of function abstraction and application using variable binding and substitution
Invented in the 1930s by Alonzo Church. He was pals with Turing. Unsurprisingly, any problem which can be solved with a Turing machine can be solved with lambda calculus. Check out the aptly named Church-Turing thesis!
f(1) = A