On 9/12/2020 1:25 AM, André G. Isaak wrote:
> On 2020-09-11 20:12, olcott wrote:
>> On 9/11/2020 8:25 PM, Kaz Kylheku wrote:
>>> On 2020-09-11, olcott <No...@NoWhere.com> wrote:
>>>> I understand exactly how my claim seems to be and how it really
>>>> seems to
>>>> be necessarily false. Things are not always as they seem to be.
>>>
>>> The claim is in a holding pattern, and not evolving at all. While that
>>> continues, it will continue to seem the way it seems.
>>>
>>
>> This claim is in a holding pattern awaiting the completion of its
>> necessary infrastructure:
>
> The problem is that all this 'infrastructure' should be entirely
> unnecessary. You don't need an x86 emulator. You just need to provide
> the C code for H and Ĥ. Either you have these or you don't. If you have
> them, you should provide them. If you don't have them, then you cannot
> actually claim that your H can decide whether Ĥ(Ĥ) halts.
>
I Have explained this too many times now.The fact that you fail to
comprehend how my answers are correct does not actually make them
incorrect.
> Until you provide these, there is absolutely no point in claiming that
> you have accomplished something. Claiming you have some "special
> insight" but refusing to state what that is doesn't exactly bolster your
> credibility.
>
Sure there is. We must refine the criterion measure by which my work
will be evaluated. Too many times in this forum I totally proved my
point and no one noticed because they were so sure that I must be
incorrect that they did not pay enough attention.
THERE IS NO CORRECT REBUTTAL OF THIS:
For example it is true that framing the infrastructure of analytical
truth around the sound deductive inference model circumvents 1931 Gödel
Incompleteness and Tarski Undefinability. When we do this true and
provable cannot possibly diverge. If it is true then it is the
conclusion of sound deduction, if it is not the conclusion of sound
deduction then it doesn't count as true.
I will soon have a UTM equivalent that executes a partial halt decider
sufficiently equivalent to the Linz H correctly deciding halting on the
Linz Ĥ proving that Ĥ on input Ĥ is decidable.
> André
>
>> I (will soon) have an x86 partial halt decider sufficiently equivalent
>> to the Linz H correctly deciding halting on the Linz Ĥ thus proving
>> the H/Ĥ template does not prevent a correct halting decision.
>>
>> In the last two weeks I completed the boring and tedious job of
>> getting the x86 emulator to directly execute the COFF object files
>> generated by the Microsoft C compiler on both Windows and Linux. I had
>> this working previously under Windows yet one of my updates broke
>> something that had to be fixed.
>>
>
>
--
Copyright 2020 Pete Olcott