Sujet : Re: Simulation vs. Execution in the Halting Problem
De : mikko.levanto (at) *nospam* iki.fi (Mikko)
Groupes : comp.theoryDate : 16. Jun 2025, 12:05:12
Autres entêtes
Organisation : -
Message-ID : <102otp8$1ja8l$1@dont-email.me>
References : 1
User-Agent : Unison/2.2
On 2025-05-29 17:34:22 +0000, Mr Flibble said:
🧠 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.
Simulation is just a particular kind of computation. They are not an
important kind for computation theory. But there is a proof that every
Turing machine can be simulated accurately by an universal Turing
machine.
-- Mikko
Re: Simulation vs. Execution in the Halting Problem