home bbs files messages ]

Forums before death by AOL, social media and spammers... "We can't have nice things"

   comp.ai.philosophy      Perhaps we should ask SkyNet about this      59,235 messages   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]

   Message 57,760 of 59,235   
   olcott to Richard Damon   
   Re: Proof that DDD is correctly emulated   
   01 Aug 25 17:54:03   
   
   XPost: comp.theory, sci.logic   
   From: polcott333@gmail.com   
      
   On 8/1/2025 5:45 PM, Richard Damon wrote:   
   > On 8/1/25 6:22 PM, olcott wrote:   
   >> On 8/1/2025 5:01 PM, Richard Damon wrote:   
   >>> On 8/1/25 5:47 PM, olcott wrote:   
   >>>> On 8/1/2025 4:30 PM, Richard Damon wrote:   
   >>>>> On 8/1/25 5:08 PM, olcott wrote:   
   >>>>>> On 8/1/2025 3:48 PM, Richard Damon wrote:   
   >>>>>>> On 8/1/25 4:33 PM, olcott wrote:   
   >>>>>>>>   
   >>>>>>>> In other words neither Ĥ nor any human being   
   >>>>>>>> could possibly see the repeating sequence even   
   >>>>>>>> after it has repeated 100 million times?   
   >>>>>>>>   
   >>>>>>>   
   >>>>>>> Doesn't matter if is can determine what will happen, to correctly   
   >>>>>>> simulate the behavior, you have to do it.   
   >>>>>>>   
   >>>>>>   
   >>>>>> It seems that even after hundreds of corrections   
   >>>>>> you still do not understand that this infinite   
   >>>>>> sequence can be correctly detected in finite steps.   
   >>>>>>   
   >>>>>   
   >>>>> And you don't get that BY detecting that pattern, and putting that   
   >>>>> code into HHH, you put it into the code of the DDD that you are   
   >>>>> simulating, and it is no longer a non-halting pattern. It is only a   
   >>>>> non-hatling pattern if the HHH in the pattern will never abort its   
   >>>>> simulation.   
   >>>>>   
   >>>>   
   >>>> When you intentionally define halting as stops running   
   >>>> for any reason this would be correct.   
   >>>   
   >>> But I don't, as the only way that the PROGRAM/MACHINE CAN "stop   
   >>> running" is by reaching a final state.   
   >>>   
   >>> You can't "abort" or "shut down" a machine, only a simulation of it.   
   >>>   
   >>   
   >> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.∞   
   >> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn   
   >> (a) Ĥ copies its input ⟨Ĥ⟩   
   >> (b) Ĥ invokes embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩   
   >> (c) embedded_H simulates ⟨Ĥ⟩ ⟨Ĥ⟩   
   >>   
   >> Thus unless you want to be disagreeable at all   
   >> possible costs you would agree that ⟨Ĥ⟩ ⟨Ĥ⟩   
   >> simulated by embedded_H cannot possibly reach   
   >> its own simulated final state of ⟨Ĥ.qn⟩ no   
   >> matter what.   
   >>   
   >   
   > Which doesn't matter, dispite you wanting to focus on it.   
   >   
      
   ⟨Ĥ⟩ ⟨Ĥ⟩ simulated by embedded_H determines the   
   behavior that *THE ACTUAL INPUT* to embedded_H   
   specifies. Ĥ ⟨Ĥ⟩ is not and cannot possibly be   
   *AN ACTUAL INPUT* to embedded_H so its differing   
   behavior *DOES NOT COUNT*.   
      
   --   
   Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius   
   hits a target no one else can see." Arthur Schopenhauer   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]


(c) 1994,  bbs@darkrealms.ca