---
week3a.mdwn | 4 +++-
1 file changed, 3 insertions(+), 1 deletion(-)
diff --git a/week3a.mdwn b/week3a.mdwn
index fd2c672a..3ed45aef 100644
--- a/week3a.mdwn
+++ b/week3a.mdwn
@@ -211,7 +211,9 @@ Instead of writing out a long formula twice, we could write:
and the initial `(\x. x x)` is just what we earlier called the `ω`

combinator (lower-case omega, not the non-terminating `Ω`

). So the self-application of `H` can be written:
- ω (\h \lst. (isempty lst) zero (add one ((h h) (extract-tail lst))))
+```
ω (\h \lst. (isempty lst) zero (add one ((h h) (extract-tail lst))))
+
```

+
and this will indeed implement the recursive function we couldn't earlier figure out how to define.
--
2.11.0