Well spotted! It is computing the Ackermann Function as a subroutine. But in terms of when it makes outputs, it has to map n -> A(n-2, n-1) many times first. So the growth rate of the function "cycles per output" is way faster than just iterated Ackermann.
This a one armed implementation of the Ackermann Function?
Well spotted! It is computing the Ackermann Function as a subroutine. But in terms of when it makes outputs, it has to map n -> A(n-2, n-1) many times first. So the growth rate of the function "cycles per output" is way faster than just iterated Ackermann.
where Explanation
Just arrived! th-cam.com/video/RAUsCwu8ekQ/w-d-xo.html
Video editing is hard.
@@biggiemac42 thank you! No problem
@@biggiemac42 thank you! No problem