Re: How Partial Simulations correctly determine non-halting --- Ben's strawman deception

On 6/5/2024 4:38 AM, 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.

When theory of computation questions are analyzed on physical machines
having physical memory running out is stack space is possible, thus
changing to subject to something else as a type of rebuttal is still the
strawman deception.