Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!uunet!husc6!mit-eddie!ll-xn!ames!ucbcad!ucbvax!tcdcs.UUCP!OMAHONY
From: OMAHONY@tcdcs.UUCP ("Donal O'Mahony - omahony@tcdcs.uucp")
Newsgroups: comp.lang.scheme
Subject: Solution to Exercise 1.9
Message-ID: <8711071755.aa09172@csclnb.tcdcs.uucp>
Date: Sat, 7-Nov-87 12:55:00 EST
Article-I.D.: csclnb.8711071755.aa09172
Posted: Sat Nov  7 12:55:00 1987
Date-Received: Wed, 11-Nov-87 04:44:34 EST
Sender: daemon@ucbvax.BERKELEY.EDU
Organization: The ARPA Internet
Lines: 12

Does anybody out there have a good solution to Exercise 1.9 on pg 39
of Structure & Interpretation of Computer Programs.  It involves
writing a procedure that evolves an iterative process for solving
the count change problem.

I've tried a few times with no success.

Donal O'Mahony       omahony@tcdcs.uucp
Computer Science Dept.,
Trinity College,
Dublin,
Ireland