Liste des Groupes | Revenir à theory |
On 8/16/24 1:11 PM, olcott wrote:I think that you are just twisting my words again.On 8/16/2024 11:47 AM, joes wrote:Right, but the unlimited emulation of the DDD that calls the HHH that says non-halting will reach a final state.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.
>
Les messages affichés proviennent d'usenet.