Deutsch   English   Français   Italiano  
<vvb9d3$1a9jr$3@dont-email.me>

View for Bookmarking (what is this?)
Look up another Usenet article

Path: news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: Richard Heathfield <rjh@cpax.org.uk>
Newsgroups: comp.theory
Subject: Re: Halting Problem: What Constitutes Pathological Input
Date: Mon, 5 May 2025 22:08:51 +0100
Organization: Fix this later
Lines: 38
Message-ID: <vvb9d3$1a9jr$3@dont-email.me>
References: <GE4SP.47558$VBab.42930@fx08.ams4> <vvamqc$o6v5$4@dont-email.me>
 <vvan7q$o4v0$1@dont-email.me> <ts5SP.113145$_Npd.41800@fx01.ams4>
 <vvat0g$vtiu$1@dont-email.me> <vvatf3$o4v0$3@dont-email.me>
 <vvaut0$vtiu$4@dont-email.me> <vvav6o$o4v0$4@dont-email.me>
 <vvb329$15u5b$1@dont-email.me> <vvb37g$1451r$1@dont-email.me>
 <vvb43f$15u5b$4@dont-email.me> <vvb4ok$o4v0$9@dont-email.me>
 <vvb52g$15u5b$6@dont-email.me> <vvb5ca$o4v0$10@dont-email.me>
 <vvb5vp$15u5b$7@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Mon, 05 May 2025 23:08:52 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="35396e3e70446f4ec1a7d7dab39281f2";
	logging-data="1386107"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1++suaQ0mbkt7kYXvl0U8bhQxXBObShp0Ipi6aTAF8TWg=="
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:YZ+gkKerHu0A4WPY57wV8MKQC5Q=
In-Reply-To: <vvb5vp$15u5b$7@dont-email.me>
Content-Language: en-GB

On 05/05/2025 21:10, olcott wrote:

<snip>

> That question is in many textbooks yet is still
> wrong because functions computed by models of
> computation such as Turing Machines or RASP machines
> are only allowed to use actual inputs as their basis.

Allowed by whom?

There's no law to stop people writing a TM and passing it any 
damn input they please; "only allowed" is a nonsense.

> When everyone here insists is that we simply ignore
> the above fundamental rule of how functions must be
> computed they are necessarily incorrect.

So by 'incorrect' you mean 'undecidable'. 'Incorrect' is the 
wrong word, of course.

You miss the whole point of Turing's proof, which is to show that 
some questions simply do not lend themselves to being answered by 
computers. You call such questions 'incorrect'. Everybody else 
(except for Mr Flibble) follows Turing's lead and call them 
'undecidable'. What word you use doesn't matter all that much if 
you don't need to discuss such questions with others, but the 
concept is very real and very clear. Quite why you rail against 
it is beyond me.

<snip>

-- 
Richard Heathfield
Email: rjh at cpax dot org dot uk
"Usenet is a strange place" - dmr 29 July 1999
Sig line 4 vacant - apply within