On 11/30/2020 2:27 PM, Kaz Kylheku wrote:
> ["Followup-To:" header set to comp.theory.]
> On 2020-11-27, olcott <No...@NoWhere.com> wrote:
>> On 11/27/2020 12:51 PM, Kaz Kylheku wrote:
>>> On 2020-11-27, olcott <No...@NoWhere.com> wrote:
>>>> On 11/27/2020 7:03 AM, Leo wrote:
>>>>>> Copyright 2020 Pete Olcott
>>>>> Did you just claim to have the copyrights to an empty message?
>>>>>
>>>>>> "Great spirits have always encountered violent opposition from
>>>>>> mediocre minds." Einstein
>>>>> Is this a random quote you like, or do you truly think this is what is
>>>>> happening to you when you announce bogus proofs about computer science
>>>>> concepts every other day?
>>>>>
>>>>> --
>>>>> Leo
>>>>
>>>> You can found out when you try to point to any actual error in my work.
>>>
>>> It would be more efficient to record the calendar days on which such
>>> a thing /doesn't/ happen here.
>>>
>>
>> There are many people that believe that I made mistakes yet none of
>> these beliefs is sustained by the actual facts.
>
> You claim to have a result which contradicts established theorems.
>
> If that is is so, you must necessarily be able to point to specific
> inference steps in the existing theorems where they take a wrong turn.
>
> It's logically impossible to publish a result which destroys a theorem,
> without being able to successfully point out the error in that theorem.
>
> What you're doing is similar to the following.
>
> - There is a proof that every decimal integer which ends in 0, 2, 4, 6
> and 8 is even (divisible by two) and no other decimal integers are.
>
> - You claim that that this is not so; yet are not able to explain how
> any step of any accepted proof is wrong.
>
> - Instead, you claim you have found a number which is even, yet does
> not end in 0, 2, 4, 6 or 8. When pressed to reveal this number you
> resort to delay tactics, like showing non-working fragments of computer
> programs that hint at the possibility of calculating the number,
> (and that are rife with newbie programming errors).
>
> - You insist that there is a complete, working program, but that
> is a "trade secret".
>
> Something like that.
>
> If presenting Monopoly money to a bank teller could legitimately be
> called "fraud", then you're perpetrating the intellectual form thereof.
>
I already posted the complete execution trace of the details of how
Halts decides halting on H_Hat()
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (!Input_Halts)
HALT
else
HERE: goto HERE;
}
When Halts() always simulates its input it is obvious that
Halts((u32)H_Hat, (u32)H_Hat) specifies infinite recursion thus can be
decided as non halting.
Just like some people really believe that 250% of all of the beings in
the universe voted for Trump some people deny infinite recursion even
when it slaps them in the face.