X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week1.mdwn;h=b1df1ad5523599929a4241489ab9260cb49fa256;hp=967f8144e1b586272051a4667b8bc0b9f2b22df4;hb=6a60dbeb81ccc4949724a6db13a264a0b322a22d;hpb=e053dbeb5dc625de22ed8ce69840c02b0f5b9b23

diff --git a/week1.mdwn b/week1.mdwn
index 967f8144..b1df1ad5 100644
--- a/week1.mdwn
+++ b/week1.mdwn
@@ -130,7 +130,7 @@ because here the second occurrence of `y` is no longer free.
 
 There is plenty of discussion of this, and the fine points of how substitution works, in Hankin and in various of the tutorials we've linked to about the lambda calculus. We expect you have a good intuitive understanding of what to do already, though, even if you're not able to articulate it rigorously.
 
-*	MORE
+*	[More discussion in week 2 notes](/week2/#index1h1)
 
 
 Shorthand
@@ -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
 =============