CSG369, Special Topics in PL: Formal Methods
Fall 2008

Homework 1

Here's the definition of ack.
(defun ack (x y)
 (cond ((zp x) (1+ y))
       ((zp y) (ack (1- x) 1))
       (t (ack (1- x) (ack x (1- y))))))
Questions:

1. What's the largest value of n for which you can compute (ack n n)? You can use any method whatsoever, any programming language, ..., to do this.

2. What's the largest value of n for which you can compute (ack 4 n)? (ack 3 n)?

Last modified: Tue Sep 23 15:37:09 EDT 2008