tweak week{2,3}

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

diff --git a/week2.mdwn b/week2.mdwn
index 80f3946..992c8c8 100644 (file)
--- a/week2.mdwn
+++ b/week2.mdwn
@@ -48,7 +48,7 @@ Here's more to read about combinatorial logic:
 <http://people.cs.uu.nl/jeroen/article/combinat/combinat.ps>
 
 
 <http://people.cs.uu.nl/jeroen/article/combinat/combinat.ps>
 
 

-Evaluation strategies and Normalization
+Evaluation Strategies and Normalization

 =======================================
 
 In the assignment we asked you to reduce various expressions until it wasn't possible to reduce them any further. For two of those expressions, this was impossible to do. One of them was this:
 =======================================
 
 In the assignment we asked you to reduce various expressions until it wasn't possible to reduce them any further. For two of those expressions, this was impossible to do. One of them was this:

diff --git a/week3.mdwn b/week3.mdwn
index 42f65d6..386a8b7 100644 (file)
--- a/week3.mdwn
+++ b/week3.mdwn
@@ -1,3 +1,7 @@
+Even with a fold-based representation of numbers, and pred/equal/subtraction, some recursive functions are going to be out of our reach.
+
+Need a general method, where f(n) doesn't just depend on f(n-1) or (f(n-1),f(n-2),..). Fibonacci can be done without Y. 
+Ackermann function would need Y, but surely we can find some simpler demonstration?

 
 How to do with recursion with omega.
 
 
 How to do with recursion with omega.