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,147 of 262,912    |
|    olcott to Richard Damon    |
|    Re: Turing-machine deciders a precise de    |
|    24 Dec 25 13:09:14    |
   
   XPost: comp.theory, sci.math, comp.ai.philosophy   
   From: polcott333@gmail.com   
      
   On 12/24/2025 12:43 PM, Richard Damon wrote:   
   > On 12/24/25 1:41 PM, olcott wrote:   
   >> On 12/24/2025 12:04 PM, Richard Damon wrote:   
   >>> On 12/24/25 12:36 PM, olcott wrote:   
   >>>>   
   >>>> *It does define the scope of what deciders can do*   
   >>>> *It does define the scope of what deciders can do*   
   >>>> *It does define the scope of what deciders can do*   
   >>>> *It does define the scope of what deciders can do*   
   >>>> *It does define the scope of what deciders can do*   
   >>>   
   >>> Ok, but not what they can be asked to do.   
   >>>   
   >>   
   >> When-so-ever whatever they are asked to do is outside   
   >> the scope of what they can do the requirement itself   
   >> is incorrect.   
   >>   
   >   
   > And where do you get that from?   
   >   
   > Your own STUPIDITY.   
   >   
      
   *This defines the scope of computation*   
   A Turing-machine decider is a Turing machine D that   
   computes a total function D: Σ∗ → {Accept,Reject},   
   where Σ∗ is the set of all finite strings over the input   
   alphabet. That is:   
      
   1. Totality: For every finite string input w ∈ Σ∗, D   
   halts and outputs either Accept or Reject.   
      
   *This is semantically entailed from this definition*   
      
   Any requirement that requires more than the above   
   definition can provide is a requirement that is outside   
   of the scope of computation.   
      
   When you have no idea what the term "semantically   
   entailed" means or how it works you cannot understand.   
      
      
   --   
   Copyright 2025 Olcott
|
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca