Liste des Groupes | Revenir à theory |
On 6/4/2025 2:39 AM, Mikko wrote:And a correct analysis of the code shows that this is only a finite recursion, because the input for HHH includes the code of Halt7.c, where it specified that the program aborts and halts.On 2025-06-02 05:12:26 +0000, olcott said:You can say these things only by making
>On 6/1/2025 6:20 AM, Mikko wrote:>On 2025-05-31 19:21:10 +0000, olcott said:>
>On 5/31/2025 2:11 PM, Mr Flibble wrote:>Olcott is doing this:>
>
int main()
{
DDD(); // DDD calls HHH
}
>
This is incorrect as it is a category (type) error in the form of
conflation of the EXECUTION of DDD with the SIMULATION of DDD: to
completely and correctly simulate/analyse DDD there must be no execution
of DDD prior to the simulation of DDD.
>
Olcott should be doing this:
>
int main()
{
HHH(DDD);
}
I would have left it there except that many dozens of
reviewers have pointed out that they believe that HHH
is supposed to report on the behavior of its caller.
A halt decider is required to report on the computation it is asked
about. There is no requirement that a halt decider knows or can find
out whether it is called by the program about which is required to
report. Consequently, whether the computaton asked about calls the
decider is irrelevant.
void DDD()
{
HHH(DDD);
return;
}
>
The *input* to simulating termination analyzer HHH(DDD)
specifies recursive simulation that can never reach its
*simulated "return" instruction final halt state*
If it does then the "input" is not DDD, which specifies a halting
behaviour if HHH is a decider.
>
sure to ignore the verified facts.
HHH1(DDD) emulates DDD that calls HHH(DDD)
that emulates DDD that calls HHH(DDD)
that emulates DDD that calls HHH(DDD)
Les messages affichés proviennent d'usenet.