Liste des Groupes | Revenir à theory |
Am Wed, 19 Jun 2024 12:52:59 -0500 schrieb olcott:_DDD()On 6/19/2024 12:51 PM, joes wrote:Am Wed, 19 Jun 2024 09:05:29 -0500 schrieb olcott:On 6/19/2024 4:29 AM, Alan Mackenzie wrote:olcott <polcott333@gmail.com> wrote:On 6/18/2024 4:36 PM, Alan Mackenzie wrote:In comp.theory olcott <polcott333@gmail.com> wrote:On 6/18/2024 12:57 PM, joes wrote:Am Tue, 18 Jun 2024 12:25:44 -0500 schrieb olcott:On 6/18/2024 12:06 PM, joes wrote:^When the adapted UTM halts after recognizing the repeating state of aBut not a simulator.
Turing Machine Description that only loops and transitions to its
reject state then this adapted UTM is a halt decider for inputs that
only loop.
^You wanted to simulate the input.So what?As has often been said, it is then no longer a universal turingA UTM can be adapted so that it only simulates a fixed number of
iterations of an input that loops.
machine.
^What use is an analyser that can't deal with possible loops?Termination analyzers are required to halt so it fails to meet itsIt is a mistake for a simulating termination analyzer to simulateHow can that be a "mistake" if it's what the thing is programmed to
infinite repeating states.
do?
spec.
void DDD()H0 should just return that DDD halts, which it does.
{
H0(DDD);
}
Les messages affichés proviennent d'usenet.