Deutsch   English   Français   Italiano  
<b6e1fdc2e46b780c149c38580f82c6077f29b0a3.camel@gmail.com>

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

Path: ...!weretis.net!feeder9.news.weretis.net!news.quux.org!eternal-september.org!feeder2.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: wij <wyniijj5@gmail.com>
Newsgroups: comp.theory
Subject: Re: Philosophy of Computation: Three seem to agree how emulating
 termination analyzers are supposed to work
Date: Mon, 11 Nov 2024 21:09:59 +0800
Organization: A noiseless patient Spider
Lines: 47
Message-ID: <b6e1fdc2e46b780c149c38580f82c6077f29b0a3.camel@gmail.com>
References: <vgr1gs$hc36$1@dont-email.me> <vgsq2j$v928$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
Injection-Date: Mon, 11 Nov 2024 14:10:00 +0100 (CET)
Injection-Info: dont-email.me; posting-host="9622cfba036e43b3b414f6aced5e2c6d";
	logging-data="1003647"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1/FAU0Uij9YCCFakzQ1ctPt"
User-Agent: Evolution 3.50.2 (3.50.2-1.fc39)
Cancel-Lock: sha1:6MlygrrK8OO7QkE4O/ocJRnHb5Y=
In-Reply-To: <vgsq2j$v928$1@dont-email.me>
Bytes: 2830

On Mon, 2024-11-11 at 13:33 +0200, Mikko wrote:
> OP says nothing aobut how emulationg termination analyzers are supposed t=
o
> work. I think that is OK. Philosophers may have opinions about that but
> the question is not really relevant for theorieticsl or practical purpose=
s.

Firstly, the HP is about the H that (If stated in C-function form, instead =
of
TM) that:

H(P,P)=3D1 iff P(P) halts.
H(P,P)=3D0 iff P(P) does not halts.
   =20
Astray from this, it is not about the Halting Problem. HP is (almost) about=
 a
real machine, whatever logic,formal proof,philosophy,... is not decisive.

olcott is a psychotic liar. he reads lots of technical terms and would post
whatever he searched for you to head-ache (that is one of his trick), and=
=C2=A0
pretending he is a learned genius. He simply knows nothing.
E.g=C2=A0'halt' --> no precise meaning
'Godel's theorem' --> no (significant) contents
'completeness' --> no (significant) contents
utm386 --> He can't construct TM for "1+2=3D3". He think his 'utm386' is an=
 OS.
C-language --> He needs debugger to understand, and took the complied assem=
bly=20
as 'totology' of his proof.
..... too many to list
Most of all, olcott does not even understand the logical-IF !!!

So, don't bother. olcott is a psychotic liar.

> Anyone who wants to present or sell an emulating termination analyzer sho=
uld
> tell what that particular analyzer actually does.

That's right.
But, in POO logic, olcott is always correct... just not interesting. No nee=
d=C2=A0
to argue (I though you and others engaged him for reasons).

The HP simply does not exist. POOH cannot perform the function as stated ab=
ove.