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,657 of 59,235    |
|    olcott to Tristan Wibberley    |
|    Re: The correct foundation of the theory    |
|    14 Dec 25 15:28:07    |
      XPost: comp.theory       From: polcott333@gmail.com              On 12/14/2025 3:00 PM, Tristan Wibberley wrote:       > On 14/12/2025 16:16, polcott wrote:       >       >> This is my first principle       >> All Turing machines only compute the mapping       >> from input finite strings to some value.       >       > I maintain that's wrong. it should be "compute only".       >              All Turing machines compute only the mapping       from input finite strings to some value.              Computable functions are the basic objects of study       in computability theory. Informally, a function is       computable if there is an algorithm that computes       the value of the function for every value of its argument.       https://en.wikipedia.org/wiki/Computable_function              Now we tie that to a model of computation:       Turing machines computable functions only compute       the mapping from input finite strings to some value.              *I might just use this as the new first principle*       Turing machine Deciders compute the mapping from       input finite strings to an accept or reject value       by some criterion measure.              > You previously said it means the same either way around but that's not       > true for "only" even if it's true for many adverbs because of a       > syntactic ambiguity due to the many parts of speech "only" can fulfil.       >       > [only compute] [the |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca