Press the flag to start the program. Program will graph outputs of recursive function until all inputs are exhausted. Function is hyper-exponential so adjusting step length to a fraction of output is necessary for graphing larger inputs of x (eg x>4).
The Ackermann function A(x,y) is defined for integer x and y by A(x,y)={y+1 if x=0; A(x-1,1) if y=0; A(x-1,A(x,y-1)) otherwise. Project inspired by Structure and Interpretation of Computer Programs Exercise 1.8
