Sujet : Re: The philosophy of computation reformulates existing ideas on a new basis --- getting somewhere
De : richard (at) *nospam* damon-family.org (Richard Damon)
Groupes : comp.theoryDate : 04. Nov 2024, 13:07:12
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <1ee05647789dbaab013f1194411ff373e45a463e@i2pn2.org>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27
User-Agent : Mozilla Thunderbird
On 11/3/24 11:03 PM, olcott wrote:
On 11/3/2024 9:57 PM, Richard Damon wrote:
On 11/3/24 10:19 PM, olcott wrote:
On 11/3/2024 7:46 PM, Richard Damon wrote:
On 11/3/24 8:38 PM, olcott wrote:
On 11/3/2024 7:26 PM, Richard Damon wrote:
On 11/3/24 8:21 PM, olcott wrote:
>
What would an unbounded emulation do?
>
>
Keep on emulating for an unbounded number of steps.
>
Something you don't seem to understand as part of the requirements.
>
Non-Halting isn't just did reach a final state in some finite number of steps, but that it will NEVER reach a final state even if you process an unbounded number of steps.
>
Would an unbounded emulation of DDD by HHH halt?
>
Not a valid question, as your HHH does not do an unbounded emulation, but aborts after a defined time.
>
>
*Now you are contradicting yourself*
YOU JUST SAID THAT HHH NEED NOT DO AN UNBOUNDED
EMULATION TO PREDICT WHAT AN UNBOUNDED EMULATION WOULD DO.
>
Right. it doesn't NEED to do the operation, just report what an unbounded emulation would do.
>
You asked about an "unbounded emulation of DDD by HHH" but that isn't possible, as HHH doesn't do that.
>
On 11/3/2024 12:20 PM, Richard Damon wrote:
> On 11/3/24 9:39 AM, olcott wrote:
>>
>> The finite string input to HHH specifies that HHH
>> MUST EMULATE ITSELF emulating DDD.
>
> Right, and it must CORRECTLY determine what an unbounded
> emulation of that input would do, even if its own programming
> only lets it emulate a part of that.
>
*You JUST said that HHH does not need to do an unbounded emulation*
*You JUST said that HHH does not need to do an unbounded emulation*
*You JUST said that HHH does not need to do an unbounded emulation*
*You JUST said that HHH does not need to do an unbounded emulation*
Right, it doesn't need to DO the unbounded emulatiohn just figure out what it would do.
Just like we can compute:
1 + 1/2 + 1/4 + 1/8 + ... + 1/2^n + ...
Ether by adding the infinite number of terms, or we can notice something about it to say it will sum, in the infinite limit, to 2.
In the same way, if HHH can see something in its simulation that tells it THIS this program can NEVER halt, it can report it.
That is what it can easily do with your Infinite_Loop program, and with a bit more intelegence with Infinite_Recursion.
It doesn't work with DDD, as if the decider HHH aborts its simulation of DDD, then so will the copy of HHH that DDD called.
Your "logic" of CHANGING HHH, and thus the input, is INVALID, and you claims it is correct is just a LIE (can't be an Honest Mistake, you have been told too many time, at best you can plead incompetence with a reckless disregard for the facts). HHH must look at the HHH that IS THERE, and that is the aborting one, especially if HHH does decide to abort.