Sujet : Re: Flat out dishonest or totally ignorant? Can ADD be this severe?
De : richard (at) *nospam* damon-family.org (Richard Damon)
Groupes : comp.theory sci.logicDate : 04. Jul 2024, 03:17:59
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <1f019b9b9aa0948c049e3351a0970975d83e8bbb@i2pn2.org>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13
User-Agent : Mozilla Thunderbird
On 7/3/24 8:40 PM, olcott wrote:
On 7/3/2024 6:18 PM, Richard Damon wrote:
On 7/3/24 10:19 AM, olcott wrote:
On 7/3/2024 9:11 AM, joes wrote:
Am Tue, 02 Jul 2024 22:55:12 -0500 schrieb olcott:
On 7/2/2024 10:50 PM, joes wrote:
Am Tue, 02 Jul 2024 14:46:38 -0500 schrieb olcott:
On 7/2/2024 2:17 PM, Fred. Zwarts wrote:
Op 02.jul.2024 om 21:00 schreef olcott:
On 7/2/2024 1:42 PM, Fred. Zwarts wrote:
Op 02.jul.2024 om 14:22 schreef olcott:
On 7/2/2024 3:22 AM, Fred. Zwarts wrote:
Op 02.jul.2024 om 03:25 schreef olcott:
>
HHH repeats the process twice and aborts too soon.
>
DDD is correctly emulated by any HHH that can exist which calls this
emulated HHH(DDD) to repeat the process until aborted (which may be
never).
Whatever HHH does, it does not run forever but aborts.
>
HHH halts on input DDD.
DDD correctly simulated by HHH cannot possibly halt.
WTF? It only calls HHH, which you just said halts.
>
>
An aborted simulation does not count as halting.
>
And doesn't show non-halting either.
>
Reaching it own machine address 00002183 counts as halting.
DDD correctly simulated by HHH cannot possibly do that.
>
But HHH doesn't DO a "Correct Simulation" that can show that, it only does a PARTIAL simulation.
>
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
If simulating halt decider H correctly simulates its input D
until H correctly determines that its simulated D would never
stop running unless aborted then
H can abort its simulation of D and correctly report that D
specifies a non-halting sequence of configurations.
</MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
until H correctly determines
until H correctly determines
until H correctly determines
until H correctly determines
until H correctly determines
until H correctly determines
until H correctly determines
Which it doesn't.
THUS STIPULATING THAT A PARTIAL SIMULATION IS CORRECT
THUS STIPULATING THAT A PARTIAL SIMULATION IS CORRECT
THUS STIPULATING THAT A PARTIAL SIMULATION IS CORRECT
THUS STIPULATING THAT A PARTIAL SIMULATION IS CORRECT
THUS STIPULATING THAT A PARTIAL SIMULATION IS CORRECT
THUS STIPULATING THAT A PARTIAL SIMULATION IS CORRECT
THUS STIPULATING THAT A PARTIAL SIMULATION IS CORRECT
Nope, just double talk.
H never CORRECTLY determined that a CORRECT SIMULATION (which means one that matchs the behavior of the machine represented by the input) would never halt, sinc ehta tmachine halts.
You can't argue that H has correctly determined it did something it never did,
You laid a perfect trap for yourself in your words, and you fell into it,
You would be an absolute genius if you had an IQ of 250. But since you don't you aren't.
Or, Trump would be president right now if he had gotten the most votes. He didn't so he isn't.
If H can correctly determine that H did something right that it never does, is a similar false premise.