Liste des Groupes | Revenir à theory |
On 5/2/2024 4:07 AM, Alan Mackenzie wrote:olcott <polcott333@gmail.com> wrote:On 4/29/2024 1:19 PM, Alan Mackenzie wrote:
I think it much more likely that there's no such thing as a "simulating
termination analyzer".
When a simulating termination analyzer matches one of three non-halting
behavior patterns (a) Simple Infinite loop (b) Simple Infinite Recursion
(c) Simple Recursive Simulation
It aborts it simulation and reports that the input specifies a
non-halting sequence of configurations. Otherwise it continues to
simulate the input to completion. Non-terminating inputs that have
complex non-halting behaviors are outside of its domain.
The difference is that as long as a STA gets one input that halts
correctly and one input that fails to halt correctly then it is a STA.
An actual halt decider is required to be ALL knowing.
Les messages affichés proviennent d'usenet.