{"push_id":782037799,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"6919a9b53b30040dea7e2d0f3ffb3a4b7c28092b","before":"24fd7d6bf8e20c6f1757a481e4acecadd28ffd83","commits":[{"sha":"6919a9b53b30040dea7e2d0f3ffb3a4b7c28092b","author":{"email":"1239f6aecec994f14fd99654fa59153cf05f36d9@gmail.com","name":"Peter Becich"},"message":"trampolined Ackermann function is correct -- just unexpectedly slow.\nhttp://stackoverflow.com/a/12678675/1007926\n\"The computation of A(3,4) is not as easy or short as it might appear at\nfirst from the small values of the arguments. The complexity (# of\niteration steps) of the Ackermann function grows very rapidly with its\narguments, as does the computed result.\"\nAckermann(4,2) will take a while...","distinct":true,"url":"https://api.github.com/repos/peterbecich/fpinscala/commits/6919a9b53b30040dea7e2d0f3ffb3a4b7c28092b"}]}