Path: ...!weretis.net!feeder9.news.weretis.net!i2pn.org!i2pn2.org!.POSTED!not-for-mail
From: joes <noreply@example.com>
Newsgroups: comp.theory
Subject: Re: How Partial Simulations correctly determine non-halting --- Ben's
 strawman deception
Date: Wed, 5 Jun 2024 17:57:42 -0000 (UTC)
Organization: i2pn2 (i2pn.org)
Message-ID: <v3q8um$34b9u$6@i2pn2.org>
References: <v3j20v$3gm10$2@dont-email.me>
	<J_CdnTaA96jxpcD7nZ2dnZfqnPudnZ2d@brightview.co.uk>
	<87h6eamkgf.fsf@bsb.me.uk> <v3kcdj$3stk9$1@dont-email.me>
	<v3l7uo$13cp$8@dont-email.me> <v3lcat$228t$3@dont-email.me>
	<v3mq9j$chc3$1@dont-email.me> <v3mrli$chc4$1@dont-email.me>
	<_gWdnbwuZPJP2sL7nZ2dnZfqn_GdnZ2d@brightview.co.uk>
	<v3nkqr$h7f9$3@dont-email.me> <v3oeh5$jthg$2@dont-email.me>
	<v3of8e$lirl$1@dont-email.me> <v3ofld$jthh$1@dont-email.me>
	<v3oh8l$pi6u$3@dont-email.me> <v3ohkh$jthg$4@dont-email.me>
	<87frtr6867.fsf@bsb.me.uk> <v3pkig$v133$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
Injection-Date: Wed, 5 Jun 2024 17:57:42 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="3288382"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="nS1KMHaUuWOnF/ukOJzx6Ssd8y16q9UPs1GZ+I3D0CM";
User-Agent: Pan/0.145 (Duplicitous mercenary valetism; d7e168a
 git.gnome.org/pan2)
X-Spam-Checker-Version: SpamAssassin 4.0.0
Bytes: 2499
Lines: 24

Am Wed, 05 Jun 2024 07:09:52 -0500 schrieb olcott:
> 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.
The halting problem with limited memory is boring. Theory is not concerned
with physical problems.

-- 
joes