Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.theory > #130647

Re: on deciding the undecidable

From "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com>
Newsgroups comp.theory
Subject Re: on deciding the undecidable
Date 2025-09-27 12:55 -0700
Organization A noiseless patient Spider
Message-ID <10b9ffi$1td8f$3@dont-email.me> (permalink)
References (1 earlier) <10b8bl4$1jvqb$1@dont-email.me> <10b92dq$1q5tr$1@dont-email.me> <10b92j3$1q69b$1@dont-email.me> <20250927095044.599@kylheku.com> <10b9f5g$1tpeq$2@dont-email.me>

Show all headers | View raw

On 9/27/2025 12:50 PM, dart200 wrote:
> On 9/27/25 9:51 AM, Kaz Kylheku wrote:
>> On 2025-09-27, olcott <polcott333@gmail.com> wrote:
>>> On 9/27/2025 11:12 AM, dart200 wrote:
>>>> On 9/27/25 2:44 AM, Mikko wrote:
>>>>> On 2025-09-18 21:30:00 +0000, dart200 said:
>>>>>
>>>>>> so what is my resolution? *context-sensitive deciders* you can 
>>>>>> formulate
>>>>>> this via either 3-value or a pair of 2 value deciders, but you need
>>>>>> context-sensitivity in both to deal with paradoxical input 
>>>>>> machines, and
>>>>>> still remain able to convey the truth of the matter where such truth
>>>>>> actually remains relevant.
>>>>>
>>>>> The halting problem for Turing machines requires that the decider is
>>>>> a Turing machine. A Truing machine is not sensitive to its context.
>>>>> Therefore the above "resolution" is not applicable to the halting
>>>>> problem of Turing machines.
>>>>>
>>>>
>>>> but it does trivialize it:
>>>>
>>>> RTMs can compute anything a TM can compute, but RTMs also avoid 
>>>> decision
>>>> paradoxes, opening up the possibility of general deciders on non- 
>>>> trivial
>>>> semantics.
>>>>
>>>
>>> That might not be Turing computable or it will
>>> be Turing computable through a special interface.
>>
>> Well, yes: a magic "let's send a message to the demi-oracle in the RTM
>> world and get an answer" interface.
>>
> 
> polcott doesn't speak for my resolution. there's no reason full 
> reflection can't solve this because knowing the full state of the 
> machine allows you to predict it to the point of potential contradiction.
> 

Even here? Read all:

https://groups.google.com/g/comp.lang.c++/c/7u_rLgQe86k/m/fYU9SnuAFQAJ

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

Thread

Re: on deciding the undecidable Mikko <mikko.levanto@iki.fi> - 2025-09-27 12:44 +0300
  Re: on deciding the undecidable dart200 <user7160@newsgrouper.org.invalid> - 2025-09-27 12:50 -0700
    Re: on deciding the undecidable "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-09-27 12:55 -0700
  Re: on deciding the undecidable olcott <polcott333@gmail.com> - 2025-09-27 12:19 -0500
  Re: on deciding the undecidable dart200 <user7160@newsgrouper.org.invalid> - 2025-09-27 09:12 -0700
    Re: on deciding the undecidable olcott <polcott333@gmail.com> - 2025-09-27 11:15 -0500
      Re: on deciding the undecidable olcott <polcott333@gmail.com> - 2025-09-27 11:39 -0500
        Re: on deciding the undecidable dart200 <user7160@newsgrouper.org.invalid> - 2025-09-27 10:13 -0700
      Re: on deciding the undecidable Kaz Kylheku <643-408-1753@kylheku.com> - 2025-09-27 16:51 +0000
        Re: on deciding the undecidable "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-09-27 12:36 -0700
      Re: on deciding the undecidable dart200 <user7160@newsgrouper.org.invalid> - 2025-09-27 09:32 -0700
  Re: on deciding the undecidable olcott <polcott333@gmail.com> - 2025-09-27 13:58 -0500
    Re: on deciding the undecidable Richard Damon <Richard@Damon-Family.org> - 2025-09-28 20:18 -0400
  Re: on deciding the undecidable olcott <polcott333@gmail.com> - 2025-09-27 10:36 -0500
    Re: on deciding the undecidable Kaz Kylheku <643-408-1753@kylheku.com> - 2025-09-27 16:50 +0000
    Re: on deciding the undecidable Mikko <mikko.levanto@iki.fi> - 2025-09-28 11:49 +0300
      Re: on deciding the undecidable sion F2 <sionf2@drum.cc> - 2025-09-28 06:30 -0500
      Re: on deciding the undecidable olcott <polcott333@gmail.com> - 2025-09-28 09:19 -0500
        Re: on deciding the undecidable Mikko <mikko.levanto@iki.fi> - 2025-09-29 12:26 +0300
          Re: on deciding the undecidable olcott <polcott333@gmail.com> - 2025-09-29 10:25 -0500
            Re: on deciding the undecidable Kaz Kylheku <643-408-1753@kylheku.com> - 2025-09-29 16:55 +0000
              Re: on deciding the undecidable olcott <polcott333@gmail.com> - 2025-09-29 13:12 -0500
                Re: on deciding the undecidable Richard Damon <Richard@Damon-Family.org> - 2025-09-29 22:32 -0400
            Re: on deciding the undecidable Richard Damon <Richard@Damon-Family.org> - 2025-09-29 22:32 -0400
            Re: on deciding the undecidable Mikko <mikko.levanto@iki.fi> - 2025-09-30 13:31 +0300
              Re: on deciding the undecidable olcott <polcott333@gmail.com> - 2025-09-30 12:56 -0500
                Re: on deciding the undecidable Mikko <mikko.levanto@iki.fi> - 2025-10-01 11:36 +0300
                Re: on deciding the undecidable Olcott's paradigm shift olcott <polcott333@gmail.com> - 2025-10-01 08:24 -0500
                Re: on deciding the undecidable Olcott's paradigm shift "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-10-01 22:16 -0700
                Re: on deciding the undecidable Olcott's paradigm shift Mikko <mikko.levanto@iki.fi> - 2025-10-02 11:39 +0300
    Re: on deciding the undecidable Richard Damon <Richard@Damon-Family.org> - 2025-09-28 20:18 -0400

csiph-web