Forever ago it feels like I wrote my own version of the Ackermann function. If you don't know what that is think of it as contentious recursion. It is the function calling it self over and over again. I have a really good computer but I'm still unable to run this program do to many different type of limitations. Mostly memory. If you want to run it and give it a try let me know how far it goes for you. It is written in C because that's what i felt like at the time.
#include <stdio.h>int ack(m,n)int m,n;{int ans;if (m == 0) ans = n+1;else if (n == 0) ans = ack(m-1,1);else ans = ack(m-1, ack(m,n-1));return (ans);}int main (argc, argv)int argc; char ** argv;{ int i,j;for (i=0; i<6; i++)for (j=0;j<6; j++)printf ("ackerman (%d,%d) is: %d\n",i,j, ack(i,j));}
