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

Groups > comp.theory > #106268

Re: The error of the halting problem --- G is untrue in PA

Cross-posted to 2 groups.

Show all headers | View raw

On 6/4/24 1:45 PM, olcott wrote:
> On 6/4/2024 3:29 AM, joes wrote:
>> Am Mon, 03 Jun 2024 21:58:06 -0500 schrieb olcott:
>>> On 6/3/2024 9:47 PM, Richard Damon wrote:
>>>> On 6/3/24 10:32 PM, olcott wrote:
>>>>> On 6/3/2024 9:26 PM, Richard Damon wrote:
>>>>>> On 6/3/24 10:14 PM, olcott wrote:
>>>>>>> On 6/3/2024 8:58 PM, Richard Damon wrote:
>>>>>>>> On 6/3/24 9:51 PM, olcott wrote:
>>>>>>>>>
>>>>>>>>> When H is asked a yes/no question where both answers are
>>>>>>>>> contradicted by its input *IT IS A FREAKING RIGGED GAME*
>>>>>>>>
>>>>>>>> But both answers aren't wrong. Remember, the question is built to
>>>>>>>> make a SPECIFIC decider wrong, and by its algorithm, it will give a
>>>>>>>> SPECIFIC answer to each SPECIFIC question.
>>>>>>>>
>>>>>>> You can't get away with that head game by pretending to not
>>>>>>> understand what infinite an set of H/D pairs is.
>>>>>>
>>>>>> But it doesn't matter.
>>>>>>
>>>>> It matters enormously. Once we fully understand that the limits of
>>>>> computation were always a ruse then we can give computation the
>>>>> priority that it truly deserves. It might be the life on earth is
>>>>> killed off because we did not build a semantic lie detector quickly
>>>>> enough.
>>>>
>>>> But you are working on it wrong, because you just don't understand the
>>>> actual nature of truth.
>>>
>>> Every expression X that is true on the basis of its meaning can be
>>> proven untrue by a lack of a connection to the meaning that makes it
>>> true. *You have understood this better than anyone else*
>> No. "true expressions can be proven untrue"? There are true but 
>> unprovable
>> sentences (see Gödel).
>>
> 
> G cannot be linked by truth preserving operations to expressions of 
> language in PA that show that G is true in PA.

But it CAN.

Each natural number can be checked in a finite time against the 
primative recursive relationship, to see that it does not satisfy that 
relationship.

We can check EVERY SINGLE NUMBER, in a countable infinite number of 
steps, and thus establish that G, the statement that no natural number 
satisfies that relationship, is in fact true.

Your problem is you just don't understand what the statement G in PA 
actually is, because the math is just beyond you, so you replace it with 
something that isn't the same thing but can be shown to express things 
about the nature and implications of G.

So, your arguement is just proved to be a LIE, as most of your assertions.

> 
> G can be linked by truth preserving operations to expressions of 
> language in meta-math that show that G is true in meta-math.

Yes, and in the meta-math, we have a short cut, that actually allows us 
to PROVE the statement, not just have it established by an infinite 
number of steps.

> 
>>> When D is defined to contradict both values that H returns then D is not
>>> a truth bearer in H in the same way that the Liar Paradox "This sentence
>>> is not true" is not a truth bearer in English.
>>
> 

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

Thread

The error of the halting problem olcott <polcott333@gmail.com> - 2024-06-03 15:53 -0500
  Re: The error of the halting problem Richard Damon <richard@damon-family.org> - 2024-06-03 20:55 -0400
    Re: The error of the halting problem olcott <polcott333@gmail.com> - 2024-06-03 19:59 -0500
      Re: The error of the halting problem Richard Damon <richard@damon-family.org> - 2024-06-03 21:44 -0400
        Re: The error of the halting problem olcott <polcott333@gmail.com> - 2024-06-03 20:51 -0500
          Re: The error of the halting problem Richard Damon <richard@damon-family.org> - 2024-06-03 21:58 -0400
            Re: The error of the halting problem olcott <polcott333@gmail.com> - 2024-06-03 21:14 -0500
              Re: The error of the halting problem Richard Damon <richard@damon-family.org> - 2024-06-03 22:26 -0400
                Re: The error of the halting problem olcott <polcott333@gmail.com> - 2024-06-03 21:32 -0500
                Re: The error of the halting problem Richard Damon <richard@damon-family.org> - 2024-06-03 22:47 -0400
                Re: The error of the halting problem olcott <polcott333@gmail.com> - 2024-06-03 21:58 -0500
                Re: The error of the halting problem Richard Damon <richard@damon-family.org> - 2024-06-03 23:11 -0400
                Re: The error of the halting problem joes <noreply@example.com> - 2024-06-04 08:29 +0000
                Re: The error of the halting problem --- G is untrue in PA olcott <polcott333@gmail.com> - 2024-06-04 12:45 -0500
                Re: The error of the halting problem --- G is untrue in PA Richard Damon <richard@damon-family.org> - 2024-06-04 21:48 -0400
                Re: The error of the halting problem Mikko <mikko.levanto@iki.fi> - 2024-06-04 12:24 +0300
              Re: The error of the halting problem joes <noreply@example.com> - 2024-06-04 08:27 +0000
      Re: The error of the halting problem Mikko <mikko.levanto@iki.fi> - 2024-06-04 11:09 +0300
  Re: The error of the halting problem Mikko <mikko.levanto@iki.fi> - 2024-06-04 11:00 +0300
    Re: The error of the halting problem olcott <polcott333@gmail.com> - 2024-06-04 12:28 -0500
      Re: The error of the halting problem Richard Damon <richard@damon-family.org> - 2024-06-04 21:48 -0400

csiph-web