Re: How Partial Simulations correctly determine non-halting ---Mike Terry Error

On 05/06/2024 10:38, Ben Bacarisse wrote:

John Smith <news2@immibis.com> writes:
 

Then increase the stack space until it doesn't run out. Turing machines
can't run out of stack space unless you programmed them wrong.

 A Turing machine can't run out of stack space because there is no stack.
That's like saying a polynomial has limited precision if you evaluate it
badly.  It's the evaluation that's wrong, not the polynomial.  I know
what you mean, but having talked to maths crank on Usenet for years, one
thing I would caution against is being slowly sucked into the cranks bad
use of technical terms.
 

Wandering slightly : also, PO's H/HH/etc. (running under x86utm) requires minimal stack space to run - probably just a few KB would suffice, /regardless of recursion depth/.  Given that PO allocates 64KB for the stack, this is not going to be a problem.
The reason recusion depth is not a factor is that H /simulates/ D rather than calling it.  The simulation does not consume H's stack space, and neither do nested simulations - they all have their own separately allocated stacks.
PO's design uses a single 32-bit address space which must hold ALL levels of nested recursion, so obviously something has to fail as nesting levels grow.  That would be an "out of memory" failure when trying to acquire resource to create a new simulation level.  I.e. a /heap/ error rather than "out of stack".
In practice his system would become unusable long before then due to CPU requirements in simulating instructions for each recursion level - that grows exponentially with a factor of (something like) 200 between each level.  So at a recursive simulation depth of just 10, a single instruction would take something like 100,000,000,000,000,000,000,000 outer level instructions to simulate, which is just impractical.
Mike.