Anonymous user
Ackermann function: Difference between revisions
Add BLC Ackermann function on Church numerals
Not a robot (talk | contribs) (Add Refal) |
imported>Tromp (Add BLC Ackermann function on Church numerals) |
||
Line 1,733:
The program reads two integers (first m, then n) from command line, idles around funge space, then outputs the result of the Ackerman function.
Since the latter is calculated truly recursively, the execution time becomes unwieldy for most m>3.
=={{header|Binary Lambda Calculus}}==
The Ackermann function on Church numerals (arbitrary precision), as shown in https://github.com/tromp/AIT/blob/master/fast_growing_and_conjectures/ackermann.lam is the 63 bit BLC
program
<syntaxhighlight>010000010110000001010111110101100010110000000011100101111011010</syntaxhighlight>
=={{header|BQN}}==
| |||