Re: HHH(DDD)==0 is correct

On 7/4/25 2:25 PM, olcott wrote:

On 7/4/2025 1:14 PM, Richard Damon wrote:

On 7/4/25 10:43 AM, olcott wrote:

On 7/4/2025 8:23 AM, Richard Damon wrote:

On 7/4/25 8:50 AM, olcott wrote:

On 7/4/2025 2:35 AM, Mikko wrote:

On 2025-07-03 12:56:42 +0000, olcott said:
>

On 7/3/2025 3:57 AM, Mikko wrote:

On 2025-07-03 02:50:40 +0000, olcott said:
>

On 7/1/2025 11:37 AM, Mr Flibble wrote:

On Mon, 30 Jun 2025 21:12:48 -0400, Richard Damon wrote:
>

On 6/30/25 2:30 PM, Mr Flibble wrote:
>
PO just works off the lie that a correct simulation of the input is
different than the direct execution, even though he can't show the
instruction actually correctly simulated where they differ, and thus
proves he is lying.
>
The closest he comes is claiming that the simulation of the "Call HHH"
must be different when simulated then when executed, as for "some
reason" it must be just because otherwise HHH can't do the simulation.
>
Sorry, not being able to do something doesn't mean you get to redefine
it,
>
You ar4e just showing you are as stupid as he is.

>
No. A simulator does not have to run a simulation to completion if it can
determine that the input, A PROGRAM, never halts.
>
/Flibble

>
The most direct way to analyze this is that
HHH(DDD)==0 and HHH1(DDD)==1 are both correct
because DDD calls HHH(DDD) in recursive simulation and
DDD does not call HHH1(DDD) in recursive simulation.

>
Either "no" (encoded as 0) or "yes" (encoded as any other number) is the
wrong asnwer to the quesstion "does DDD specify a halting computation?".

>
That is *not* the actual question.

>
THe actual question is whatever someone asks.

>
What is the area of a square circle with a radius of 2?
>

However, if the question is
not "does DDD specify a halting computation?" or the same about some
other computation then it is not in the scope of the halting problem
or the termination problem.
>

>
The halting problem has always been flatly incorrect
by making that the question. So I am reframing the
question the same way that ZFC reframed Russell's Paradox.

>
Nope, just shows you are too stupid to understand it.
>

>
Then tell me where I go wrong on this explanation:
ZFC conquered Russell's Paradox by redefining how
sets are defined such that a set that is a member
of itself can no longer be defined.
>
"ZFC avoids this paradox by using axioms that restrict set formation."

>
And what does that distraction have to do with halting problem?
>

 *Changing the definition of the problem is a way to solve it*
 

But you aren't allowed to do that.
Note, ZFC doesn't solve the problem of Russell's Paradox in Naive Set Theory, as it doesn't do anything to Naive Set Theory.
If you want to try to define your own version of Computability theory, go ahead and do the work, start with  your list of axioms and definitions that build your system.
Then show what you system can actually do, and provide some reason for people to move from the fully working existing system to your alternate.
The non-computability of some problems is not considered a "problem" with computability, it just shows that it creates a powerful enough system. This seems to be a natural product of the fact that it deals with things that are of countable infinte size. My guess is that any computation system that you can derive that meets your goals can't handle the same breadth of problems.