home bbs files messages ]

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

   sci.logic      Logic -- math, philosophy & computationa      262,912 messages   

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

   Message 261,873 of 262,912   
   olcott to Tristan Wibberley   
   Re: Proof of halting problem category er   
   13 Dec 25 11:36:32   
   
   XPost: comp.theory   
   From: polcott333@gmail.com   
      
   On 12/13/2025 10:59 AM, Tristan Wibberley wrote:   
   > On 13/12/2025 05:10, polcott wrote:   
   >> On 12/12/2025 10:43 PM, Tristan Wibberley wrote:   
   >>> I don't think that's true, a UTM-based halt decider may also use   
   >>> properties of the finite string other than it's nominal contracta.   
   >>>   
   >>   
   >> I have no idea what you are saying.   
   >> There is apparently only one way to determine   
   >> the behavior that the input specifies.   
   >   
   > "contracta" latin plural of "contractum" (I think).   
   >   
   > "contractum" the result of reducing a redex.   
   >   
   > In a reduction system with transitive reduction (all those interesting   
   > wrt to halting problems) a program is a redex of a reduction which has a   
   > contractum that is a redex of a reduction that has a contractum ... so I   
   > say a program has many contracta. I say nominal contracta because a   
   > physical TM won't always do as the assumptions programmed into the   
   > deciding TM stipulate and I feel that gets the point across.   
   >   
   > Simulation (sense of emulation/virtualisation) works by sequentially   
   > enumerating all the contracta.   
   >   
   > Halt-deciding by simulation (sense of emulation/virtualisation) draws   
   > inferences from the contracta, but it may draw inferences from the   
   > initial program that are, at least in part, not contracta of the initial   
   > program.   
   >   
      
   You are using language that is too difficult.   
   Here is the same thing in simpler language.   
      
   The Universal TM's Illusion: The UTM appears to "simulate another   
   machine," but it's really just interpreting a string as a lookup table   
   for state transitions. The simulation is pure string rewriting.   
      
      
   --   
   Copyright 2025 Olcott

              My 28 year goal has been to make
       "true on the basis of meaning expressed in language"
       reliably computable.

              This required establishing a new foundation
              --- 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