XPost: comp.theory
From: chris.m.thomasson.1@gmail.com
On 10/28/2025 2:40 PM, olcott wrote:
> On 10/28/2025 4:33 PM, Kaz Kylheku wrote:
>> On 2025-10-28, olcott wrote:
>>> On 10/28/2025 3:37 PM, Kaz Kylheku wrote:
>>>> The above C violates a rule.
>>>
>>> I am providing the gist of the essence because
>>
>> C does not run on gists and essences, sorry.
>>
>
> In other words you are trying to get away with
> pretending that you are too damned stupid to
> do this execution trace in your head?
>
> int D()
> {
> int Halt_Status = H(D);
> if (Halt_Status)
> HERE: goto HERE;
> return Halt_Status;
> }
>
> H simulates D
> that calls H(D) to simulate D
> that calls H(D) to simulate D
> that calls H(D) to simulate D
> that calls H(D) to simulate D
> that calls H(D) to simulate D
> until H sees this repeating pattern.
>
So? You need to cover all the paths of DD, no? The halt and the non-halt
paths. Conclusion, DD can sometimes halt, other times not. H(D),
HH(DDD), lol.
Again, this D, what happened to DD or HHH for that matter? ;^o Anyway, D
is dependent on what H(D) returns. It can halt, or not halt. It sure
seems like my basic is a better decider than any H(D), H(DDDDF),
HHHHH(DDDDDDDD), HHH(DD), ect you can ever make?
1 HOME
5 PRINT "The Olcott All-in-One Halt Decider!"
10 INPUT "Shall I halt or not? " ; A$
30 IF A$ = "YES" GOTO 666
40 GOTO 10
666 PRINT "OK!"
DD, D, DDD, DDD_DDD_D, is dependent what your H, HH, HHH, HHHH, returns
anyway? ... Assuming you keep DD, D, DDD, ... as depending on what
HHH(DD) returns? It logic literally depends on H, HH, HHH, ...? So what?
You really need to keep unique version numbers, say:
H0, H1, H2 with D0, D1, D2, D3, D4, ...
Humm... ?
--- SoupGate-Win32 v1.05
* Origin: you cannot sedate... all the things you hate (1:229/2)
|
