Update README.md

README.md

@@ -2,7 +2,7 @@
 A simulation of a Turing machine with a two-way register and a card reader
 
 ## Operation of the turing machine
-First the machine will read card one for instructions. The machine will start at registry position zero, it will read the value there (which will be zero) and then it will move the write head in the indicated direction and write the value from the card to that registry entry. After the instruction on the card has been executed it will move to the indicated next card. If that card is the zeroeth card, the machine will halt.
+First the machine will read card one for instructions. The machine will start at registry position zero, it will read the value there (which will be zero) and write the value from the card to that registry entry, then it will move the write head in the indicated direction. After the instruction on the card has been executed it will move to the indicated next card. If that card is the zeroeth card, the machine will halt.
 
 ## The anatomy of a Card
 This is an example of a one card busy beaver:
@@ -30,3 +30,12 @@ This means that if the registry value is 0 write a 1 to the left and then move t
 
 That is to say that the first three rows correspond to a registry of zero and the last three rows correspond to a registry of one.
 
+A card that will move to the left if it is zero and the right if it is one and tehn exit, but leave everything else in place looks like this:
+```
+0
+1
+0
+1
+0
+0
+```