Sujet : Re: Simulation vs. Execution in the Halting Problem
De : mikko.levanto (at) *nospam* iki.fi (Mikko)
Groupes : comp.theoryDate : 30. May 2025, 09:45:42
Autres entêtes
Organisation : -
Message-ID : <101br7m$db03$1@dont-email.me>
References : 1 2
User-Agent : Unison/2.2
On 2025-05-29 18:10:39 +0000, olcott said:
On 5/29/2025 12:34 PM, Mr Flibble wrote:
🧠 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.
The simulation of the behaviour should be equivalent to the real
behaviour. Whether it actually is depends on the quality of the
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 possibility
to call anything so the effect of calling the simulator need not be
considered.
-- Mikko