Deutsch   English   Français   Italiano  
<vui5fg$20qvu$1@dont-email.me>

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

Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: Mikko <mikko.levanto@iki.fi>
Newsgroups: sci.logic
Subject: =?utf-8?Q?Re:_Refutation_of_Turing=E2=80=99s_1936_Halting_Problem_Proof_Based_on_Self-Referential_Conflation_as_a_Category_(Type)_Error?=
Date: Sat, 26 Apr 2025 11:28:32 +0300
Organization: -
Lines: 38
Message-ID: <vui5fg$20qvu$1@dont-email.me>
References: <vu6lnf$39fls$2@dont-email.me> <vua9oi$2lub6$1@dont-email.me> <vudkah$1ona3$1@dont-email.me> <vufi61$3k099$1@dont-email.me> <vugddv$b21g$2@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sat, 26 Apr 2025 10:28:32 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="3d8a8a0311041e2defa0db058368d25d";
	logging-data="2124798"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX18DwgbcwyhAuSWBaWo2dTsk"
User-Agent: Unison/2.2
Cancel-Lock: sha1:46A2X51H6kRKINA7Mbb5rARzqUE=
Bytes: 2343

On 2025-04-25 16:31:58 +0000, olcott said:

> On 4/25/2025 3:46 AM, Mikko wrote:
>> On 2025-04-24 15:11:13 +0000, olcott said:
>> 
>>> On 4/23/2025 3:52 AM, Mikko wrote:
>>>> On 2025-04-21 23:52:15 +0000, olcott said:
>>>> 
>>>>> Computer Science Professor Eric Hehner PhD
>>>>> and I all seem to agree that the same view
>>>>> that Flibble has is the correct view.
>>>> 
>>>> Others can see that their justification is defective and contradicted
>>>> by a good proof.
>>>> 
>>>> Some people claim that the unsolvability of the halting problem is
>>>> unproven but nobody has solved the problem.
>>> 
>>> For the last 22 years I have only been refuting the
>>> conventional Halting Problem proof.
>> 
>> Trying to refute. You have not shown any defect in that proof of the
>> theorem. There are other proofs that you don't even try to refute.
> 
> Not at all. You have simply not been paying enough attention.

Actually a have been paying too much attention. You have neve refuted
anything. An unjustified opinion is not a proof and not a part of any
proof.

> Once we understand that Turing computable functions are only
> allowed

Everyting is allowed to Turing computable functions.

-- 
Mikko