On 8/11/25 3:40 PM, olcott wrote:
On 8/11/2025 2:30 PM, Mr Flibble wrote:
LLM agreements cited by Olcott stem from prompts that frame HHH narrowly
as a simulator, not a full decider.
This just confirms that Olcott is not interested in the Halting Problem,
he is only interested in the Olcott Problem even though he seems to lack
insight into this state of affairs.
/Flibble
I think that everyone else here understands that
HHH need not be a full halt decider to refute
the halting problem proof. HHH(DD) merely needs
to show that its input is not undecidable.
The problem is that is just a nonsense statement.
"Inputs" are not undecidable, as any given DD, built on a specified HHH,
has definite halting behavior.
The PROBLEM is undecidable, as we can show that for every possible
decider trying to compute it, it gets at least one case wrong, and thus
there is no universally correct decider for it.
This is first year logic theory stuff, and you don't understand it after decades of work.
That just shows your stupidity.
--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)