3 ms·
Looks like it terminated.
by lurker17 15y ago
Looks like it terminated.
- spectre 15y agowhile 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.
- gujk 15y agoStack 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.
- andrewflnr 15y agoThe Turing machine we're interested in didn't terminate. It got a stick stuck in it by the outer Turing machine. :)