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 58,738 of 59,235   
   olcott to Richard Damon   
   Re: D correctly simulated by H proved fo   
   21 Dec 25 18:15:07   
   
   XPost: comp.theory, sci.logic, sci.math   
   From: polcott333@gmail.com   
      
   On 12/21/2025 5:40 PM, Richard Damon wrote:   
   > On 12/21/25 6:19 PM, olcott wrote:   
   >> On 6/12/2024 11:50 AM, olcott wrote:   
   >>>   
   >>> When we compute the mapping from the input to H(D,D) this   
   >>> must apply a set of finite string transformation rules   
   >>> (specified by the semantics of the x86 language) to this input.   
   >>>   
   >>   
   >> The above is my first use applying this term to a halt decider.   
   >>   
   >> My first documented use of the term   
   >> "finite string transformation rules"   
   >> https://groups.google.com/g/comp.theory/c/TFXhleKnHmY/m/lqhDVnvUBgAJ   
   >>   
   >> *This is the basis for my unique definition of a generic decider*   
   >>   
   >> Deciders: Transform finite string inputs by finite   
   >> string transformation rules into {Accept, Reject} values.   
   >>   
   >>   
   >   
   > And is just wrong.   
   >   
   > For instance, a RASP based decider uses no strings, but might use a   
   > numeric representatio of a string.   
   >   
      
   That may be an actual exception yet over-complicates   
   the essence that I need to convey.   
      
   > And in the more generic version of the theory, are not restricted to   
   > just Accepting or Rejecting the input.   
   >   
      
   Decider seems to be limited to deciding.   
      
   > Sorry, you are asking people to confirm things that are not actually   
   > true in the way you think.   
   >   
   > It seems you stumbled upon a partially true statement (true in some   
   > versions of the system) but are focused on a part that is not an actual   
   > basis.   
      
      
   --   
   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