Coda is now officially Turing-complete
Here’s an implementation of a
while loop that runs as long as the value in the table is not equal to 0. It can be easily modified for any boolean condition by changing the formula in
The hack used here: a button cannot push itself, but it can push another button, which will then push the first button.