Liste des Groupes | Revenir à theory |
On 2025-05-29 18:10:39 +0000, olcott said:That is the same as saying a function with infinite
On 5/29/2025 12:34 PM, Mr Flibble wrote:The simulation of the behaviour should be equivalent to the real>>
🧠 Simulation vs. Execution in the Halting Problem
>
In the classical framework of computation theory (Turing machines),
simulation is not equivalent to execution, though they can approximate one
another.
To the best of my knowledge a simulated input
always has the exact same behavior as the directly
executed input unless this simulated input calls
its own simulator.
behaviour.
Whether it actually is depends on the quality of theA function that calls its own simulator specifies different
simulator. There is no exception for the case when the simulator
is called. If the behaviour in the simulation is different from
a real execution then the simulation is wrong.
One of the advantages of Turing machines is that there is no possibilityThe same issue occurs in the Linz proof, it is merely more
to call anything so the effect of calling the simulator need not be
considered.
Les messages affichés proviennent d'usenet.