Liste des Groupes | Revenir à theory |
On 8/16/2024 2:23 PM, Richard Damon wrote:Because we can form a proof that show it.On 8/16/24 2:57 PM, olcott wrote:How do we know there is no greatest prime?On 8/16/2024 1:49 PM, Richard Damon wrote:>On 8/16/24 2:04 PM, olcott wrote:>On 8/16/2024 12:54 PM, Richard Damon wrote:>On 8/16/24 1:11 PM, olcott wrote:>On 8/16/2024 11:47 AM, joes wrote:>Am Fri, 16 Aug 2024 10:07:08 -0500 schrieb olcott:>On 8/16/2024 9:59 AM, joes wrote:>Am Fri, 16 Aug 2024 09:42:13 -0500 schrieb olcott:On 8/16/2024 9:28 AM, Richard Damon wrote:>On 8/16/24 10:09 AM, olcott wrote:On 8/16/2024 8:34 AM, Mikko wrote:On 2024-08-16 12:02:00 +0000, olcott said:Yes, because DDD is defined to call its simulator. If you change theNot at all. never has.Unless an unlimited emulation of DDD by HHH can reach the "return"But that also construes that HHH is a program that DOES an unlimited
instruction of DDD it is construed that this instance of DDD never
halts.
emulation of DDD, and thus isn't a decider
simulator to abort, you also change the simulated HHH. Nobody cares
about HHH aborting a pure simulator.Yes, an unlimited simulation of an aborting HHH.NOT AT ALL, NEVER HAS.HHH must predict what the behavior of an unlimited simulation wouldThe HHH that aborts must predict what DDD calling an aborting HHH does
be.
PREDICT WHAT THE BEHAVIOR WOULD BE
IF IT WAS AN UNLIMITED EMULATION
Prediction of behavior of unlimited emulation
means prediction of behavior that never aborts.
>
Right, but the unlimited emulation of the DDD that calls the HHH that says non-halting will reach a final state.
>
I think that you are just twisting my words again.
>
_DDD()
[00002172] 55 push ebp ; housekeeping
[00002173] 8bec mov ebp,esp ; housekeeping
[00002175] 6872210000 push 00002172 ; push DDD
[0000217a] e853f4ffff call 000015d2 ; call HHH(DDD)
[0000217f] 83c404 add esp,+04
[00002182] 5d pop ebp
[00002183] c3 ret
Size in bytes:(0018) [00002183]
>
The unlimited emulation of DDD by HHH never stops running.
>
>
IF you are going to change an define that *THE* HHH is just a program that does unlimited emulation, than it fails to give the answer that the input is non-halting.
>
HHH correctly predicts...
HHH correctly predicts...
HHH correctly predicts...
HHH correctly predicts...
HHH correctly predicts...
>
I will get the another piece of this sentence
after you fully understand this first piece.
>
How can HHH correctly predict something that won't happen?
>
Les messages affichés proviennent d'usenet.