Groups | Search | Server Info | Login | Register

Groups > comp.theory > #139441

Re: is the ct-thesis cooked? PLO

From dart200 <user7160@newsgrouper.org.invalid>
Newsgroups comp.theory, comp.ai.philosophy, comp.software-eng
Subject Re: is the ct-thesis cooked? PLO
Date 2026-01-24 18:05 -0800
Organization A noiseless patient Spider
Message-ID <10l3tok$1a2so$1@dont-email.me> (permalink)
References (2 earlier) <10hcu82$1d9h7$1@solani.org> <dbe9c3aa-42f9-496d-9394-a2d3205f9138@gmail.com> <10jiem1$3j7nf$1@dont-email.me> <10l3j9k$1707n$1@dont-email.me> <9PddR.598533$VY9.545172@fx10.iad>

Cross-posted to 3 groups.

Show all headers | View raw

On 1/24/26 4: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.
> 
> 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.

contexts-aware machines compute functions:

(context,input) -> output

-- 
arising us out of the computing dark ages,
please excuse my pseudo-pyscript,
~ nick

Back to comp.theory | Previous | Next — Previous in thread | Next in thread | Find similar

Thread

Re: is the ct-thesis cooked? PLO olcott <polcott333@gmail.com> - 2026-01-24 17:06 -0600
  Re: is the ct-thesis cooked? PLO Richard Damon <Richard@Damon-Family.org> - 2026-01-24 19:52 -0500
    Re: is the ct-thesis cooked? PLO dart200 <user7160@newsgrouper.org.invalid> - 2026-01-24 18:05 -0800
      Re: is the ct-thesis cooked? PLO Richard Damon <Richard@Damon-Family.org> - 2026-01-25 13:23 -0500
        Re: is the ct-thesis cooked? PLO dart200 <user7160@newsgrouper.org.invalid> - 2026-01-25 13:04 -0800
          Re: is the ct-thesis cooked? PLO Richard Damon <Richard@Damon-Family.org> - 2026-01-25 17:40 -0500
            Re: is the ct-thesis cooked? PLO dart200 <user7160@newsgrouper.org.invalid> - 2026-01-25 22:50 -0800
              Re: is the ct-thesis cooked? PLO dart200 <user7160@newsgrouper.org.invalid> - 2026-01-26 01:35 -0800
              Re: is the ct-thesis cooked? PLO Richard Damon <Richard@Damon-Family.org> - 2026-01-26 11:43 -0500
                Re: is the ct-thesis cooked? PLO dart200 <user7160@newsgrouper.org.invalid> - 2026-01-26 11:45 -0800
                Re: is the ct-thesis cooked? PLO Richard Damon <Richard@Damon-Family.org> - 2026-01-26 17:28 -0500
                Re: is the ct-thesis cooked? PLO dart200 <user7160@newsgrouper.org.invalid> - 2026-01-27 00:00 -0800
    Re: is the ct-thesis cooked? PLO olcott <polcott333@gmail.com> - 2026-01-24 20:35 -0600
      Re: is the ct-thesis cooked? PLO dart200 <user7160@newsgrouper.org.invalid> - 2026-01-24 18:38 -0800
        Re: is the ct-thesis cooked? PLO olcott <polcott333@gmail.com> - 2026-01-24 20:53 -0600
          Re: is the ct-thesis cooked? PLO dart200 <user7160@newsgrouper.org.invalid> - 2026-01-24 19:12 -0800
            Re: is the ct-thesis cooked? PLO olcott <polcott333@gmail.com> - 2026-01-24 21:42 -0600
              Re: is the ct-thesis cooked? PLO dart200 <user7160@newsgrouper.org.invalid> - 2026-01-24 20:03 -0800
                Re: is the ct-thesis cooked? PLO olcott <polcott333@gmail.com> - 2026-01-24 22:06 -0600
                Re: is the ct-thesis cooked? PLO dart200 <user7160@newsgrouper.org.invalid> - 2026-01-24 21:45 -0800

csiph-web