> specifying a maximum recursion depth or something similar
Doesn't TS do exactly this? It doesn't seem like setting a cap on recursion depth would disqualify something from being Turing complete. Or am I misunderstanding your comment?
Doesn't TS do exactly this? It doesn't seem like setting a cap on recursion depth would disqualify something from being Turing complete. Or am I misunderstanding your comment?
(Similar to how every Turing complete programming language today runs on something technically weaker than a Turing machine due to finite memory.)
[0] https://herringtondarkholme.github.io/2023/04/30/typescript-...
Iteration (loops) are typically represented as jump or branch instructions while recursion requires the creation of a new stack frame on the call stack.