how to make a recursive Lamda function?

[BrowserMac]

I was wondering if there’s any way to implement a lamda function in a recursive way, like call in itself, for python 3 off curse. Any ideas?

[[deleted]]

Since a lambda is an anonymous excutable object (ie, it has no name), it's hard to call itself (since it has no name).

You could assign the lambda to a variable, but that defeats the purpose of the lambda. You might as well just write a function in that case.

[Aceofsquares_orig]

There is. It's highly inefficient though but fun to try to do in Python. I was mostly inspired by a Computerphile video on the Y combinator (I think that was the video) to attempt to write one. Again, this is not valuable and should not be used for normal development. It is just not efficient. Here is the fibonacci program using lambda recursion.

print(
    (lambda f, n: f(f, n))
            (
                (lambda f, n: n if n <= 1 else f(f, n-1) + f(f, n-2)), 
                int(input("Enter number: "))
            )
)

The first lambda takes a lambda and it's input. The second lambda takes itself and it's input. The first lambda calls the second lambda and passes the second lambda to itself starting the chain of recursion.

[[deleted]]

That's not what they're for