week1: functional ocaml turing complete after all

I think the presence of primitive let rec --> full Y combinator --> more
powerful than just second-order polymorphic lambda calculus, which is
strongly normalizing.

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

diff --git a/week1.mdwn b/week1.mdwn
index 967f814..f87ee98 100644 (file)
--- a/week1.mdwn
+++ b/week1.mdwn
@@ -356,8 +356,6 @@ combinatorial logic</td>
 </table>
 
 
-[Correction: OCaml is Turing complete, but I'm not sure if the merely functional part is; I suspect it's not.]
-
 
 Rosetta Stone
 =============