From a74e125da6d29f39933f380fd6b0f91e9e4e3791 Mon Sep 17 00:00:00 2001
From: Jim Pryor <profjim@jimpryor.net>
Date: Sun, 19 Sep 2010 14:47:27 -0400
Subject: [PATCH] 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>
---
 week1.mdwn | 2 --
 1 file changed, 2 deletions(-)

diff --git a/week1.mdwn b/week1.mdwn
index 967f8144..f87ee981 100644
--- 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
 =============
-- 
2.11.0