Liste des Groupes | Revenir à ca philosophy |
In comp.theory olcott <polcott333@gmail.com> wrote:Whether or not machine M halts on input i
The error of all of the halting problem proofs is
that they require a Turing machine halt decider to
report on the behavior of a directly executed
Turing machine.
If that was true then you could point out at least oneIt is common knowledge that no Turing machine decider
can take another directly executing Turing machine as
an input, thus the above requirement is not precisely
correct.When we correct the error of this incorrect requirement
it becomes a Turing machine decider indirectly reports
on the behavior of a directly executing Turing machine
through the proxy of a finite string description of this
machine.Now I have proven and corrected the error of all of theNo you haven't, the subject matter is too far beyond your intellectual
halting problem proofs.
capacity.
Les messages affichés proviennent d'usenet.