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,152 of 262,912    |
|    olcott to Richard Damon    |
|    Re: The scope of computation defines its    |
|    24 Dec 25 14:11:47    |
   
   XPost: comp.theory, sci.math, comp.ai.philosophy   
   From: polcott333@gmail.com   
      
   On 12/24/2025 1:28 PM, Richard Damon wrote:   
   > On 12/24/25 2:20 PM, olcott wrote:   
   >> *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.   
   >>   
   >   
   > FALSE, proving you don't understand the meaning of "Scope".   
   >   
      
   Instead of spouting off dogma any idiot can do   
   that, you define what you think that the term   
   "scope of computation" actually means.   
      
   This is what Google AI said.   
   The "scope of computation" refers to the range   
   and limits of what can be solved or processed   
   using algorithms and computational methods.   
      
   That is what I mean. What do you mean?   
      
   --   
   Copyright 2025 Olcott
|
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca