Hacker News Reader

When recursion is the only method of iteration, of course it would.

Is the recursion limit an implementation detail of the compiler though, or something statically built into the language? If the former there's nothing to prevent the language itself from being Turing complete.

(Similar to how every Turing complete programming language today runs on something technically weaker than a Turing machine due to finite memory.)

There’s no spec so the compiler is the language.

What is the other method of iteration? Also, TypeScript does have a recursion limit[0].

[0] https://herringtondarkholme.github.io/2023/04/30/typescript-...

Do you mean within a state machine or in practice?

Iteration (loops) are typically represented as jump or branch instructions while recursion requires the creation of a new stack frame on the call stack.

No, in TypeScript's type system. As far as I know, recursion is the only method of iteration but the comment I was replying to seemed to imply otherwise.

The comment does not imply otherwise

I thought you did because of the "would". So you're saying that TypeScript is not Turing complete?

Nothing is Turing complete. But it is the stronger form of incomplete where even on a machine with truly unlimited memory it’d still be unable to model some (almost all, formally) executions.

Reply on news.ycombinator.com