X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?a=blobdiff_plain;ds=sidebyside;f=week3.mdwn;h=386a8b70c4d134c9434dc5ae69d336c3a18fe474;hb=600b9e54be61643b0d85021bfbfbd575f47b0d17;hp=42f65d64d412d97e862291e4d5d3311aa527a0aa;hpb=372cdc29f663944404da58a287e6588d1dec066d;p=lambda.git

diff --git a/week3.mdwn b/week3.mdwn
index 42f65d64..386a8b70 100644
--- 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.