Path: ...!weretis.net!feeder8.news.weretis.net!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: Ben Bacarisse <ben@bsb.me.uk>
Newsgroups: comp.theory,sci.logic
Subject: Re: How Partial Simulations correctly determine non-halting ---Mike Terry Error
Date: Wed, 05 Jun 2024 10:38:40 +0100
Organization: A noiseless patient Spider
Lines: 14
Message-ID: <87frtr6867.fsf@bsb.me.uk>
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>
MIME-Version: 1.0
Content-Type: text/plain
Injection-Date: Wed, 05 Jun 2024 11:38:43 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="fe53fe53babab0945330b05f4f507f8b";
	logging-data="968286"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1+NjVJ2fejH7j+2OLORjcK1NXklzGn1xyE="
User-Agent: Gnus/5.13 (Gnus v5.13)
Cancel-Lock: sha1:eSZhkDuHqdvg3ZZYI9tQZAYN3AI=
	sha1:vVC3CAcDDWcAycHanZWunEYWTqY=
X-BSB-Auth: 1.73e52917d3c308b3d340.20240605103840BST.87frtr6867.fsf@bsb.me.uk
Bytes: 2118

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.

-- 
Ben.