From Newsgroup: comp.theory

177 posts much more than any other https://usenetarchives.com/threads.php?id=sci.logic&y=0&r=0&p=354

253 posts much more than any other https://usenetarchives.com/threads.php?id=comp.theory&y=0&r=0&p=598

This (and four other LLM systems review)
is the culmination of Halting Problem my work so far.

https://www.researchgate.net/publication/394345150_Halting_Problem_Simulation_Paradox

*My actual work is on the philosophy of self-evident truth*

In epistemology (theory of knowledge), a self-evident
proposition is a proposition that is known to be true
by understanding its meaning without proof https://en.wikipedia.org/wiki/Self-evidence

with special emphasis on the pathological self reference of:
(a) The Liar Paradox
(b) The Halting problem proofs
(c) The Tarski Undefinability Theorem
(d) Gödel's 1931 incompleteness theorem
"We are therefore confronted with a proposition
which asserts its own unprovability." Gödel 1931:39-41

Gödel, Kurt 1931. On Formally Undecidable Propositions
of Principia Mathematica And Related Systems I, page 39-41.

I focus on the Halting Problem proofs because computer
science has the most unequivocal system of specification.

I created Minimal Type Theory to provide the means
for detecting cycles in the directed graphs of the
evaluation sequence of formal expressions of language

G := ∃X ~Provable(X, G) // Written in Minimal Type Theory
Automatically translated into a Directed Graph
by the MTT compiler

[01] G (02)(04)
[02] THERE_EXISTS (03)
[03] X
[04] NOT (05)
[05] Provable (03)(01) // cycle indicates
// infinite evaluation loop

(PDF) Prolog detects [and rejects] pathological self reference in the
Gödel sentence. Available from: https://www.researchgate.net/publication/350789898_Prolog_detects_and_rejects_pathological_self_reference_in_the_Godel_sentence
[accessed Sep 09 2025].
--
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer

--- Synchronet 3.21a-Linux NewsLink 1.2