Hacker News new | ask | show | jobs
by amelius 199 days ago
You need more than if for Turing completeness though.
2 comments

You need conditionals and loops. Recursion counts as looping.
Correct. You need at least 2 ifs.
You need unbounded recursion no?
That's actually what two ifs could be.
Was the case against the goto statement so good we can't mention it?
More or less, I meant how this would be inlined in assembly with a goto that could goto back where the branching originated from.