Anonymous recursion: Difference between revisions
Content added Content deleted
m (→Truly anonymous: typo) |
imported>Maxima enthusiast No edit summary |
||
| Line 18: | Line 18: | ||
;Task: |
;Task: |
||
If possible, demonstrate this by writing the recursive version of the fibonacci function (see [[Fibonacci sequence]]) which checks for a negative argument before doing the actual recursion. |
If possible, demonstrate this by writing the recursive version of the fibonacci function (see [[Fibonacci sequence]]) which checks for a negative argument before doing the actual recursion. |
||
;Related tasks: |
|||
:* [[Y combinator]] |
|||
<br><br> |
<br><br> |
||