3 ms·
So your language is not turing complete?
by pablovidal85 11y ago
So your language is not turing complete?
- wircho 11y agoI would say it's not, since it lacks conditional branching, although one could argue that you can simulate a Turing complete system on a Relevant card by having a user indefinitely tap on a button that refreshes it at the next state.
- pablovidal85 11y agoUnderstood, I stand corrected. Anyway, I would have used some kind of non-turing complete stack language.