Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: olcott <polcott333@gmail.com>
Newsgroups: comp.theory,sci.logic
Subject: Re: Nature of undecidable halting --- Connecting truth-bearers to
 their truthmaker
Date: Thu, 16 May 2024 10:00:38 -0500
Organization: A noiseless patient Spider
Lines: 47
Message-ID: <v2572m$1kais$3@dont-email.me>
References: <v18e32$1vbql$1@dont-email.me> <v1h9eu$9faf$1@dont-email.me>
 <v1iqli$nsva$1@dont-email.me> <v1k0ts$iuna$1@i2pn2.org>
 <v1k381$14mbi$2@dont-email.me> <v1labh$kf53$1@i2pn2.org>
 <v1lfnq$1e7af$1@dont-email.me> <v1lh1g$kf52$4@i2pn2.org>
 <v1lmo1$1g1mj$1@dont-email.me> <v1luu1$lbo5$3@i2pn2.org>
 <v1lvuo$1i47i$1@dont-email.me> <v1m1bf$lbo5$4@i2pn2.org>
 <v1m2hc$1ijhr$1@dont-email.me> <v1m31m$lbo4$1@i2pn2.org>
 <v1m4et$1iv85$1@dont-email.me> <v1m5co$lbo4$2@i2pn2.org>
 <v1m71h$1jnpi$1@dont-email.me> <v1m7mh$lbo5$5@i2pn2.org>
 <v1mb8f$1kgpl$1@dont-email.me> <v1mkf8$lbo5$7@i2pn2.org>
 <v1mkmm$1q5ee$1@dont-email.me> <v1na6f$1ugl0$1@dont-email.me>
 <v1o67n$24f4c$1@dont-email.me> <v1q1ie$2l40t$1@dont-email.me>
 <v1q9fp$qb0p$1@i2pn2.org> <v1qmq8$2prs6$1@dont-email.me>
 <v1qouc$2qb2s$1@dont-email.me> <v1vbpd$3gbc$1@dont-email.me>
 <v1vslr$7enr$1@dont-email.me> <v21qdm$op3a$1@dont-email.me>
 <v22j1j$u8vi$3@dont-email.me> <v24nv1$1h2lu$1@dont-email.me>
 <v2517g$171b6$1@i2pn2.org>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Thu, 16 May 2024 17:00:39 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="4dc0119aaf775edb7bf006f6d2fcc2e1";
	logging-data="1714780"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1+CUQ4PFU5qvtRUMWaU5dJS"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:cHwGyB6LQg/ToMmY+Tz/WoboHPo=
Content-Language: en-US
In-Reply-To: <v2517g$171b6$1@i2pn2.org>
Bytes: 3829

On 5/16/2024 8:20 AM, joes wrote:
> Am Thu, 16 May 2024 13:42:41 +0300 schrieb Mikko:
>> On 2024-05-15 15:06:26 +0000, olcott said:
>>> I refer to transitioning through a specific state to indicate a
>>> specific halt status value, for Turing Machines.
>>
>> That does not satisfy the usual definition of "halt decider". However,
>> we could accept that as a solution to the halting problem if one could
>> prove that there is a Turing machine that can indicate halting or
>> non-halting that way for all computations.
>>
>> However, it is possible to prove that every Turing machine that
>> indicates halting that way fails to indicate correctly at least some
>> computations.
> 
> Are these all of the liar paradox kind, such that one could easily
> exclude them? Or do they form a more interesting class?
> 

Good question!



"a sentence may fail to make a statement if it is paradoxical or 
ungrounded."
*Outline of a Theory of Truth --- Saul Kripke*
https://www.impan.pl/~kz/truthseminar/Kripke_Outline.pdf

How to define a True(L, x) predicate that refutes Tarski Undefinability:
*The grounding of a truth-bearer to its truthmaker*
True(L,x) returns true when x is derived from a set of truth preserving
operations from finite string expressions of language that have been 
stipulated to have the semantic value of Boolean true. False(L,x) is 
defined as True(L,~x).  Copyright 2022 PL Olcott

The above architecture detects and rejects every epistemology
antinomy such as the Liar Paradox. This proves that Gödel is
wrong about this:

....14 Every epistemological antinomy can likewise be used for a similar 
undecidability proof...(Gödel 1931:43-44)


-- 
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer