From 0525f043d62dba0824b44236d4090ece64630828 Mon Sep 17 00:00:00 2001
From: Marvin Borner
Date: Tue, 3 Oct 2023 23:15:56 +0200
Subject: Minor improvements

---
 readme.md | 20 ++++++++++++--------
 1 file changed, 12 insertions(+), 8 deletions(-)

(limited to 'readme.md')

diff --git a/readme.md b/readme.md
index 0f7a61b..9828dad 100644
--- a/readme.md
+++ b/readme.md
@@ -1,7 +1,7 @@
 # Jotter
 
-Jotter (pronounced /dʒɑt.ər/) is a Turing tarpit and “an even better
-Gödel-numbering” than its “sister language”
+Jotter (pronounced /dʒɑt.ər/) is a Turing tarpit and an even better
+Gödel-numbering than its sister language
 [Jot](https://esolangs.org/wiki/Jot).
 
 ## Semantics of Jotter
@@ -13,18 +13,22 @@ Gödel-numbering” than its “sister language”
     [F1]ᵣ -> ([F]ₗK)
 
 `[F]` converts the Jotter program `F` to combinatory logic. The
-associativity toggles between left and right (denoted by `ₗ/ᵣ`),
-starting with the `ₗ` state.
+associativity toggles between left and right (denoted by `ₗ/ᵣ`).
+
+The starting state depends on the length of the program: `ₗ` if
+`len % 2 == 0` (even) and `ᵣ` if `len % 2 == 1` (odd). Don’t worry, this
+only forces the core (the empty string, `I`) to always be on the left
+side of the application.
 
 ## Jot vs. Jotter
 
 Jotter has exactly the same (regular) syntax as Jot, including support
-of the null program.
+for the null program.
 
 Every Jot program can easily be translated to Jotter:
 
-    []   ->             -> I
-    [F0] -> ???
+    []   ->       -> I
+    [F0] -> [F]01 -> ([F]S)
     [F1] -> ???
 
-Therefore Jotter is *Turing complete*.
+Therefore Jotter is *Turing-complete*.
-- 
cgit v1.2.3