Comment by amelius 11 hours ago You need more than if for Turing completeness though. 5 comments amelius Reply thwarted 5 hours ago You need conditionals and loops. Recursion counts as looping. alexdns 11 hours ago Correct. You need at least 2 ifs. spooky_deep 10 hours ago You need unbounded recursion no? dotancohen 9 hours ago That's actually what two ifs could be. 1 reply →
alexdns 11 hours ago Correct. You need at least 2 ifs. spooky_deep 10 hours ago You need unbounded recursion no? dotancohen 9 hours ago That's actually what two ifs could be. 1 reply →
spooky_deep 10 hours ago You need unbounded recursion no? dotancohen 9 hours ago That's actually what two ifs could be. 1 reply →
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.
1 reply →