Liste des Groupes | Revenir à theory |
Op 18.jun.2024 om 19:25 schreef olcott:It is correct do say that the simulated input did not terminateOn 6/18/2024 12:06 PM, joes wrote:If the code specifies 5 iterations and the simulator simulates only 3 iterations, it is incorrect to conclude that the repetition show non-halting behaviour.
>
void DDD()
{
H0(DDD);
}
>
DDD correctly simulated by any H0 cannot possibly halt.
>DDD halts iff H0 halts.>
Halting is a technical term-of-the-art that corresponds
to terminates normally. Because Turing machines are
abstract mathematical objects there has been no notion
of abnormal termination for a Turing machine.
>
We can derive a notion of abnormal termination for Turing
machines from the standard terms-of-the-art.
>
Some TM's loop and thus never stop running, this is classical
non-halting behavior. UTM's simulate Turing machine descriptions.
This is the same thing as an interpreter interpreting the
source-code of a program.
>
A UTM can be adapted so that it only simulates a fixed number
of iterations of an input that loops. When this UTM stops
simulating this Turing machine description we cannot correctly
say that this looping input halted.
>
Similarly, when your H, H0, or other H simulates itself, its simulation aborts one cycle too early and therefore the non-halting conclusion is incorrect.I was confused bout this for three days four years ago and then I
Les messages affichés proviennent d'usenet.