Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Looks like it terminated.


The Turing machine we're interested in didn't terminate. It got a stick stuck in it by the outer Turing machine. :)


while the compilation does technically terminate it is doing so with a StackOverflowError which along with the resulting stack-trace most likely indicates a non-terminating recursion.

It only terminates due to a finite limit on the size of the stack.


Stack depth limits avoid some non-termination by changing them into crashes. It is still a failure, of course, but a bit different and generally less troublesome than say, a tailcall eliminating recursion that actually spins for hours until a human notices and interrupts it.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: