Recursion in Lambda Calculus

However, it can be simulated using Church’s Y combinator:

Y = (?x . (?y. x (y y)) (?y. x (y y)))

This has the unusual property of being a “fixed-point” combinator:

Y f ?? f (Y f)

Here ?? means reduces via some number of beta reduction steps.