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 59,196 of 59,235    |
|    olcott to All    |
|    Re: is the ct-thesis cooked? PLO    |
|    24 Jan 26 20:53:34    |
      XPost: comp.theory, comp.software-eng       From: polcott333@gmail.com              On 1/24/2026 8:38 PM, dart200 wrote:       > On 1/24/26 6:35 PM, olcott wrote:       >> On 1/24/2026 6:52 PM, Richard Damon wrote:       >>> On 1/24/26 6:06 PM, olcott wrote:       >>>> On 1/6/2026 1:47 AM, dart200 wrote:       >>>       >>>>> the CT-thesis is a thesis, not a proof.       >>>> *I think that I fixed that*       >>>> It seems to me that if something cannot be computed       >>>> by applying finite string transformation rules to       >>>> input finite strings then it cannot be computed.       >>>>       >>>> As soon as this is shown to be categorically impossible       >>>> then the thesis turns into a proof.       >>>>       >>>       >>> In other words, you just don't know what you are talking about.       >>>       >>       >> It is categorically impossible to define a       >> computation more powerful than that above.       >       > i mean turing machines are just a method to specify string       > transformations on the tape ???       >       > they are primarily defined by a large transition table for what       > operation is done based on the state of the machine...       >              No if you look at the Chomsky Hierarchy       they are much more powerful than finite       state machines.              https://en.wikipedia.org/wiki/Chomsky_hierarchy              >>       >>> The fact that it is impossible to build a computation that, given a       >>> representation of another computation and its input, determine for       >>> all cases if the computation will halt does nothing to further the       >>> question of are Turing Machines the most powerful form of computation.       >>       >>       >       >                     --       Copyright 2026 Olcott |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca