Loop program until (0, 0) is 0 so that Flip can actually be Turing-completeHEADmaster

1 files changed, 1 insertions, 1 deletions

diff --git a/README.md b/README.md
index 9aed280..b6696ec 100644
--- a/README.md
+++ b/README.md
@@ -34,7 +34,7 @@ We think you'll agree that the first version is way more aesthetically pleasing
 
 If you haven't figured it out yet, the Flip program above is [NAND](https://en.wikipedia.org/wiki/NAND_logic#Making_other_gates_by_using_NAND_gates)! Currently, the final line outputs 0, but remove either of the first two lines, and the final output becomes 1. This makes Flip (drumroll please)... Turing complete!
 
-There's only one catch. Since finite Flip programs are guaranteed to terminate, Turing completeness requires Flip programs to possibly be infinitely long. Good luck!
+Actually, not quite. Since finite Flip programs are guaranteed to terminate, Turing completeness requires Flip programs to be able to loop forever. One way to do this is to repeat the program until the cell `(0, 0)` is 1 at the end of a repetition of the program.
 
 Even better, a Flip interpreter can be trivially implemented in your favorite programming language. See [Flipper](flipper.py) for the official reference implementation written in Python.