From: Chris Barker <barker@kappa.linguistics.fas.nyu.edu>
Date: Sat, 2 Oct 2010 19:35:18 +0000 (-0400)
Subject: edits
X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=ec55bd71ab1beda4348105a40324947d8753f4e3

edits
---

diff --git a/week4.mdwn b/week4.mdwn
index c002a471..e6bab7a1 100644
--- a/week4.mdwn
+++ b/week4.mdwn
@@ -161,3 +161,13 @@ A 2 x is to A 1 x as multiplication is to addition;
 A 3 x is to A 2 x as exponentiation is to multiplication---
 so A 4 x is to A 3 x as hyper-exponentiation is to exponentiation...
 
+#Q. What other questions should I be asking?#
+
+*    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
+     using primitive recursion techniques?
+
+*    What *exactly* is primitive recursion?
+