It’s hard to see if the author understands that “the halting problem” is a specific thing with a proof that you can’t solve it, and translated accidentally from the author’s native language landing on a predefined phrase, or if the title is just embarrassing clickbait.

Though, it also is a rather profound fact that every Turing machine which runs in O(F(N)) time for some primitive recursive function F is itself a primitive recursive function in disguise… You could compute anything practically meaningful without reaching for the power of Turing machine! “Just add an instruction counter” is a bit deeper than it seems at a first glance.

I don’t understand what this has to do with the halting problem. It appears to basically just be a CPU/memory resource limits system?

It’s hard to see if the author understands that “the halting problem” is a specific thing with a proof that you can’t solve it, and translated accidentally from the author’s native language landing on a predefined phrase, or if the title is just embarrassing clickbait.

It’s an obvious clickbait :-)

Though, it also is a rather profound fact that every Turing machine which runs in

`O(F(N))`

time for some primitive recursive function`F`

is itself a primitive recursive function in disguise… You could compute anything practically meaningful without reaching for the power of Turing machine! “Just add an instruction counter” is a bit deeper than it seems at a first glance.