Deutsch English Français Italiano |
<073cc1af709d85b8faf592444c00515a1e12986b.camel@gmail.com> View for Bookmarking (what is this?) Look up another Usenet article |
Path: news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail From: wij <wyniijj5@gmail.com> Newsgroups: comp.theory Subject: Re: =?UTF-8?Q?Flibble=E2=80=99s?= Leap: Why Behavioral Divergence Implies a Type Distinction in the Halting Problem Date: Tue, 13 May 2025 06:57:43 +0800 Organization: A noiseless patient Spider Lines: 54 Message-ID: <073cc1af709d85b8faf592444c00515a1e12986b.camel@gmail.com> References: <vv1UP.77894$JJT6.54808@fx16.ams4> <vvqd4u$g8a1$1@dont-email.me> <7N2UP.527443$wBt6.464256@fx15.ams4> <vvqfgq$gmmk$1@dont-email.me> <os3UP.670056$BFJ.223954@fx13.ams4> <vvqja4$gldn$10@dont-email.me> <vvql92$g8ck$4@dont-email.me> <87ikm5oklo.fsf@bsb.me.uk> MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: quoted-printable Injection-Date: Tue, 13 May 2025 00:57:46 +0200 (CEST) Injection-Info: dont-email.me; posting-host="e31f29e4266dbfa99e16745ceb93783d"; logging-data="1376465"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX198Ej7kQq3CVSkfxBzkVWOA" User-Agent: Evolution 3.54.3 (3.54.3-1.fc41) Cancel-Lock: sha1:IP51PU9kPiMbZ9sSR80QKIXF+gk= In-Reply-To: <87ikm5oklo.fsf@bsb.me.uk> On Mon, 2025-05-12 at 17:32 +0100, Ben Bacarisse wrote: [cut] >=20 > Of course, there are no pathological inputs like this because H does not > exist.=C2=A0=C2=A0 That is the key point. The 'pathological' input D exists only when the assumed halting decider H e= xists. D exists AFTER H does, so putting them together to discuss (or to form logi= cal expression or even 'theorem', maybe) as though both exist at the same time = is very dubious. Tradition logic is insufficient for math/logic, the foundation of science. The implication is profound and goes beyond most people thought. https://sourceforge.net/projects/cscall/files/MisFiles/RealNumber2-en.txt/d= ownload .... Peano's axioms, which are the basis of mathematical logic, have a serious f= law: Without a termination condition, it is impossible to explain "=E2=88=9E=E2= =88=89=E2=84=95" (if the definition of numbers relies on Peano's axioms). This has led to many theories related to infinity, including density and ot= her laws and logical inferences, to have the same blind spots and mistakes (Per= sonal opinion: The reasoning/axiomatic system may need to be changed to a procedu= al description)... So, in some POOH's rebuttal (just olcott's text, he don't understand what l= ogic 'if' means) that uses logic (Tarski,Sisper,Russell,PL,...), that logic=20 themselves are invalid (I should save the long ellaberation). In short, my opinion is that TM/algorithm (C/C++/Assembly could and should = be=C2=A0 the language for building theorys of math/CS/..), is the foundation of scie= nce better than contemporary, what-so-called 'strict, consistent/complete' axio= mized system. Also, this idea can prove Church=E2=80=93Turing thesis: TM cannot be proved= to be=20 exceeded simply because (current) axiomized system is less powerful than TM= .. Back to POOH's pathological input theory: The pathological input exists is because POOH exists.