Liste des Groupes | Revenir à theory |
On 8/7/2024 2:17 AM, Mikko wrote:A completed task is one that has already reached its halt state.On 2024-08-05 13:45:19 +0000, olcott said:On 8/2/2024 11:32 PM, Jeff Barnett wrote:
On 8/5/2024 2:33 AM, Mikko wrote:That you agree does not mean that I was wrong (though it certainlyOn 2024-08-04 12:35:04 +0000, olcott said:That is incorrect. A completed task is a task where
On 8/4/2024 6:12 AM, Richard Damon wrote:No, that is not what the words mean. A complete emulation is one that isOn 8/3/24 11:00 PM, olcott wrote:A complete emulation is after all of the instructions have beenOn 8/3/2024 9:56 PM, Richard Damon wrote:WHy do you say it is impossible, it just takes forever,On 8/3/24 7:36 PM, olcott wrote:You already know that a complete emulation of a non-endingOn 8/3/2024 5:51 PM, Richard Damon wrote:Maybe to your mind filled with false facts, but it isn't true.On 8/3/24 6:15 PM, olcott wrote:It is self-evident and you know it. I do have fourOn 8/3/2024 5:07 PM, Richard Damon wrote:Just says lying YOU.The problem is that every one of those emulation is of a *DIFFERENT* input, so they don't prove anything together except that each one didn't go far enough.void DDD()
{
HHH(DDD);
return;
}
When each HHH correctly emulates 0 to infinity steps of
its corresponding DDD and none of them reach the "return"
halt state of DDD then even the one that emulated infinite
steps of DDD did not emulate enough steps?
You got any source for that other than yourself?
people (two with masters in CS) that attest to that.
*It is as simple as I can possibly make it*
I wonder how you think that you are not swearing yourBecause, I know I speak the truth.
allegiance to that father of lies?
Why do you not think you are lying?
Anyone that truly understands infinite recursion knowsRight, but for every other HHH, which the ones that answer are, it isn't a fact.
that DDD correctly simulated by HHH cannot possibly reach
its own "return" final state.
Surpisingly (to me) Jeff Barnett set the record straightNo, there is one, and only one definition, it is a machine that reaches its final state.
on exactly what halting means.
Note, *a machine*, not a (partial) emulation of the machine
sequence is impossible and you already acknowledged that
DDD emulated by HHH that never aborts is non-ending.
emulated. That never happens with any infinite execution.
continued as long as it can be continued. THe emulation is completed when
all of its instructions are executed. A complete emulaton that can be
continues forever is complete but never completed.
there are no more steps to be accomplished.
means that I should check one more time, and I did, and found some
typos but no substantial error).
> ...In some formulations, there are specific states
> defined as "halting states" and the machine only
> halts if either the start state is a halt state...
> ...these and many other definitions all have
> equivalent computing prowess...
A completed task is one that reaches its halt state.
Les messages affichés proviennent d'usenet.