Yep. If you ever take a course on theory of programming languages that's based on the lambda calculus, you'll find it's one of the ways to model recursion in a

Yep. If you ever take a course on theory of programming languages that's based on the lambda calculus, you'll find it's one of the ways to model recursion in a programming language that would otherwise be Turing-incomplete. You get recursion at the cost of being subject to the Halting Problem.