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.
 

void Recursion_Chain_03(int M)
{
   Recursion_Chain_01(M);
}
void Recursion_Chain_02(int M)
{
   Recursion_Chain_03(M);
}
void Recursion_Chain_01(int M)
{
   Recursion_Chain_02(M);
}
int main()
{
   Output("Input_Halts = ", H(Recursion_Chain_01,(ptr)5));
}
My simulating termination analyzer correctly determines
that the above sequence will not terminate.
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.
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer