Sujet : Re: Defining a correct simulating halt decider
De : mikko.levanto (at) *nospam* iki.fi (Mikko)
Groupes : comp.theoryDate : 03. Sep 2024, 11:25:01
Autres entêtes
Organisation : -
Message-ID : <vb6o5t$3a95s$1@dont-email.me>
References : 1
User-Agent : Unison/2.2
On 2024-09-02 16:38:03 +0000, olcott said:
A halt decider is a Turing machine that computes
the mapping from its finite string input to the
behavior that this finite string specifies.
A halt decider needn't compute the full behaviour, only whether
that behaviour is finite or infinite.
-- Mikko
…