Liste des Groupes | Revenir à s logic |
On 22/03/24 22:24, olcott wrote:If a C program can compute a function that a TM can't thenOn 3/22/2024 4:19 PM, immibis wrote:In other words I agree that C half-programs are not Turing machines unless they can be proven to be.On 22/03/24 21:53, olcott wrote:>On 3/22/2024 3:34 PM, immibis wrote:Only the Turing machine version can show every single detail of the Turing machine...On 22/03/24 20:47, olcott wrote:>On 3/22/2024 2:44 PM, immibis wrote:>On 22/03/24 19:41, olcott wrote:>01 int D(ptr x) // ptr is pointer to int function>
02 {
03 int Halt_Status = H(x, x);
04 if (Halt_Status)
05 HERE: goto HERE;
06 return Halt_Status;
07 }
08
09 void main()
10 {
11 H(D,D);
12 }
Incomplete program. When you run it, it prints "Error: Undefined function H" and then halts.
>
That you ignore what I say seems far too Trollish
https://github.com/plolcott/x86utm/blob/master/Halt7.c
That's a different program that cannot be translated to a Turing machine.
If a counter-example exists for abort decider H in C then it
exists for TM H. Only the C version can show every single detail.
>
In other words you agree that abort deciders cannot possibly be
thwarted.
Les messages affichés proviennent d'usenet.