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


Groups > comp.theory > #35432 > unrolled thread

Why don't I simply submit my paper to an academic journal for review?

Started byolcott <NoOne@NoWhere.com>
First post2021-06-27 18:05 -0500
Last post2021-07-02 11:09 -0500
Articles 20 on this page of 145 — 14 participants

Back to article view | Back to comp.theory


Contents

  Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-27 18:05 -0500
    Re: Why don't I simply submit my paper to an academic journal for review? Richard Damon <Richard@Damon-Family.org> - 2021-06-27 20:08 -0400
      Re: Why don't I simply submit my paper to an academic journal for review? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-27 17:15 -0700
      Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-27 19:16 -0500
        Re: Why don't I simply submit my paper to an academic journal for review? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-27 17:17 -0700
        Re: Why don't I simply submit my paper to an academic journal for review? Richard Damon <Richard@Damon-Family.org> - 2021-06-27 20:46 -0400
          Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-27 19:54 -0500
            Re: Why don't I simply submit my paper to an academic journal for review? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-27 18:03 -0700
              Re: Why don't I simply submit my paper to an academic journal for review? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-27 18:09 -0700
            Re: Why don't I simply submit my paper to an academic journal for review? Richard Damon <Richard@Damon-Family.org> - 2021-06-27 21:06 -0400
              Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-27 20:24 -0500
                Re: Why don't I simply submit my paper to an academic journal for review? Richard Damon <Richard@Damon-Family.org> - 2021-06-27 22:12 -0400
                  Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-27 22:09 -0500
                    Re: Why don't I simply submit my paper to an academic journal for review? Richard Damon <Richard@Damon-Family.org> - 2021-06-28 07:42 -0400
                      Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-28 08:38 -0500
                        Re: Why don't I simply submit my paper to an academic journal for review? André G. Isaak <agisaak@gm.invalid> - 2021-06-28 08:44 -0600
                          Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-28 10:07 -0500
                            Re: Why don't I simply submit my paper to an academic journal for review? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-28 08:26 -0700
                              Re: Why don't I simply submit my paper to an academic journal for review? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-28 08:49 -0700
                                walmart olcott <NoOne@NoWhere.com> - 2021-06-28 10:53 -0500
                            Re: Why don't I simply submit my paper to an academic journal for review? André G. Isaak <agisaak@gm.invalid> - 2021-06-28 10:23 -0600
                        Re: Why don't I simply submit my paper to an academic journal for review? Richard Damon <Richard@Damon-Family.org> - 2021-06-28 19:25 -0400
                Re: Why don't I simply submit my paper to an academic journal for review? "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-06-27 21:09 -0700
                  Re: Why don't I simply submit my paper to an academic journal for review? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-27 22:17 -0700
                    Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-28 08:34 -0500
                  Re: Why don't I simply submit my paper to an academic journal for review? Richard Damon <Richard@Damon-Family.org> - 2021-06-28 07:48 -0400
                    Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-28 08:41 -0500
                      Re: Why don't I simply submit my paper to an academic journal for review? André G. Isaak <agisaak@gm.invalid> - 2021-06-28 08:40 -0600
                        Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-28 09:59 -0500
                          Re: Why don't I simply submit my paper to an academic journal for review? André G. Isaak <agisaak@gm.invalid> - 2021-06-28 10:16 -0600
                      Re: Why don't I simply submit my paper to an academic journal for review? Richard Damon <Richard@Damon-Family.org> - 2021-06-28 19:10 -0400
            Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-27 20:08 -0500
              Re: Why don't I simply submit my paper to an academic journal for review? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-27 18:10 -0700
                Re: Why don't I simply submit my paper to an academic journal for review? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-27 18:13 -0700
      Re: Why don't I simply submit my paper to an academic journal for review? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-27 17:16 -0700
    Re: Why don't I simply submit my paper to an academic journal for review? David Brown <david.brown@hesbynett.no> - 2021-06-28 08:48 +0200
      Re: Why don't I simply submit my paper to an academic journal for review? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-28 00:17 -0700
      Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-28 08:30 -0500
        Re: Why don't I simply submit my paper to an academic journal for review? David Brown <david.brown@hesbynett.no> - 2021-06-28 18:09 +0200
          Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-28 11:35 -0500
            Re: Why don't I simply submit my paper to an academic journal for review? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-28 09:40 -0700
            Re: Why don't I simply submit my paper to an academic journal for review? Richard Damon <Richard@Damon-Family.org> - 2021-06-28 19:19 -0400
              Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-29 18:14 -0500
                Re: Why don't I simply submit my paper to an academic journal for review? Richard Damon <Richard@Damon-Family.org> - 2021-06-30 22:09 -0400
                  Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-30 22:23 -0500
                    Re: Why don't I simply submit my paper to an academic journal for review? "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-06-30 20:53 -0700
                      Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-30 23:01 -0500
                        Re: Why don't I simply submit my paper to an academic journal for review? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-30 23:31 -0700
                    Re: Why don't I simply submit my paper to an academic journal for review? Richard Damon <Richard@Damon-Family.org> - 2021-07-01 07:08 -0400
                      Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] olcott <NoOne@NoWhere.com> - 2021-07-01 10:41 -0500
                        Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-07-01 21:23 +0100
                          Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] olcott <NoOne@NoWhere.com> - 2021-07-01 16:25 -0500
                            Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] olcott <NoOne@NoWhere.com> - 2021-07-01 16:42 -0500
                              Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-07-02 00:24 +0100
                                Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] olcott <NoOne@NoWhere.com> - 2021-07-01 18:37 -0500
                                  Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-07-02 02:52 +0100
                                    Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] olcott <NoOne@NoWhere.com> - 2021-07-01 21:23 -0500
                                      Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-07-02 20:02 +0100
                                        Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] olcott <NoOne@NoWhere.com> - 2021-07-02 14:27 -0500
                                          Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-07-02 23:16 +0100
                                            Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] olcott <NoOne@NoWhere.com> - 2021-07-02 17:39 -0500
                                    Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] David Brown <david.brown@hesbynett.no> - 2021-07-02 08:58 +0200
                                      Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] Andy Walker <anw@cuboid.co.uk> - 2021-07-02 11:28 +0100
                                        Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] Richard Damon <Richard@Damon-Family.org> - 2021-07-02 07:04 -0400
                                        Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] olcott <NoOne@NoWhere.com> - 2021-07-02 09:10 -0500
                                      Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-07-02 11:32 +0100
                                        Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] olcott <NoOne@NoWhere.com> - 2021-07-02 09:22 -0500
                                      Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] olcott <NoOne@NoWhere.com> - 2021-07-02 09:29 -0500
                            Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] Richard Damon <Richard@Damon-Family.org> - 2021-07-01 19:19 -0400
          Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-28 12:40 -0500
            Re: Why don't I simply submit my paper to an academic journal for review? Alan Mackenzie <acm@muc.de> - 2021-06-28 17:54 +0000
              Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-28 13:08 -0500
            Re: Why don't I simply submit my paper to an academic journal for review? Richard Damon <Richard@Damon-Family.org> - 2021-06-28 19:55 -0400
              Re: Why don't I simply submit my paper to an academic journal for review? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-28 17:57 -0700
              Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-28 22:02 -0500
        Re: Why don't I simply submit my paper to an academic journal for review? Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-06-28 17:29 +0100
          Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-28 11:42 -0500
            Re: Why don't I simply submit my paper to an academic journal for review? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-28 09:46 -0700
            Re: Why don't I simply submit my paper to an academic journal for review? David Brown <david.brown@hesbynett.no> - 2021-06-28 20:03 +0200
              Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-28 13:29 -0500
                Re: Why don't I simply submit my paper to an academic journal for review? David Brown <david.brown@hesbynett.no> - 2021-06-28 21:52 +0200
                  Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-28 15:21 -0500
                    Re: Why don't I simply submit my paper to an academic journal for review? David Brown <david.brown@hesbynett.no> - 2021-06-29 00:07 +0200
                      Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-28 17:28 -0500
                      Re: Why don't I simply submit my paper to an academic journal for review? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-29 00:14 +0100
                        Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-28 18:32 -0500
          Re: Why don't I simply submit my paper to an academic journal for review? Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-06-28 11:01 -0700
            Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-28 13:06 -0500
              Re: Why don't I simply submit my paper to an academic journal for review? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-28 13:56 -0700
                Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-28 16:08 -0500
                  Re: Why don't I simply submit my paper to an academic journal for review? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-28 14:41 -0700
                Re: Why don't I simply submit my paper to an academic journal for review? David Brown <david.brown@hesbynett.no> - 2021-06-29 08:21 +0200
                  Re: Why don't I simply submit my paper to an academic journal for review? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-29 01:21 -0700
                    Re: Why don't I simply submit my paper to an academic journal for review? Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-06-29 02:39 -0700
                      Re: Why don't I simply submit my paper to an academic journal for review? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-29 11:25 -0700
        Re: Why don't I simply submit my paper to an academic journal for review? Richard Damon <Richard@Damon-Family.org> - 2021-06-28 19:14 -0400
          Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-29 18:09 -0500
            Re: Why don't I simply submit my paper to an academic journal for review? wij <wyniijj@gmail.com> - 2021-06-29 23:40 -0700
              The Psychology of Self-Reference Daryl McCullough Jun 25, 2004, olcott <NoOne@NoWhere.com> - 2021-06-30 09:00 -0500
                Re: The Psychology of Self-Reference Daryl McCullough Jun 25, 2004, wij <wyniijj@gmail.com> - 2021-06-30 17:04 -0700
                  Re: The Psychology of Self-Reference Daryl McCullough Jun 25, 2004, olcott <NoOne@NoWhere.com> - 2021-06-30 20:47 -0500
                    Re: The Psychology of Self-Reference Daryl McCullough Jun 25, 2004, Richard Damon <Richard@Damon-Family.org> - 2021-06-30 22:16 -0400
    Re: Why don't I simply submit my paper to an academic journal for review? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-29 16:28 -0700
      Re: Why don't I simply submit my paper to an academic journal for review? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-29 21:52 -0700
    Re: Why don't I simply submit my paper to an academic journal for review? Peter <peterxpercival@hotmail.com> - 2021-06-30 17:01 +0100
      Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-06-30 12:15 -0500
        Re: Why don't I simply submit my paper to an academic journal for review? Richard Damon <Richard@Damon-Family.org> - 2021-06-30 22:34 -0400
          Re: Why don't I simply submit my paper to an academic journal for review? Andy Walker <anw@cuboid.co.uk> - 2021-07-01 12:44 +0100
            Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-07-01 09:27 -0500
            Re: Why don't I simply submit my paper to an academic journal for review? Richard Damon <Richard@Damon-Family.org> - 2021-07-01 23:12 -0400
              Re: Why don't I simply submit my paper to an academic journal for review? David Brown <david.brown@hesbynett.no> - 2021-07-02 09:16 +0200
                Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-07-02 09:36 -0500
              Re: Why don't I simply submit my paper to an academic journal for review? Andy Walker <anw@cuboid.co.uk> - 2021-07-03 00:32 +0100
                Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-07-02 18:37 -0500
        Re: Why don't I simply submit my paper to an academic journal for review? David Brown <david.brown@hesbynett.no> - 2021-07-01 10:38 +0200
          Re: Why don't I simply submit my paper to an academic journal for review? David Brown <david.brown@hesbynett.no> - 2021-07-01 10:40 +0200
          Re: Why don't I simply submit my paper to an academic journal for review? Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-07-01 02:51 -0700
            Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-07-01 09:10 -0500
              Re: Why don't I simply submit my paper to an academic journal for review? Richard Damon <Richard@Damon-Family.org> - 2021-07-01 23:16 -0400
                Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-07-01 22:27 -0500
                  Re: Why don't I simply submit my paper to an academic journal for review? Richard Damon <Richard@Damon-Family.org> - 2021-07-02 07:15 -0400
                    Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-07-02 09:26 -0500
                      Re: Why don't I simply submit my paper to an academic journal for review? Richard Damon <Richard@Damon-Family.org> - 2021-07-02 19:33 -0400
                        Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-07-02 19:06 -0500
                          Re: Why don't I simply submit my paper to an academic journal for review? Richard Damon <Richard@Damon-Family.org> - 2021-07-02 21:36 -0400
                            Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-07-02 20:57 -0500
                              Re: Why don't I simply submit my paper to an academic journal for review? Richard Damon <Richard@Damon-Family.org> - 2021-07-03 09:53 -0400
                                Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-07-03 09:43 -0500
                                  Re: Why don't I simply submit my paper to an academic journal for review? Richard Damon <Richard@Damon-Family.org> - 2021-07-03 11:57 -0400
                                    Re: Why don't I simply submit my paper to an academic journal for review? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-07-06 04:21 -0700
                                      Re: Why don't I simply submit my paper to an academic journal for review? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-07-06 17:36 +0100
                                        Re: Why don't I simply submit my paper to an academic journal for review? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-07-06 11:30 -0700
                                          Re: Why don't I simply submit my paper to an academic journal for review? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-07-07 00:19 +0100
          Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-07-01 09:30 -0500
            Re: Why don't I simply submit my paper to an academic journal for review? Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-07-01 08:49 -0700
              Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-07-01 10:52 -0500
                Re: Why don't I simply submit my paper to an academic journal for review? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-07-01 12:48 -0700
        Re: Why don't I simply submit my paper to an academic journal for review? Peter <peterxpercival@hotmail.com> - 2021-07-01 23:05 +0100
          Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-07-01 17:13 -0500
            Re: Why don't I simply submit my paper to an academic journal for review? Peter <peterxpercival@hotmail.com> - 2021-07-02 14:16 +0100
              Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-07-02 08:28 -0500
                Re: Why don't I simply submit my paper to an academic journal for review? Peter <peterxpercival@hotmail.com> - 2021-07-02 16:07 +0100
                  Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-07-02 10:17 -0500
                    Re: Why don't I simply submit my paper to an academic journal for review? Peter <peterxpercival@hotmail.com> - 2021-07-02 16:51 +0100
                      Re: Why don't I simply submit my paper to an academic journal for review? olcott <NoOne@NoWhere.com> - 2021-07-02 11:09 -0500

Page 4 of 8 — ← Prev page 1 2 3 [4] 5 6 7 8  Next page →


#35619 — Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ]

Fromolcott <NoOne@NoWhere.com>
Date2021-07-02 17:39 -0500
SubjectRe: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ]
Message-ID<eK2dneA6tdUJCEL9nZ2dnUU7-VHNnZ2d@giganews.com>
In reply to#35617
On 7/2/2021 5:16 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> That the code that I claimed was RASP equivalent rather than an actual
>> Turing machine is the poetic license that I used when I understood
>> that it was equivalent to a Turing Machine yet had never yet heard the
>> term Turing equivalence.
> 
> This is a lie.  You said you had two actually turning machines, fully
> encoded, and you knew exactly what that meant when you wrote it.  

Yes and I used poetic license because I knew that what I really had was 
equivalent to two Turing machines yet did not know that the concept of 
"equivalent to Turing machines" was known by anyone besides myself. All 
that I have ever previously heard was the term "Turing complete". I had 
never heard of anyone every saying "Turing equivalent".

None-the-less this is all moot now. The only reason that you bring it up 
it to distract attention away from what I have now. I have shown how an 
H and P in the proper halting problem relation <is> a decidable machine 
/ input pair with fully operational C / x86 code.

That you cannot stay focused on this point and very persistently try to 
distract attention way from this point is flatly dishonest.

If you utterly reverse course on this artificially contrived fake 
rebuttal and do the best that you can to help me improve the quality of 
my words I can give you some very significant credit for the success of 
my work. I could probably call you and Kaz my most important reviewers 
in the same way that the authors of academic papers give direct credit 
to their top very few reviewers.

> I
> accept you were deluded at the time, but you are lying about the
> subsequent retraction of the claim.
> 
> The last 30 months have included many ironies, but one of the most
> striking is that your supposed "solution" is trivial as a pair of actual
> Turing machines!  All the months of rowing back the claim with piles of
> OS code, x86 simulation and endless "traces" are not needed.  Given that
> you have decided that "reject" (or "no" or "false") is the correct
> answer for the specifically constructed "hat" case you should be able to
> produce the two actual Turing machines, fully encoded.  I can!
> 
> You argue that no one uses TMs because they are so impractical, but
> every students I have ever taught would be able to write X (and thus X^)
> such that X rejects on input <[X^],[X^]> despite X^ halting on input
> [X^].  Such an X (and therefore X^) is simple to write.  Not that you
> could do it, of course, but it is trivial.
> 
> All these months of walking back a claim that is, in the light of your
> definition of the correct answer, trivial.  If you can't produce the two
> actual Turing machines that behave like this, shame on you.
> 


-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#35594 — Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ]

FromDavid Brown <david.brown@hesbynett.no>
Date2021-07-02 08:58 +0200
SubjectRe: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ]
Message-ID<sbmdfj$6q6$1@dont-email.me>
In reply to#35589
On 02/07/2021 03:52, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> On 7/1/2021 6:24 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 7/1/2021 4:25 PM, olcott wrote:
>>>>> On 7/1/2021 3:23 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> We can make an undecidable problem by simply phrasing a question such
>>>>>>> that correct answers are impossible.
>>>>>>
>>>>>> But decision problems, of which the halting problem is one, are defined
>>>>>> as those that always have correct yes/no answers.  Such a problem is
>>>>>> undecidable if the set of yes instances in not recursive.
>>> <cut>
>>>> When the entire set of possible {true, false} Boolean return values
>>>> from an (input / TM) pair provides an incorrect halting status
>>> For every finite string, one of true or false is always the correct
>>> halting status for that string: true if the string represents a halting
>>> computation, false otherwise.
>>> Stop fighting this obvious fact and agree to it.  You are not talking
>>> about the halting problem until you do.
>>>
>>
>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞
>> if M applied to wM halts, and
>>
>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn
>> if M applied to wM does not halt
>>
>> In the Peter Linz proof it is commonly understood that neither the
>> Ĥ.qy (yes it halts) nor the Ĥ.qn (no it does not halt) are the correct
>> halt status that Ĥ can transition to when Ĥ is applied to ⟨Ĥ⟩ (its own
>> Turing machine description).
> 
> I accept that this is your misunderstanding, and it may even be a common
> misunderstanding, but it is not what the lines from Linz you keep
> quoting mean.  It absolutely does not mean that there is an instance of
> the halting problem without a correct yes/no answer.
> 
>> Because you have dodged this question so persistently over the years
>> by saying that there is a halt status for Ĥ applied to ⟨Ĥ⟩, 
> 
> No.  I have never said this.  H (as in Linz) does not exist, and neither
> does H^.  There is no string [H^].  The question of whether a TM that
> does not exist halts when given a non-existent string as its input is
> too absurd take seriously.
> 
You know the details of these things better than I, and I am decades out
of practice.  But as I understand it, the whole point of the common
proof that halting is undecidable is that the assumption that the
function H is computable leads to the contradiction that Ĥ(Ĥ) is both
true and false, alternatively that it is neither true nor false.  And
since it must be either true /or/ false (as everything is finite here),
that cannot be the case.  Therefore H could not have been computable.

It seems to me that Olcott's argument is based on assuming H /is/ a real
computable function, then redefining halting to allow an option of
"neither halts nor does not halt" to remove the contradiction.  Then he
claims that this means the common proof of halting undecidability is wrong.

Is that a fair summary?

[toc] | [prev] | [next] | [standalone]


#35597 — Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ]

FromAndy Walker <anw@cuboid.co.uk>
Date2021-07-02 11:28 +0100
SubjectRe: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ]
Message-ID<sbmpnt$1p0h$1@gioia.aioe.org>
In reply to#35594
On 02/07/2021 07:58, David Brown wrote:
> [...] But as I understand it, the whole point of the common
> proof that halting is undecidable is that the assumption that the
> function H is computable leads to the contradiction that Ĥ(Ĥ) is both
> true and false, alternatively that it is neither true nor false.  And
> since it must be either true /or/ false (as everything is finite here),
> that cannot be the case.  Therefore H could not have been computable.

	There is a danger of a confusion of notation in the above.  We
have to distinguish the [Boolean] function H which is True if a given
instance halts or False if it doesn't, from a computer [or TM], also
called H, that [by hypothesis] computes that function.  The point then
is that given [TM] H we can construct H_hat that H gets wrong, showing
that no such TM exists.  [Other proofs are available.]

> It seems to me that Olcott's argument is based on assuming H /is/ a real
> computable function, then redefining halting to allow an option of
> "neither halts nor does not halt" to remove the contradiction.  Then he
> claims that this means the common proof of halting undecidability is wrong.
> Is that a fair summary?

	You'd have to ask PO, but I don't think he'd accept that.  AIUI,
he doesn't accept that any valid question is undecidable, so that the
undecidable [in his eyes] instances prove that the question was invalid.
He still doesn't accept that the H_hat instance is perfectly decidable,
it's just that H gets the wrong answer.  He doesn't accept Goedel's
theorem for similar reasons, relating all such results to the Liar
Paradox and other problems with self-reference.

	Meanwhile, in the Real World, it is of course possible to make
genuine progress by writing programs that correctly and usefully reply
True, False or Don't Know to instances of the HP.  This makes more
sense than "neither halts nor does not halt", but is too well-known
and too obvious to be of interest to PO.  Or, perhaps, to this group.

-- 
Andy Walker, Nottingham.
    Andy's music pages: www.cuboid.me.uk/andy/Music
    Composer of the day: www.cuboid.me.uk/andy/Music/Composers/Schumann

[toc] | [prev] | [next] | [standalone]


#35599 — Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ]

FromRichard Damon <Richard@Damon-Family.org>
Date2021-07-02 07:04 -0400
SubjectRe: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ]
Message-ID<cpCDI.39115$0z8.34735@fx48.iad>
In reply to#35597
On 7/2/21 6:28 AM, Andy Walker wrote:
> On 02/07/2021 07:58, David Brown wrote:
>> [...] But as I understand it, the whole point of the common
>> proof that halting is undecidable is that the assumption that the
>> function H is computable leads to the contradiction that Ĥ(Ĥ) is both
>> true and false, alternatively that it is neither true nor false.  And
>> since it must be either true /or/ false (as everything is finite here),
>> that cannot be the case.  Therefore H could not have been computable.
> 
>     There is a danger of a confusion of notation in the above.  We
> have to distinguish the [Boolean] function H which is True if a given
> instance halts or False if it doesn't, from a computer [or TM], also
> called H, that [by hypothesis] computes that function.  The point then
> is that given [TM] H we can construct H_hat that H gets wrong, showing
> that no such TM exists.  [Other proofs are available.]
> 
>> It seems to me that Olcott's argument is based on assuming H /is/ a real
>> computable function, then redefining halting to allow an option of
>> "neither halts nor does not halt" to remove the contradiction.  Then he
>> claims that this means the common proof of halting undecidability is
>> wrong.
>> Is that a fair summary?
> 
>     You'd have to ask PO, but I don't think he'd accept that.  AIUI,
> he doesn't accept that any valid question is undecidable, so that the
> undecidable [in his eyes] instances prove that the question was invalid.
> He still doesn't accept that the H_hat instance is perfectly decidable,
> it's just that H gets the wrong answer.  He doesn't accept Goedel's
> theorem for similar reasons, relating all such results to the Liar
> Paradox and other problems with self-reference.
> 
>     Meanwhile, in the Real World, it is of course possible to make
> genuine progress by writing programs that correctly and usefully reply
> True, False or Don't Know to instances of the HP.  This makes more
> sense than "neither halts nor does not halt", but is too well-known
> and too obvious to be of interest to PO.  Or, perhaps, to this group.
> 

Yes, that is part of his argument. If you can't actually PROVE that an
answer is right you shouldn't be asking the question in the first place.
Too bad he doesn't seem to understand how to actually prove anything.

The problem is that this rule means you can't talk about the world of
Mathematics, which is what he doesn't understand.

Yes, it is a perfectly valid logic rules to work with, and gives you a
nice and tidy domain to discuss. The problem is there ar major limits as
to what you are able to discuss without the logic going bad, and the
field of mathematics goes beyond those limits.

From my memory, one key point is that you are basically limited to
working with only first order logical statements, propositions on the
members of the domain, but not over operations on the domain.

[toc] | [prev] | [next] | [standalone]


#35604 — Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ]

Fromolcott <NoOne@NoWhere.com>
Date2021-07-02 09:10 -0500
SubjectRe: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ]
Message-ID<tL6dnXTtJZnRg0L9nZ2dnUU7-a3NnZ2d@giganews.com>
In reply to#35597
On 7/2/2021 5:28 AM, Andy Walker wrote:
> On 02/07/2021 07:58, David Brown wrote:
>> [...] But as I understand it, the whole point of the common
>> proof that halting is undecidable is that the assumption that the
>> function H is computable leads to the contradiction that Ĥ(Ĥ) is both
>> true and false, alternatively that it is neither true nor false.  And
>> since it must be either true /or/ false (as everything is finite here),
>> that cannot be the case.  Therefore H could not have been computable.
> 
>      There is a danger of a confusion of notation in the above.  We
> have to distinguish the [Boolean] function H which is True if a given
> instance halts or False if it doesn't, from a computer [or TM], also
> called H, that [by hypothesis] computes that function.  The point then
> is that given [TM] H we can construct H_hat that H gets wrong, showing
> that no such TM exists.  [Other proofs are available.]
> 
>> It seems to me that Olcott's argument is based on assuming H /is/ a real
>> computable function, then redefining halting to allow an option of
>> "neither halts nor does not halt" to remove the contradiction.  Then he
>> claims that this means the common proof of halting undecidability is 
>> wrong.
>> Is that a fair summary?
> 

No that is not even close.
Read my paper (linked below) to see what I mean:

>      You'd have to ask PO, but I don't think he'd accept that.  AIUI,
> he doesn't accept that any valid question is undecidable, so that the
> undecidable [in his eyes] instances prove that the question was invalid.
> He still doesn't accept that the H_hat instance is perfectly decidable,
> it's just that H gets the wrong answer.  

No that is not even close.
Read my paper (linked below) to see what I mean:

> He doesn't accept Goedel's
> theorem for similar reasons, relating all such results to the Liar
> Paradox and other problems with self-reference.
> 
>      Meanwhile, in the Real World, it is of course possible to make
> genuine progress by writing programs that correctly and usefully reply
> True, False or Don't Know to instances of the HP.  This makes more
> sense than "neither halts nor does not halt", but is too well-known
> and too obvious to be of interest to PO.  Or, perhaps, to this group.
> 

I constantly update this paper to make my works more clear.
I just rewrote the abstract in response to this message.

Halting problem undecidability and infinitely nested simulation

https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation 



-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#35598 — Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ]

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2021-07-02 11:32 +0100
SubjectRe: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ]
Message-ID<87lf6pgg4v.fsf@bsb.me.uk>
In reply to#35594
David Brown <david.brown@hesbynett.no> writes:

> On 02/07/2021 03:52, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>> 
>>> On 7/1/2021 6:24 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 7/1/2021 4:25 PM, olcott wrote:
>>>>>> On 7/1/2021 3:23 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> We can make an undecidable problem by simply phrasing a question such
>>>>>>>> that correct answers are impossible.
>>>>>>>
>>>>>>> But decision problems, of which the halting problem is one, are defined
>>>>>>> as those that always have correct yes/no answers.  Such a problem is
>>>>>>> undecidable if the set of yes instances in not recursive.
>>>> <cut>
>>>>> When the entire set of possible {true, false} Boolean return values
>>>>> from an (input / TM) pair provides an incorrect halting status
>>>> For every finite string, one of true or false is always the correct
>>>> halting status for that string: true if the string represents a halting
>>>> computation, false otherwise.
>>>> Stop fighting this obvious fact and agree to it.  You are not talking
>>>> about the halting problem until you do.
>>>>
>>>
>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞
>>> if M applied to wM halts, and
>>>
>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn
>>> if M applied to wM does not halt
>>>
>>> In the Peter Linz proof it is commonly understood that neither the
>>> Ĥ.qy (yes it halts) nor the Ĥ.qn (no it does not halt) are the correct
>>> halt status that Ĥ can transition to when Ĥ is applied to ⟨Ĥ⟩ (its own
>>> Turing machine description).
>> 
>> I accept that this is your misunderstanding, and it may even be a common
>> misunderstanding, but it is not what the lines from Linz you keep
>> quoting mean.  It absolutely does not mean that there is an instance of
>> the halting problem without a correct yes/no answer.
>> 
>>> Because you have dodged this question so persistently over the years
>>> by saying that there is a halt status for Ĥ applied to ⟨Ĥ⟩, 
>> 
>> No.  I have never said this.  H (as in Linz) does not exist, and neither
>> does H^.  There is no string [H^].  The question of whether a TM that
>> does not exist halts when given a non-existent string as its input is
>> too absurd take seriously.
>> 
> You know the details of these things better than I, and I am decades out
> of practice.  But as I understand it, the whole point of the common
> proof that halting is undecidable is that the assumption that the
> function H is computable leads to the contradiction that Ĥ(Ĥ) is both
> true and false, alternatively that it is neither true nor false.

It just leads to a contradiction.  That's all.  An assumption -- that
there exists an H with H(s) = true if, and only if, s represents a
halting computation -- is shown to be logically unsustainable.

There is nothing to be both true and false here.  There is no such H.

> And
> since it must be either true /or/ false (as everything is finite here),
> that cannot be the case.  Therefore H could not have been computable.
>
> It seems to me that Olcott's argument is based on assuming H /is/ a real
> computable function, then redefining halting to allow an option of
> "neither halts nor does not halt" to remove the contradiction.  Then he
> claims that this means the common proof of halting undecidability is
> wrong.

This is indeed what's wrong.  He starts out certain that a logically
impossible TM exists.  When that is shown to be contradictory he /has/
to find some way out.  Accepting that he is wrong about his certain
knowledge is not psychologically possible, so any other way out is
preferable, even one as daft as declaring that X(<[X^],[X^]>) = false is
the correct result for this one case, despite the fact that the string
<[X^],[X^]> represents the halting computation X^([X^]).

> Is that a fair summary?

I don't like the first bit.  It begs the question of what "it" is that
is both true and false.  A contradiction is just a contradiction.

I much prefer the other proofs.  No doubt this is one reason PO will
never look at them.

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#35605 — Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ]

Fromolcott <NoOne@NoWhere.com>
Date2021-07-02 09:22 -0500
SubjectRe: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ]
Message-ID<9PydnXhRi_umvEL9nZ2dnUU7-LHNnZ2d@giganews.com>
In reply to#35598
On 7/2/2021 5:32 AM, Ben Bacarisse wrote:
> David Brown <david.brown@hesbynett.no> writes:
> 
>> On 02/07/2021 03:52, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 7/1/2021 6:24 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 7/1/2021 4:25 PM, olcott wrote:
>>>>>>> On 7/1/2021 3:23 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> We can make an undecidable problem by simply phrasing a question such
>>>>>>>>> that correct answers are impossible.
>>>>>>>>
>>>>>>>> But decision problems, of which the halting problem is one, are defined
>>>>>>>> as those that always have correct yes/no answers.  Such a problem is
>>>>>>>> undecidable if the set of yes instances in not recursive.
>>>>> <cut>
>>>>>> When the entire set of possible {true, false} Boolean return values
>>>>>> from an (input / TM) pair provides an incorrect halting status
>>>>> For every finite string, one of true or false is always the correct
>>>>> halting status for that string: true if the string represents a halting
>>>>> computation, false otherwise.
>>>>> Stop fighting this obvious fact and agree to it.  You are not talking
>>>>> about the halting problem until you do.
>>>>>
>>>>
>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞
>>>> if M applied to wM halts, and
>>>>
>>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn
>>>> if M applied to wM does not halt
>>>>
>>>> In the Peter Linz proof it is commonly understood that neither the
>>>> Ĥ.qy (yes it halts) nor the Ĥ.qn (no it does not halt) are the correct
>>>> halt status that Ĥ can transition to when Ĥ is applied to ⟨Ĥ⟩ (its own
>>>> Turing machine description).
>>>
>>> I accept that this is your misunderstanding, and it may even be a common
>>> misunderstanding, but it is not what the lines from Linz you keep
>>> quoting mean.  It absolutely does not mean that there is an instance of
>>> the halting problem without a correct yes/no answer.
>>>
>>>> Because you have dodged this question so persistently over the years
>>>> by saying that there is a halt status for Ĥ applied to ⟨Ĥ⟩,
>>>
>>> No.  I have never said this.  H (as in Linz) does not exist, and neither
>>> does H^.  There is no string [H^].  The question of whether a TM that
>>> does not exist halts when given a non-existent string as its input is
>>> too absurd take seriously.
>>>
>> You know the details of these things better than I, and I am decades out
>> of practice.  But as I understand it, the whole point of the common
>> proof that halting is undecidable is that the assumption that the
>> function H is computable leads to the contradiction that Ĥ(Ĥ) is both
>> true and false, alternatively that it is neither true nor false.
> 
> It just leads to a contradiction.  That's all.  An assumption -- that
> there exists an H with H(s) = true if, and only if, s represents a
> halting computation -- is shown to be logically unsustainable.
> 
> There is nothing to be both true and false here.  There is no such H.
> 

In other words you are claiming that the (TM X/Input I) pairs that have 
no correct yes/no return value from X have no specific term-of-the-art.

>> And
>> since it must be either true /or/ false (as everything is finite here),
>> that cannot be the case.  Therefore H could not have been computable.
>>
>> It seems to me that Olcott's argument is based on assuming H /is/ a real
>> computable function, then redefining halting to allow an option of
>> "neither halts nor does not halt" to remove the contradiction.  Then he
>> claims that this means the common proof of halting undecidability is
>> wrong.
> 
> This is indeed what's wrong.  He starts out certain that a logically
> impossible TM exists.  When that is shown to be contradictory he /has/
> to find some way out. 

// Simplified Linz Ĥ (Linz:1990:319)
void P(u32 x)
{
   u32 Input_Halts = H(x, x);
   if (Input_Halts)
     HERE: goto HERE;
}

int main()
{
   u32 Input_Halts = H((u32)P, (u32)P);
   Output("Input_Halts = ", Input_Halts);
}

It is quite nutty to say that when H determines that P is calling it in 
infinitely nested simulation, aborts its simulation of P on this basis, 
and then reports that P never halts has any contradiction what-so-ever.

Halting problem undecidability and infinitely nested simulation

https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation 


>  Accepting that he is wrong about his certain
> knowledge is not psychologically possible, so any other way out is
> preferable, even one as daft as declaring that X(<[X^],[X^]>) = false is
> the correct result for this one case, despite the fact that the string
> <[X^],[X^]> represents the halting computation X^([X^]).
> 

The fact that you cannot point to any error in the above and still 
insist that I am wrong really seems to indicate that you are flat out 
dishonest.

The fact that most of your rebuttals utterly rely on rhetoric and 
misdirection really seems to indicate that you are flat out dishonest.

>> Is that a fair summary?
> 

Revelation 21:8 King James Version
... and all liars, shall have their part in the lake which burneth with 
fire and brimstone: which is the second death.

Personally I believe that the above is far too harsh.

> I don't like the first bit.  It begs the question of what "it" is that
> is both true and false.  A contradiction is just a contradiction.
> 
> I much prefer the other proofs.  No doubt this is one reason PO will
> never look at them.
> 


-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#35607 — Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ]

Fromolcott <NoOne@NoWhere.com>
Date2021-07-02 09:29 -0500
SubjectRe: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ]
Message-ID<NpOdnVOdIsNMv0L9nZ2dnUU7-dWdnZ2d@giganews.com>
In reply to#35594
On 7/2/2021 1:58 AM, David Brown wrote:
> On 02/07/2021 03:52, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 7/1/2021 6:24 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 7/1/2021 4:25 PM, olcott wrote:
>>>>>> On 7/1/2021 3:23 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> We can make an undecidable problem by simply phrasing a question such
>>>>>>>> that correct answers are impossible.
>>>>>>>
>>>>>>> But decision problems, of which the halting problem is one, are defined
>>>>>>> as those that always have correct yes/no answers.  Such a problem is
>>>>>>> undecidable if the set of yes instances in not recursive.
>>>> <cut>
>>>>> When the entire set of possible {true, false} Boolean return values
>>>>> from an (input / TM) pair provides an incorrect halting status
>>>> For every finite string, one of true or false is always the correct
>>>> halting status for that string: true if the string represents a halting
>>>> computation, false otherwise.
>>>> Stop fighting this obvious fact and agree to it.  You are not talking
>>>> about the halting problem until you do.
>>>>
>>>
>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞
>>> if M applied to wM halts, and
>>>
>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn
>>> if M applied to wM does not halt
>>>
>>> In the Peter Linz proof it is commonly understood that neither the
>>> Ĥ.qy (yes it halts) nor the Ĥ.qn (no it does not halt) are the correct
>>> halt status that Ĥ can transition to when Ĥ is applied to ⟨Ĥ⟩ (its own
>>> Turing machine description).
>>
>> I accept that this is your misunderstanding, and it may even be a common
>> misunderstanding, but it is not what the lines from Linz you keep
>> quoting mean.  It absolutely does not mean that there is an instance of
>> the halting problem without a correct yes/no answer.
>>
>>> Because you have dodged this question so persistently over the years
>>> by saying that there is a halt status for Ĥ applied to ⟨Ĥ⟩,
>>
>> No.  I have never said this.  H (as in Linz) does not exist, and neither
>> does H^.  There is no string [H^].  The question of whether a TM that
>> does not exist halts when given a non-existent string as its input is
>> too absurd take seriously.
>>
> You know the details of these things better than I, and I am decades out
> of practice.  But as I understand it, the whole point of the common
> proof that halting is undecidable is that the assumption that the
> function H is computable leads to the contradiction that Ĥ(Ĥ) is both
> true and false, alternatively that it is neither true nor false.  And
> since it must be either true /or/ false (as everything is finite here),
> that cannot be the case.  Therefore H could not have been computable.
> 
> It seems to me that Olcott's argument is based on assuming H /is/ a real
> computable function, then redefining halting to allow an option of
> "neither halts nor does not halt" to remove the contradiction.  Then he
> claims that this means the common proof of halting undecidability is wrong.
> 
> Is that a fair summary?
> 

void P(u32 x)
{
   u32 Input_Halts = H(x, x);
   if (Input_Halts)
     HERE: goto HERE;
}

int main()
{
   u32 Input_Halts = H((u32)P, (u32)P);
   Output("Input_Halts = ", Input_Halts);
}

H determines that P is calling it in infinitely nested simulation, H 
aborts its simulation of P on this basis, and then reports that P never 
halts. This has no contradiction what-so-ever.


Halting problem undecidability and infinitely nested simulation
https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation 



-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#35586 — Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ]

FromRichard Damon <Richard@Damon-Family.org>
Date2021-07-01 19:19 -0400
SubjectRe: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ]
Message-ID<f4sDI.4254$MK4.4093@fx41.iad>
In reply to#35581
On 7/1/21 5:25 PM, olcott wrote:
> On 7/1/2021 3:23 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> We can make an undecidable problem by simply phrasing a question such
>>> that correct answers are impossible.
>>
>> But decision problems, of which the halting problem is one, are defined
>> as those that always have correct yes/no answers.  Such a problem is
>> undecidable if the set of yes instances in not recursive.
>>
> 
> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞
> if M applied to wM halts, and
> 
> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn
> if M applied to wM does not halt
> 
> So then exactly what is the proper terminology for the idea that the
> halt decider embedded at Ĥ.qx cannot transition to a final state
> corresponding to the actual halt status of Ĥ(⟨Ĥ⟩) (Ĥ applied to its own
> Turing machine description as input)?
> 
> Of everyone here you may be the best one on terminological questions.
> 
>> Every instance of the halting problem has a correct yes/no answer.  The
>> correct answer is "yes" for all those instances that represent halting
>> computations and "no" otherwise.
>>
>> You have refused to accept this simple statement about halting for more
>> than a decade.
>>
> 
> Let us now get the proper terminology untangled.
> 


That H is incorrect with its answer, or
That a correctly answering H does not exist.

Which is exactly what the proof says.

[toc] | [prev] | [next] | [standalone]


#35495

Fromolcott <NoOne@NoWhere.com>
Date2021-06-28 12:40 -0500
Message-ID<v5-dnUyosbIHlEf9nZ2dnUU7-K_NnZ2d@giganews.com>
In reply to#35487
On 6/28/2021 12:30 PM, Real Troll wrote:
> On 28/06/2021 18:16, Ben Bacarisse wrote:
>> Yet you copied them to four newsgroups!  Please consider trimming the
>> newsgroups in future.
> By trimming make sure you also trim C or C++ newsgroup so that the
> thread goes somewhere else. Use follow-up as well if necessary like I
> did. There is no point in carrying on a thread that is of less interest
> to C or C++ programmers. The OP's interest is purely academic so he can
> go to "comp.theory" newsgroup.
> 

Most of the people on comp.theory have given up on the basis that my 
position is now irrefutable.

Mike Terry claimed to have refuted my position yet all that he actually 
did was reject it out-of-hand without review.

Kaz also never refuted my position yet dismissed my work on the basis 
that I did such a terrible job on the diagonalization form of the proof. 
Kaz was my best reviewer.

My proof is pure software engineering and is only applied to computer 
science as a last step after the software engineering has been fully 
validated.

Anyone that is an expert C programmer can probably see that my proof is 
correct. It is helpful to also understand the x86 language.

-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#35496

FromAlan Mackenzie <acm@muc.de>
Date2021-06-28 17:54 +0000
Message-ID<sbd2da$2glq$1@news.muc.de>
In reply to#35495
[ Malicious cross posting removed. ]

In comp.theory olcott <NoOne@nowhere.com> wrote:

[ .... ]

> Most of the people on comp.theory have given up on the basis that my 
> position is now irrefutable.

You're a deluded liar.

> Mike Terry claimed to have refuted my position yet all that he actually 
> did was reject it out-of-hand without review.

Liar.

> Kaz also never refuted my position yet dismissed my work on the basis 
> that I did such a terrible job on the diagonalization form of the proof. 
> Kaz was my best reviewer.

Your work is a deluded lie.  Kaz, as he said, bowed out because
discussing anything with you is a pure waste of time.

> My proof is pure software engineering and is only applied to computer 
> science as a last step after the software engineering has been fully 
> validated.

Your "proof" is not a proof.  You're a deluded liar.

> Anyone that is an expert C programmer can probably see that my proof is 
> correct. It is helpful to also understand the x86 language.

I'm an expert C programmer, and I can see your "proof" is garbage without
even needing to look at it.  Anybody with a rudimentary knowledge of
computer science can see that.

> -- 
> Copyright 2021 Pete Olcott

-- 
Alan Mackenzie (Nuremberg, Germany).

[toc] | [prev] | [next] | [standalone]


#35500

Fromolcott <NoOne@NoWhere.com>
Date2021-06-28 13:08 -0500
Message-ID<QtWdncuZ4f2ejUf9nZ2dnUU7-IudnZ2d@giganews.com>
In reply to#35496
On 6/28/2021 12:54 PM, Alan Mackenzie wrote:
> [ Malicious cross posting removed. ]
> 
> In comp.theory olcott <NoOne@nowhere.com> wrote:
> 
> [ .... ]
> 
>> Most of the people on comp.theory have given up on the basis that my
>> position is now irrefutable.
> 
> You're a deluded liar.
> 
>> Mike Terry claimed to have refuted my position yet all that he actually
>> did was reject it out-of-hand without review.
> 
> Liar.
> 
>> Kaz also never refuted my position yet dismissed my work on the basis
>> that I did such a terrible job on the diagonalization form of the proof.
>> Kaz was my best reviewer.
> 
> Your work is a deluded lie.  Kaz, as he said, bowed out because
> discussing anything with you is a pure waste of time.
> 
>> My proof is pure software engineering and is only applied to computer
>> science as a last step after the software engineering has been fully
>> validated.
> 
> Your "proof" is not a proof.  You're a deluded liar.
> 
>> Anyone that is an expert C programmer can probably see that my proof is
>> correct. It is helpful to also understand the x86 language.
> 
> I'm an expert C programmer, and I can see your "proof" is garbage without
> even needing to look at it.  Anybody with a rudimentary knowledge of
> computer science can see that.
> 
>> -- 
>> Copyright 2021 Pete Olcott
> 

Even a bot could provide ad homimen personal attacks.

-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#35516

FromRichard Damon <Richard@Damon-Family.org>
Date2021-06-28 19:55 -0400
Message-ID<cktCI.50631$y%.18806@fx08.iad>
In reply to#35495
On 6/28/21 1:40 PM, olcott wrote:
> On 6/28/2021 12:30 PM, Real Troll wrote:
>> On 28/06/2021 18:16, Ben Bacarisse wrote:
>>> Yet you copied them to four newsgroups!  Please consider trimming the
>>> newsgroups in future.
>> By trimming make sure you also trim C or C++ newsgroup so that the
>> thread goes somewhere else. Use follow-up as well if necessary like I
>> did. There is no point in carrying on a thread that is of less interest
>> to C or C++ programmers. The OP's interest is purely academic so he can
>> go to "comp.theory" newsgroup.
>>
> 
> Most of the people on comp.theory have given up on the basis that my
> position is now irrefutable.
> 
> Mike Terry claimed to have refuted my position yet all that he actually
> did was reject it out-of-hand without review.
> 
> Kaz also never refuted my position yet dismissed my work on the basis
> that I did such a terrible job on the diagonalization form of the proof.
> Kaz was my best reviewer.
> 
> My proof is pure software engineering and is only applied to computer
> science as a last step after the software engineering has been fully
> validated.
> 
> Anyone that is an expert C programmer can probably see that my proof is
> correct. It is helpful to also understand the x86 language.
> 

Don't beleive him. Olcott may be giving up on comp.theory because he is
running out of excuses for how to justify his buggy logic.

His last statement show a key problem with his arguement, he is working
on a Theory that deals with core computation theory from mathematics,
which is part of the very theoretical base of computer science. It has
basically ZERO application to software engineering, so he is basically
being the Bull in the China shop and smashing everything and then say
this proves that it is impossible to wind a watch and have it work.

[toc] | [prev] | [next] | [standalone]


#35517

FromDaniel Pehoushek <pehoushek1@gmail.com>
Date2021-06-28 17:57 -0700
Message-ID<6fa55093-c7c9-4eab-ba4a-f81f2f19866an@googlegroups.com>
In reply to#35516
the reason for adding log factors is algorithmic..

Newton's revised law of universal gravitation (accounting for dark matter?) 
F=G{{m_1 m_2 logm1 logm2} over {r^2}}

F	=	force
G	=	gravitational constant
m_1	=	mass of object 1
m_2	=	mass of object 2
logm1   =       natural logarithm of m_1
logm2   =       natural logarithm of m_2
r	=	distance between centers of the masses

[toc] | [prev] | [next] | [standalone]


#35518

Fromolcott <NoOne@NoWhere.com>
Date2021-06-28 22:02 -0500
Message-ID<G5idnWsjFor_EEf9nZ2dnUU7-YfNnZ2d@giganews.com>
In reply to#35516
On 6/28/2021 6:55 PM, Richard Damon wrote:
> On 6/28/21 1:40 PM, olcott wrote:
>> On 6/28/2021 12:30 PM, Real Troll wrote:
>>> On 28/06/2021 18:16, Ben Bacarisse wrote:
>>>> Yet you copied them to four newsgroups!  Please consider trimming the
>>>> newsgroups in future.
>>> By trimming make sure you also trim C or C++ newsgroup so that the
>>> thread goes somewhere else. Use follow-up as well if necessary like I
>>> did. There is no point in carrying on a thread that is of less interest
>>> to C or C++ programmers. The OP's interest is purely academic so he can
>>> go to "comp.theory" newsgroup.
>>>
>>
>> Most of the people on comp.theory have given up on the basis that my
>> position is now irrefutable.
>>
>> Mike Terry claimed to have refuted my position yet all that he actually
>> did was reject it out-of-hand without review.
>>
>> Kaz also never refuted my position yet dismissed my work on the basis
>> that I did such a terrible job on the diagonalization form of the proof.
>> Kaz was my best reviewer.
>>
>> My proof is pure software engineering and is only applied to computer
>> science as a last step after the software engineering has been fully
>> validated.
>>
>> Anyone that is an expert C programmer can probably see that my proof is
>> correct. It is helpful to also understand the x86 language.
>>
> 
> Don't beleive him. Olcott may be giving up on comp.theory because he is
> running out of excuses for how to justify his buggy logic.
> 
> His last statement show a key problem with his arguement, he is working
> on a Theory that deals with core computation theory from mathematics,
> which is part of the very theoretical base of computer science. It has
> basically ZERO application to software engineering, so he is basically
> being the Bull in the China shop and smashing everything and then say
> this proves that it is impossible to wind a watch and have it work.
> 

Apparently you and Ben and now even Mike only have bluster and rhetoric 
as the entire basis of your whole ruse of a rebuttal.

-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#35490

FromMike Terry <news.dead.person.stones@darjeeling.plus.com>
Date2021-06-28 17:29 +0100
Message-ID<yoKdnaEbi5SfZET9nZ2dnUU78WnNnZ2d@brightview.co.uk>
In reply to#35475
On 28/06/2021 14:30, olcott wrote:
> On 6/28/2021 1:48 AM, David Brown wrote:
>> On 28/06/2021 01:05, olcott wrote:
>>> Because my writing style is not in the ballpark of academic quality and
>>> and computer scientists are loath to even consider evaluating computer
>>> science in terms of software engineering my paper would be rejected
>>> out-of-hand without any review at all entirely on the basis of style
>>> over substance.
>>>
>>
>> No, academics will likely reject your ideas out of hand because they are
>> wrong.
>>
>> Endlessly repeating the same misunderstandings and misconceptions does
>> not convince anyone in the academic world.  It does not convince any
>> programmers either, or anyone at all with a remotely logical and
>> rational mind.
>>
>> You have been making off-topic posts in many newsgroups for about 2
>> years, and there has been /zero/ progress on your part.  This is not
>> surprising - the halting problem was proven unsolvable some hundred-odd
>> years ago, and reality has not changed since.  The proof is simple
>> enough that any student doing theoretical computing or mathematics at
>> university could duplicate it, and any high-school pupil with a good
>> level of mathematics could understand it.
>>
>> For your own sanity, I would urge you to stop.  For other people's
>> sanity, I would urge you to stop posting to off-topic groups.  Even
>> better, start a blog and post only there.
>>
> 
> One of the smartest software engineers here said that he provided a 
> complete rebuttal of my work: Mike Terry, so I reviewed his review of my 
> work. He simply rejected my work out-of-hand without review entirely on 
> the basis that my sound deductive argument did not conform to the style 
> of a mathematical proof.

1. You're in no position to judge peoples' relative smartness

2. I wouldn't consider myself a "software engineer", just a long-time
    programmer with a maths background.  (Seems to me the term "software
    engineer" is vastly overused.  Mostly it just seems to be people
    fluffing up their CVs, or trying to con people into taking their
    opinions more seriously than they deserve.  Hint: you are not a
    software engineer...)

3. You seem to have just picked one of my previous posts at random,
    expecting that it would contain my "complete rebuttal" of your
    current document!  You would need to go back to the point where
    it first became clear what you were actually saying.  Perhaps
    around last October??  But I'd NOT recommend that - you'd be
    wasting your time, not because I haven't pointed out your errors,
    but because you're unable to understand my (or anyone else's)
    explanations of your errors.  You didn't understand them last
    year, so why would you do any better now?  Have you magically
    become smarter since then?  You would just find a couple
    of random posts and say "There, you didn't follow my reasoning,
    told you so!"  (Which would be a complete waste of your time,
    but feel free to do that if you want.)

4. You don't have a "sound deductive argument" or any argument at all.
    You're ignoring the key factor here - you're not an unrecognised
    genius, you're a Deluded Dumbo!  In place of actual
    reasoned arguments, all you have is mistaken intuitions for what
    you believe to be true, and your "reasoning" is just repeating those
    intuitions over and over with slightly different wording, hoping
    everybody will suddenly agree if you do it often enough!


Mike.

[toc] | [prev] | [next] | [standalone]


#35493

Fromolcott <NoOne@NoWhere.com>
Date2021-06-28 11:42 -0500
Message-ID<OuOdnQDRZNmMYUT9nZ2dnUU7-U3NnZ2d@giganews.com>
In reply to#35490
On 6/28/2021 11:29 AM, Mike Terry wrote:
> On 28/06/2021 14:30, olcott wrote:
>> On 6/28/2021 1:48 AM, David Brown wrote:
>>> On 28/06/2021 01:05, olcott wrote:
>>>> Because my writing style is not in the ballpark of academic quality and
>>>> and computer scientists are loath to even consider evaluating computer
>>>> science in terms of software engineering my paper would be rejected
>>>> out-of-hand without any review at all entirely on the basis of style
>>>> over substance.
>>>>
>>>
>>> No, academics will likely reject your ideas out of hand because they are
>>> wrong.
>>>
>>> Endlessly repeating the same misunderstandings and misconceptions does
>>> not convince anyone in the academic world.  It does not convince any
>>> programmers either, or anyone at all with a remotely logical and
>>> rational mind.
>>>
>>> You have been making off-topic posts in many newsgroups for about 2
>>> years, and there has been /zero/ progress on your part.  This is not
>>> surprising - the halting problem was proven unsolvable some hundred-odd
>>> years ago, and reality has not changed since.  The proof is simple
>>> enough that any student doing theoretical computing or mathematics at
>>> university could duplicate it, and any high-school pupil with a good
>>> level of mathematics could understand it.
>>>
>>> For your own sanity, I would urge you to stop.  For other people's
>>> sanity, I would urge you to stop posting to off-topic groups.  Even
>>> better, start a blog and post only there.
>>>
>>
>> One of the smartest software engineers here said that he provided a 
>> complete rebuttal of my work: Mike Terry, so I reviewed his review of 
>> my work. He simply rejected my work out-of-hand without review 
>> entirely on the basis that my sound deductive argument did not conform 
>> to the style of a mathematical proof.
> 
> 1. You're in no position to judge peoples' relative smartness
> 
> 2. I wouldn't consider myself a "software engineer", just a long-time
>     programmer with a maths background.  (Seems to me the term "software
>     engineer" is vastly overused.  Mostly it just seems to be people
>     fluffing up their CVs, or trying to con people into taking their
>     opinions more seriously than they deserve.  Hint: you are not a
>     software engineer...)
> 
> 3. You seem to have just picked one of my previous posts at random,
>     expecting that it would contain my "complete rebuttal" of your
>     current document!  You would need to go back to the point where
>     it first became clear what you were actually saying.  Perhaps
>     around last October??  But I'd NOT recommend that - you'd be
>     wasting your time, not because I haven't pointed out your errors,
>     but because you're unable to understand my (or anyone else's)
>     explanations of your errors.  You didn't understand them last
>     year, so why would you do any better now?  Have you magically
>     become smarter since then?  You would just find a couple
>     of random posts and say "There, you didn't follow my reasoning,
>     told you so!"  (Which would be a complete waste of your time,
>     but feel free to do that if you want.)
> 
> 4. You don't have a "sound deductive argument" or any argument at all.
>     You're ignoring the key factor here - you're not an unrecognised
>     genius, you're a Deluded Dumbo!  In place of actual
>     reasoned arguments, all you have is mistaken intuitions for what
>     you believe to be true, and your "reasoning" is just repeating those
>     intuitions over and over with slightly different wording, hoping
>     everybody will suddenly agree if you do it often enough!
> 
> 
> Mike.
> 

// Simplified Linz Ĥ (Linz:1990:319)
void P(u32 x)
{
   u32 Input_Halts = H(x, x);
   if (Input_Halts)
     HERE: goto HERE;
}

int main()
{
   u32 Input_Halts = H((u32)P, (u32)P);
   Output("Input_Halts = ", Input_Halts);
}

Premise(1) (axiom) Every computation that never halts unless its 
simulation is aborted is a computation that never halts. This verified 
as true on the basis of the meaning of its words.

Premise(2) (verified fact) The simulation of the input to H(P,P) never 
halts without being aborted is a verified fact on the basis of its x86 
execution trace. (shown in my paper).

Conclusion(3) From the above true premises it necessarily follows that 
simulating halt decider H correctly reports that its input: (P,P) never 
halts.

Halting problem undecidability and infinitely nested simulation
https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation

-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#35494

FromDaniel Pehoushek <pehoushek1@gmail.com>
Date2021-06-28 09:46 -0700
Message-ID<284ad76e-7a15-4572-a374-bd008b3e6fecn@googlegroups.com>
In reply to#35493
Newton's revised law of universal gravitation (accounting for dark matter?)

F=G{{m_1 m_2 logm1 logm2} over {r^2}}

the reason for adding log factors is algorithmic.

F = force
G = gravitational constant
m_1 = mass of object 1
m_2 = mass of object 2
logm1 = natural logarithm of m_1
logm2 = natural logarithm of m_2
r = distance between centers of the masses

daniel (little d)

[toc] | [prev] | [next] | [standalone]


#35498

FromDavid Brown <david.brown@hesbynett.no>
Date2021-06-28 20:03 +0200
Message-ID<sbd2t3$705$1@dont-email.me>
In reply to#35493
On 28/06/2021 18:42, olcott wrote:
> On 6/28/2021 11:29 AM, Mike Terry wrote:
>> On 28/06/2021 14:30, olcott wrote:
>>> On 6/28/2021 1:48 AM, David Brown wrote:
>>>> On 28/06/2021 01:05, olcott wrote:
>>>>> Because my writing style is not in the ballpark of academic quality
>>>>> and
>>>>> and computer scientists are loath to even consider evaluating computer
>>>>> science in terms of software engineering my paper would be rejected
>>>>> out-of-hand without any review at all entirely on the basis of style
>>>>> over substance.
>>>>>
>>>>
>>>> No, academics will likely reject your ideas out of hand because they
>>>> are
>>>> wrong.
>>>>
>>>> Endlessly repeating the same misunderstandings and misconceptions does
>>>> not convince anyone in the academic world.  It does not convince any
>>>> programmers either, or anyone at all with a remotely logical and
>>>> rational mind.
>>>>
>>>> You have been making off-topic posts in many newsgroups for about 2
>>>> years, and there has been /zero/ progress on your part.  This is not
>>>> surprising - the halting problem was proven unsolvable some hundred-odd
>>>> years ago, and reality has not changed since.  The proof is simple
>>>> enough that any student doing theoretical computing or mathematics at
>>>> university could duplicate it, and any high-school pupil with a good
>>>> level of mathematics could understand it.
>>>>
>>>> For your own sanity, I would urge you to stop.  For other people's
>>>> sanity, I would urge you to stop posting to off-topic groups.  Even
>>>> better, start a blog and post only there.
>>>>
>>>
>>> One of the smartest software engineers here said that he provided a
>>> complete rebuttal of my work: Mike Terry, so I reviewed his review of
>>> my work. He simply rejected my work out-of-hand without review
>>> entirely on the basis that my sound deductive argument did not
>>> conform to the style of a mathematical proof.
>>
>> 1. You're in no position to judge peoples' relative smartness
>>
>> 2. I wouldn't consider myself a "software engineer", just a long-time
>>     programmer with a maths background.  (Seems to me the term "software
>>     engineer" is vastly overused.  Mostly it just seems to be people
>>     fluffing up their CVs, or trying to con people into taking their
>>     opinions more seriously than they deserve.  Hint: you are not a
>>     software engineer...)
>>
>> 3. You seem to have just picked one of my previous posts at random,
>>     expecting that it would contain my "complete rebuttal" of your
>>     current document!  You would need to go back to the point where
>>     it first became clear what you were actually saying.  Perhaps
>>     around last October??  But I'd NOT recommend that - you'd be
>>     wasting your time, not because I haven't pointed out your errors,
>>     but because you're unable to understand my (or anyone else's)
>>     explanations of your errors.  You didn't understand them last
>>     year, so why would you do any better now?  Have you magically
>>     become smarter since then?  You would just find a couple
>>     of random posts and say "There, you didn't follow my reasoning,
>>     told you so!"  (Which would be a complete waste of your time,
>>     but feel free to do that if you want.)
>>
>> 4. You don't have a "sound deductive argument" or any argument at all.
>>     You're ignoring the key factor here - you're not an unrecognised
>>     genius, you're a Deluded Dumbo!  In place of actual
>>     reasoned arguments, all you have is mistaken intuitions for what
>>     you believe to be true, and your "reasoning" is just repeating those
>>     intuitions over and over with slightly different wording, hoping
>>     everybody will suddenly agree if you do it often enough!
>>
>>
>> Mike.
>>
> 
> // Simplified Linz Ĥ (Linz:1990:319)
> void P(u32 x)
> {
>   u32 Input_Halts = H(x, x);
>   if (Input_Halts)
>     HERE: goto HERE;
> }
> 
> int main()
> {
>   u32 Input_Halts = H((u32)P, (u32)P);
>   Output("Input_Halts = ", Input_Halts);
> }
> 
> Premise(1) (axiom) Every computation that never halts unless its
> simulation is aborted is a computation that never halts. This verified
> as true on the basis of the meaning of its words.

If it was "true on the basis of the meaning of its words", it would be
neither a premise nor an axiom.

But it is not true.

Either you consider the method of aborting to be part of the input to
the computation, in which case it /does/ halt, or you do not consider it
part of the input - in which case the abortable computation is not the
original one.

> 
> Premise(2) (verified fact) The simulation of the input to H(P,P) never
> halts without being aborted is a verified fact on the basis of its x86
> execution trace. (shown in my paper).

A "verified fact" is not a premise either.

The impossibility of the halting problem is not about identifying
particular computation that do not halt.  It is about the impossibility
of defining an algorithm that will determine whether /any/ given
computation will halt or not.  So a simulation here demonstrates nothing
except for this /one/ single computation.  (Even then you are talking
about one single compilation of the function.  C compilers are allowed,
in certain circumstances, to assume loops terminate.  A smart enough
compiler could do so here.  It is for such reasons that no sane computer
theorist would be using C and/or x86 for this kind of thing.)

> 
> Conclusion(3) From the above true premises it necessarily follows that
> simulating halt decider H correctly reports that its input: (P,P) never
> halts.

You can conclude that your program correctly reports that /one/ case.
You have proved nothing of use or interest, because it shows nothing
about any other program.

Consider function foo :

def is_perfect_number(x) :
    return x == sum([i for i in range(1, x) if x % i == 0])

def foo() :
	x = 1
	while (True) :
		x = x + 2
		if is_perfect_number(x) :
			return x


We can't write this in simple C - any size limitations are artificial
and negate the argument (since with machines limited to a given finite
size of program or input, the set of all possible traces is finite,
albeit rather large).  So I've given it in Python.

Can you write a function that will determine if the execution of "foo"
will halt or not?

[toc] | [prev] | [next] | [standalone]


#35501

Fromolcott <NoOne@NoWhere.com>
Date2021-06-28 13:29 -0500
Message-ID<nZCdnRoBWNmHiEf9nZ2dnUU7-IHNnZ2d@giganews.com>
In reply to#35498
On 6/28/2021 1:03 PM, David Brown wrote:
> On 28/06/2021 18:42, olcott wrote:
>> On 6/28/2021 11:29 AM, Mike Terry wrote:
>>> On 28/06/2021 14:30, olcott wrote:
>>>> On 6/28/2021 1:48 AM, David Brown wrote:
>>>>> On 28/06/2021 01:05, olcott wrote:
>>>>>> Because my writing style is not in the ballpark of academic quality
>>>>>> and
>>>>>> and computer scientists are loath to even consider evaluating computer
>>>>>> science in terms of software engineering my paper would be rejected
>>>>>> out-of-hand without any review at all entirely on the basis of style
>>>>>> over substance.
>>>>>>
>>>>>
>>>>> No, academics will likely reject your ideas out of hand because they
>>>>> are
>>>>> wrong.
>>>>>
>>>>> Endlessly repeating the same misunderstandings and misconceptions does
>>>>> not convince anyone in the academic world.  It does not convince any
>>>>> programmers either, or anyone at all with a remotely logical and
>>>>> rational mind.
>>>>>
>>>>> You have been making off-topic posts in many newsgroups for about 2
>>>>> years, and there has been /zero/ progress on your part.  This is not
>>>>> surprising - the halting problem was proven unsolvable some hundred-odd
>>>>> years ago, and reality has not changed since.  The proof is simple
>>>>> enough that any student doing theoretical computing or mathematics at
>>>>> university could duplicate it, and any high-school pupil with a good
>>>>> level of mathematics could understand it.
>>>>>
>>>>> For your own sanity, I would urge you to stop.  For other people's
>>>>> sanity, I would urge you to stop posting to off-topic groups.  Even
>>>>> better, start a blog and post only there.
>>>>>
>>>>
>>>> One of the smartest software engineers here said that he provided a
>>>> complete rebuttal of my work: Mike Terry, so I reviewed his review of
>>>> my work. He simply rejected my work out-of-hand without review
>>>> entirely on the basis that my sound deductive argument did not
>>>> conform to the style of a mathematical proof.
>>>
>>> 1. You're in no position to judge peoples' relative smartness
>>>
>>> 2. I wouldn't consider myself a "software engineer", just a long-time
>>>      programmer with a maths background.  (Seems to me the term "software
>>>      engineer" is vastly overused.  Mostly it just seems to be people
>>>      fluffing up their CVs, or trying to con people into taking their
>>>      opinions more seriously than they deserve.  Hint: you are not a
>>>      software engineer...)
>>>
>>> 3. You seem to have just picked one of my previous posts at random,
>>>      expecting that it would contain my "complete rebuttal" of your
>>>      current document!  You would need to go back to the point where
>>>      it first became clear what you were actually saying.  Perhaps
>>>      around last October??  But I'd NOT recommend that - you'd be
>>>      wasting your time, not because I haven't pointed out your errors,
>>>      but because you're unable to understand my (or anyone else's)
>>>      explanations of your errors.  You didn't understand them last
>>>      year, so why would you do any better now?  Have you magically
>>>      become smarter since then?  You would just find a couple
>>>      of random posts and say "There, you didn't follow my reasoning,
>>>      told you so!"  (Which would be a complete waste of your time,
>>>      but feel free to do that if you want.)
>>>
>>> 4. You don't have a "sound deductive argument" or any argument at all.
>>>      You're ignoring the key factor here - you're not an unrecognised
>>>      genius, you're a Deluded Dumbo!  In place of actual
>>>      reasoned arguments, all you have is mistaken intuitions for what
>>>      you believe to be true, and your "reasoning" is just repeating those
>>>      intuitions over and over with slightly different wording, hoping
>>>      everybody will suddenly agree if you do it often enough!
>>>
>>>
>>> Mike.
>>>
>>
>> // Simplified Linz Ĥ (Linz:1990:319)
>> void P(u32 x)
>> {
>>    u32 Input_Halts = H(x, x);
>>    if (Input_Halts)
>>      HERE: goto HERE;
>> }
>>
>> int main()
>> {
>>    u32 Input_Halts = H((u32)P, (u32)P);
>>    Output("Input_Halts = ", Input_Halts);
>> }
>>
>> Premise(1) (axiom) Every computation that never halts unless its
>> simulation is aborted is a computation that never halts. This verified
>> as true on the basis of the meaning of its words.
> 
> If it was "true on the basis of the meaning of its words", it would be
> neither a premise nor an axiom.
> 

If it is true on the basis of the meaning of its words then when it 
plays the role of a premise in deductive inference then we know that 
this premise is true.

> But it is not true.
> 
> Either you consider the method of aborting to be part of the input to
> the computation, in which case it /does/ halt, or you do not consider it
> part of the input - in which case the abortable computation is not the
> original one.
> 

We can know that it is true on the basis that
when the UTM simulation of Turing machine description of Turing Machine 
M never halts then we know that the execution of TM M never halts.
UTM(⟨M⟩, I) == ∞ logically entails M(I) == ∞ // "== ∞" means never halts

The particular axiom is the key element of my proof that makes the 
otherwise "impossible" inputs to a halt decider decidable.

>>
>> Premise(2) (verified fact) The simulation of the input to H(P,P) never
>> halts without being aborted is a verified fact on the basis of its x86
>> execution trace. (shown in my paper).
> 
> A "verified fact" is not a premise either.
> 

When A "verified fact" plays the role of a premise in deductive 
inference then we have a the basis required to know that this premise is 
true.

When we have a conclusion that logically follows from a pair of premises 
that are known to be true then we know that we have a sound rather than 
merely valid argument.

> The impossibility of the halting problem is not about identifying
> particular computation that do not halt.  It is about the impossibility
> of defining an algorithm that will determine whether /any/ given
> computation will halt or not.  

Yes.

> So a simulation here demonstrates nothing
> except for this /one/ single computation.  

No. The one single input <is> the same essential pattern of all of the 
counter-example inputs that are used to prove that the halting problem 
is undecidable.

The pattern is (as Sipser puts it) an input that "does the opposite" of 
whatever the halt decider decides.

> (Even then you are talking
> about one single compilation of the function.  C compilers are allowed,
> in certain circumstances, to assume loops terminate.  A smart enough
> compiler could do so here.  It is for such reasons that no sane computer
> theorist would be using C and/or x86 for this kind of thing.)
> 

I provide the disassembled machine code to utterly eliminate this 
ambiguity.

Halting problem undecidability and infinitely nested simulation

https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation 


>>
>> Conclusion(3) From the above true premises it necessarily follows that
>> simulating halt decider H correctly reports that its input: (P,P) never
>> halts.
> 
> You can conclude that your program correctly reports that /one/ case.
> You have proved nothing of use or interest, because it shows nothing
> about any other program.
> 

No. The one single input <is> the same essential pattern of all of the 
counter-example inputs that are used to prove that the halting problem 
is undecidable.

The pattern is (as Sipser puts it) an input that "does the opposite" of 
whatever the halt decider decides.

When I show how this input is correctly decided then all of the 
conventional halting problem proofs lose their entire basis and utterly 
fail to prove their conclusion.

> Consider function foo :
> 
> def is_perfect_number(x) :
>      return x == sum([i for i in range(1, x) if x % i == 0])
> 
> def foo() :
> 	x = 1
> 	while (True) :
> 		x = x + 2
> 		if is_perfect_number(x) :
> 			return x
> 
> 
> We can't write this in simple C - any size limitations are artificial
> and negate the argument (since with machines limited to a given finite
> size of program or input, the set of all possible traces is finite,
> albeit rather large).  So I've given it in Python.
> 
> Can you write a function that will determine if the execution of "foo"
> will halt or not?
> 
> 


-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


Page 4 of 8 — ← Prev page 1 2 3 [4] 5 6 7 8  Next page →

Back to top | Article view | comp.theory


csiph-web