week2 tweaks

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

diff --git a/week2.mdwn b/week2.mdwn
index 68080c0..ce21d26 100644 (file)
--- a/week2.mdwn
+++ b/week2.mdwn
@@ -45,7 +45,7 @@ Lambda expressions that have no free variables are known as **combinators**. Her
 
 >   **W** is defined to be: `\f x . f x x`. (So `W f` accepts one argument and gives it to `f` twice. What is the meaning of `W multiply`?)
 
 
 >   **W** is defined to be: `\f x . f x x`. (So `W f` accepts one argument and gives it to `f` twice. What is the meaning of `W multiply`?)
 

->      **ω** is defined to be: `\x. x x`
+>      **ω** (that is, lower-case omega) is defined to be: `\x. x x`

 
 It's possible to build a logical system equally powerful as the lambda calculus (and readily intertranslatable with it) using just combinators, considered as atomic operations. Such a language doesn't have any variables in it: not just no free variables, but no variables at all.
 
 
 It's possible to build a logical system equally powerful as the lambda calculus (and readily intertranslatable with it) using just combinators, considered as atomic operations. Such a language doesn't have any variables in it: not just no free variables, but no variables at all.