spelling Ackermann

Signed-off-by: Jim Pryor <profjim@jimpryor.net>

diff --git a/week4.mdwn b/week4.mdwn
index 362ad66..e2805fb 100644 (file)
--- a/week4.mdwn
+++ b/week4.mdwn
@@ -139,7 +139,7 @@ start with the `iszero` predicate, and only produce a fresh copy of
 `prefact` 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 Ackermann 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 Ackermann function using full recursion.#
 
 
 A. OK:
@@ -171,7 +171,7 @@ so `A 4 x` is to `A 3 x` as hyper-exponentiation is to exponentiation...
 *    What is it about the variant fixed-point combinators that makes
      them compatible with a call-by-value evaluation strategy?
 
-*    How do you know that the Ackerman function can't be computed
+*    How do you know that the Ackermann function can't be computed
      using primitive recursion techniques?
 
 *    What *exactly* is primitive recursion?