From ec55bd71ab1beda4348105a40324947d8753f4e3 Mon Sep 17 00:00:00 2001 From: Chris Barker Date: Sat, 2 Oct 2010 15:35:18 -0400 Subject: [PATCH] edits --- week4.mdwn | 10 ++++++++++ 1 file changed, 10 insertions(+) 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? + -- 2.11.0