From: Chris Barker Date: Sat, 2 Oct 2010 19:32:31 +0000 (-0400) Subject: edits X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=99d1d57f9a1cf2447938744849531a5c68aee7b1 edits --- diff --git a/week4.mdwn b/week4.mdwn index 4c8288e8..c002a471 100644 --- a/week4.mdwn +++ b/week4.mdwn @@ -133,11 +133,7 @@ leftmost/call-by-name/normal-order evaluation strategy, we'll always start with the `isZero` predicate, and only produce a fresh copy of `prefac` if we are forced to. -#Q. You claimed that the Ackerman function couldn't be implemented -using our primitive recursion techniques (such as the techniques that -allow us to define addition and multiplication). But you haven't -shown that it is possible to define the Ackerman function using full -recursion.# +#Q. You claimed that the Ackerman function couldn't be implemented using our primitive recursion techniques (such as the techniques that allow us to define addition and multiplication). But you haven't shown that it is possible to define the Ackerman function using full recursion.# A. OK: