Add note about infinite Flip programs for Turing completeness

Changes

1 changed files (+2/-0)

• README.md
  • @@ -34,6 +34,8 @@ We think you'll agree that the first version is way more aesthetically pleasing and forgiving for your pinky finger.
    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! + 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. So if you're ever feeling down about how horrible today's modern programming languages are, try writing some Flip to flip your day around!