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 262,052 of 262,912   
   olcott to Richard Damon   
   Re: The primary first principle of all T   
   20 Dec 25 17:47:06   
   
   XPost: comp.theory, sci.math   
   From: polcott333@gmail.com   
      
   On 12/20/2025 5:34 PM, Richard Damon wrote:   
   > On 12/20/25 6:28 PM, olcott wrote:   
   >> On 12/20/2025 7:32 AM, Richard Damon wrote:   
   >>> On 12/20/25 8:01 AM, Tristan Wibberley wrote:   
   >>>> On 19/12/2025 23:01, olcott wrote:   
   >>>>> Deciders: Transform finite strings by finite string   
   >>>>> transformation rules into {Accept, Reject}.   
   >>>>   
   >>>> I continue to Reject your asymmetric and functionally-loaded labels for   
   >>>> the classes.   
   >>>>   
   >>>>   
   >>>   
   >>> That is just one of the few accurate quotations Olcott makes.   
   >>>   
   >>   
   >> It was not a quotation. I had to piece that together   
   >> myself from numerous sources. It took me 22 years to   
   >> do this.   
   >   
   > Gee, that should be something you could have found in just a few minutes   
   > of searching. It is basic material in Computation Theory in the   
   > introductory material on Deciders.   
   >   
      
   They never ever phrase it exactly that way.   
   Look for yourself.   
      
   > Of course, you just admitted that you don't understand the context of   
   > the statement, so you don't know how to actually use it.   
   >   
   >>   
   >>> In ONE of the version of defining Deciders, they are determinators of   
   >>> sentences matching a defined language, and they are to ACCEPT strings   
   >>> that match that grammar, and REJECT statements that fail to meet the   
   >>> grammar.   
   >>>   
   >>> "Halt Deciders" can be considered to be of that type of deciders,   
   >>> where the grammar defines that a given string represents a finite   
   >>> computation.   
   >>   
   >>   
   >   
      
      
   --   
   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