Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #35432 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2021-06-27 18:05 -0500 |
| Last post | 2021-07-02 11:09 -0500 |
| Articles | 20 on this page of 145 — 14 participants |
Back to article view | Back to comp.theory
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 7 of 8 — ← Prev page 1 2 3 4 5 6 [7] 8 Next page →
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-07-02 07:15 -0400 |
| Message-ID | <bzCDI.12163$_j1.8241@fx09.iad> |
| In reply to | #35593 |
On 7/1/21 11:27 PM, olcott wrote: > On 7/1/2021 10:16 PM, Richard Damon wrote: >> On 7/1/21 10:10 AM, olcott wrote: >>> On 7/1/2021 4:51 AM, Malcolm McLean wrote: >>>> On Thursday, 1 July 2021 at 09:38:45 UTC+1, David Brown wrote: >>>>> On 30/06/2021 19:15, olcott wrote: >>>>>> On 6/30/2021 11:01 AM, Peter wrote: >>>>>>> olcott wrote: >>>>>>>> Because my writing style is not in the ballpark of academic quality >>>>>>>> [...] >>>>>>> >>>>>>> Then fix it. >>>>>>> >>>>>> >>>>>> I didn't know where to begin on this except for asking for a computer >>>>>> science professor to coach me. >>>>>> >>>>> There is your answer - talk to a computer scientist at a university. >>>>> You need to /talk/ to someone, physically and directly. Posting stuff >>>>> on Usenet is not working for you. >>>>> >>>> No, that's asking for trouble. >>>> >>> >>> Since at this point I am obviously correct, why are people still >>> disagreeing? >>> >> >> Because you are the only one who think that you are correct. We know >> that you aren't and have proved it. >> > > The only "proof" that you provided is that you fail to comprehend that > the first premise is verified as true on the basis of the meaning of its > words. Both Kaz and Ben have agreed that they do understand this. > > You already agreed with the second premise and the conclusion logically > follows from the two premises. > > What is left that could possibly be my error? > > 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. This statement is true for the correct definition of the words, that interpretation could be expressed as the Halting of P(I) is the same as the Halting of UTM(P,I). I.E, the ONLY simulator in view of the aborting is the top most simulator over the whole computation. THAT meaning comes out simply by the definition of a UTM. > > 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 below). WRONG. You trace is incorrect. If it was a trace of simulation of P(P), then we would see the simulation of the machibne H within P. We don't, therefore this is NOT the proper trace of the simulation. FAIL. You are applying in invalid transformation to your trace. You are also trying to now assert not that the FIRST H needs to abort, but that SOME H needs to abort and then try to make that satisfy that first premise, it doesn't. > > Conclusion(3) From the above true premises it necessarily follows that > simulating halt decider H correctly reports that its input: (P,P) never > halts. False Premise, Unsound logic. FAIL. > > Halting problem undecidability and infinitely nested simulation > > https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation > > > > >> Your arguemnts are NOT new, but are very similar to many seen over the >> decades. You may not see much of them, because failures tend not to get >> well published, and you seem to have rejected really looking at through >> introductory material that includes the history that shows where the >> problems were. >> > >
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-07-02 09:26 -0500 |
| Message-ID | <NpOdnVCdIsO7v0L9nZ2dnUU7-dXNnZ2d@giganews.com> |
| In reply to | #35600 |
On 7/2/2021 6:15 AM, Richard Damon wrote: > On 7/1/21 11:27 PM, olcott wrote: >> On 7/1/2021 10:16 PM, Richard Damon wrote: >>> On 7/1/21 10:10 AM, olcott wrote: >>>> On 7/1/2021 4:51 AM, Malcolm McLean wrote: >>>>> On Thursday, 1 July 2021 at 09:38:45 UTC+1, David Brown wrote: >>>>>> On 30/06/2021 19:15, olcott wrote: >>>>>>> On 6/30/2021 11:01 AM, Peter wrote: >>>>>>>> olcott wrote: >>>>>>>>> Because my writing style is not in the ballpark of academic quality >>>>>>>>> [...] >>>>>>>> >>>>>>>> Then fix it. >>>>>>>> >>>>>>> >>>>>>> I didn't know where to begin on this except for asking for a computer >>>>>>> science professor to coach me. >>>>>>> >>>>>> There is your answer - talk to a computer scientist at a university. >>>>>> You need to /talk/ to someone, physically and directly. Posting stuff >>>>>> on Usenet is not working for you. >>>>>> >>>>> No, that's asking for trouble. >>>>> >>>> >>>> Since at this point I am obviously correct, why are people still >>>> disagreeing? >>>> >>> >>> Because you are the only one who think that you are correct. We know >>> that you aren't and have proved it. >>> >> >> The only "proof" that you provided is that you fail to comprehend that >> the first premise is verified as true on the basis of the meaning of its >> words. Both Kaz and Ben have agreed that they do understand this. >> >> You already agreed with the second premise and the conclusion logically >> follows from the two premises. >> >> What is left that could possibly be my error? >> >> 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. > > This statement is true for the correct definition of the words, that > interpretation could be expressed as the Halting of P(I) is the same as > the Halting of UTM(P,I). I.E, the ONLY simulator in view of the aborting > is the top most simulator over the whole computation. THAT meaning comes > out simply by the definition of a UTM. > >> >> 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 below). > > WRONG. You trace is incorrect. If it was a trace of simulation of P(P), > then we would see the simulation of the machibne H within P. We don't, > therefore this is NOT the proper trace of the simulation. > > FAIL. Since the question is whether or not H must abort the simulation of P on the basis of the behavior of P it is utterly incorrect for H to examine its own behavior. Maybe if I tell you this 150 more times it will start to sink in and you will get it. > > You are applying in invalid transformation to your trace. > > You are also trying to now assert not that the FIRST H needs to abort, > but that SOME H needs to abort and then try to make that satisfy that > first premise, it doesn't. > >> >> Conclusion(3) From the above true premises it necessarily follows that >> simulating halt decider H correctly reports that its input: (P,P) never >> halts. > > False Premise, Unsound logic. > > FAIL. >> >> Halting problem undecidability and infinitely nested simulation >> >> https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation >> >> >> >> >>> Your arguemnts are NOT new, but are very similar to many seen over the >>> decades. You may not see much of them, because failures tend not to get >>> well published, and you seem to have rejected really looking at through >>> introductory material that includes the history that shows where the >>> problems were. >>> >> >> > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-07-02 19:33 -0400 |
| Message-ID | <DnNDI.4463$_Z2.3965@fx23.iad> |
| In reply to | #35606 |
On 7/2/21 10:26 AM, olcott wrote: > On 7/2/2021 6:15 AM, Richard Damon wrote: >> WRONG. You trace is incorrect. If it was a trace of simulation of P(P), >> then we would see the simulation of the machibne H within P. We don't, >> therefore this is NOT the proper trace of the simulation. >> >> FAIL. > > > Since the question is whether or not H must abort the simulation of P on > the basis of the behavior of P it is utterly incorrect for H to examine > its own behavior. Maybe if I tell you this 150 more times it will start > to sink in and you will get it. > No, since the REAL question is whether TURING MACHINE P(P) is halting or not, and TURING MACHINE P includes as part of itself that copy of H, the behavior of that H is part of the behavior of P, you MUST include it in your analysis. Omitting it is like determining the maximum speed of a car by just looking at the tires and saying they're the only part that touches the road, so we can ignore the rest of the car. Remember the Theorem you are using is talking about actual Turing Machines, and you begin with the argument that as long as you deal with equivalents you are ok, well equivalents need to be, like the word says, equivalent, so the x86 equivalent to the Turing Machine P needs to include everything that was in the Turing Machine P, so its behavior needs to include all the behavior or H. FAIL. Now, if you are willing to abandon that your proof is about the actual Halting Problem of Computation theory, but is only the Olcott must abort problem, maybe you can make a point for that.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-07-02 19:06 -0500 |
| Message-ID | <s9ednZCiIvlsNEL9nZ2dnUU7-YXNnZ2d@giganews.com> |
| In reply to | #35621 |
On 7/2/2021 6:33 PM, Richard Damon wrote: > On 7/2/21 10:26 AM, olcott wrote: >> On 7/2/2021 6:15 AM, Richard Damon wrote: >>> WRONG. You trace is incorrect. If it was a trace of simulation of P(P), >>> then we would see the simulation of the machibne H within P. We don't, >>> therefore this is NOT the proper trace of the simulation. >>> >>> FAIL. >> >> >> Since the question is whether or not H must abort the simulation of P on >> the basis of the behavior of P it is utterly incorrect for H to examine >> its own behavior. Maybe if I tell you this 150 more times it will start >> to sink in and you will get it. >> > > No, since the REAL question is whether TURING MACHINE P(P) is halting or > not, and TURING MACHINE P includes as part of itself that copy of H, the > behavior of that H is part of the behavior of P, you MUST include it in > your analysis. Until the behavior of the input demonstrates an infinite execution behavior pattern the behavior of H is a pure x86 emulator, thus cannot possibly have any effect on the behavior of its input. > Omitting it is like determining the maximum speed of a > car by just looking at the tires and saying they're the only part that > touches the road, so we can ignore the rest of the car. > > Remember the Theorem you are using is talking about actual Turing > Machines, and you begin with the argument that as long as you deal with > equivalents you are ok, well equivalents need to be, like the word says, > equivalent, so the x86 equivalent to the Turing Machine P needs to > include everything that was in the Turing Machine P, so its behavior > needs to include all the behavior or H. > > FAIL. > > Now, if you are willing to abandon that your proof is about the actual > Halting Problem of Computation theory, but is only the Olcott must abort > problem, maybe you can make a point for that. > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-07-02 21:36 -0400 |
| Message-ID | <TaPDI.11389$ZE7.3563@fx03.iad> |
| In reply to | #35624 |
On 7/2/21 8:06 PM, olcott wrote: > On 7/2/2021 6:33 PM, Richard Damon wrote: >> On 7/2/21 10:26 AM, olcott wrote: >>> On 7/2/2021 6:15 AM, Richard Damon wrote: >>>> WRONG. You trace is incorrect. If it was a trace of simulation of P(P), >>>> then we would see the simulation of the machibne H within P. We don't, >>>> therefore this is NOT the proper trace of the simulation. >>>> >>>> FAIL. >>> >>> >>> Since the question is whether or not H must abort the simulation of P on >>> the basis of the behavior of P it is utterly incorrect for H to examine >>> its own behavior. Maybe if I tell you this 150 more times it will start >>> to sink in and you will get it. >>> >> >> No, since the REAL question is whether TURING MACHINE P(P) is halting or >> not, and TURING MACHINE P includes as part of itself that copy of H, the >> behavior of that H is part of the behavior of P, you MUST include it in >> your analysis. > > Until the behavior of the input demonstrates an infinite execution > behavior pattern the behavior of H is a pure x86 emulator, thus cannot > possibly have any effect on the behavior of its input. What difference does that make about whether you can ignore the behavior the the part of P that happens to be its copy of the algorithm of H? Also, once H DOES change its behavior, it has changed the behavior of its calling machine, and thus when it sees a copy of itself, it needs to be able to see that THAT code isn't a pure simulator but will also be able to stop its simulation and affet the behavior the the P that the first machine was simulating that used that H. The error is that H, like you, isn't smart enough to see that far ahead. The REAL logic of what is happening when we run P(P) is as follows: P uses H to decide P(P). That first H simulates P(P), and sees that P is calling H(P,P) That first H sees that this simulated H is going to simulate P(P) That first H then detects what it thinks is an infinite recursion and aborts the simulation and decides that the compation is non-haltimg The error is that this first H is using 'bad logic' as it SHOULD know that just as it is deciding to abort its simulation of P(P), that simulated H will ALSO, if given a bit more time ALSO abort ITS simulaton of its P(P). Yes, The fact that H aborts is simulation of P(P) doesn't affect the halting behavior of that copy of P(P), but it also doesn't actually force that P(P) to be infinite, since it DOES include a H that will abort its simulation. If forgets that since the H it is simulating can abort it simulation that DOES possibly affect the behavior of the machine that USED that H as part of it. And, it turns out that this P, if/when it gets the (incorrect) non-halting answer from its include H, end up halting. > >> Omitting it is like determining the maximum speed of a >> car by just looking at the tires and saying they're the only part that >> touches the road, so we can ignore the rest of the car. >> >> Remember the Theorem you are using is talking about actual Turing >> Machines, and you begin with the argument that as long as you deal with >> equivalents you are ok, well equivalents need to be, like the word says, >> equivalent, so the x86 equivalent to the Turing Machine P needs to >> include everything that was in the Turing Machine P, so its behavior >> needs to include all the behavior or H. >> >> FAIL. >> >> Now, if you are willing to abandon that your proof is about the actual >> Halting Problem of Computation theory, but is only the Olcott must abort >> problem, maybe you can make a point for that. >> > > One fundamental problem with your logic is that BEFORE you can ask the question of does P(P) Halt, we need to have a fully defined P, and that means we need a fully defined H. That means the question you ask of what answer should H give to be right is an improper question at this time, as H has already been required to programmed with an algorithm that will give some definite answer. This question, what answer should H give to be right is just like asking Joe to truthfully answer if he is going to say No. THAT is the improper question. Yes, there IS a definite answer to the question of does P(P) halt? For the H you have defined, that answer is Yes (because you H has been defined to say no). Thus For THIS H, the problem isn't undecidable, it just is one that THIS H will get wrong. Build a different H (call it H2), then the H^ derived from THAT H (H2^ or P2), will be the case that this new H2 will get wrong. There is a point when you can ask that question, and that is before you define that you have an H, you can ask given that I know I will be asked to decide on a machine built on the ^ template, what answer can I give, and when you try to decide on that ^ machine, and when you look at it, you find that there is NO answer you can give, which shows that no such machine can exist to correct decide that case, which is EXACTLY what the proof you are trying to refute says, there can't be a machine that gets every decision on halting correct. This doesn't mean that there are machines that don't have an answer to the Halting Question, because since we can't create the H that answers that conundrum, it means that we don't have the H^ that doesn't have an answer, it also doesn't exist. And a non-existent machine not having a definitive answer to its halting isn't a problem, only machines that actually exist will either Halt or Not.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-07-02 20:57 -0500 |
| Message-ID | <x-ydnbVfPJtqXkL9nZ2dnUU7-X3NnZ2d@giganews.com> |
| In reply to | #35625 |
On 7/2/2021 8:36 PM, Richard Damon wrote:
> On 7/2/21 8:06 PM, olcott wrote:
>> On 7/2/2021 6:33 PM, Richard Damon wrote:
>>> On 7/2/21 10:26 AM, olcott wrote:
>>>> On 7/2/2021 6:15 AM, Richard Damon wrote:
>>>>> WRONG. You trace is incorrect. If it was a trace of simulation of P(P),
>>>>> then we would see the simulation of the machibne H within P. We don't,
>>>>> therefore this is NOT the proper trace of the simulation.
>>>>>
>>>>> FAIL.
>>>>
>>>>
>>>> Since the question is whether or not H must abort the simulation of P on
>>>> the basis of the behavior of P it is utterly incorrect for H to examine
>>>> its own behavior. Maybe if I tell you this 150 more times it will start
>>>> to sink in and you will get it.
>>>>
>>>
>>> No, since the REAL question is whether TURING MACHINE P(P) is halting or
>>> not, and TURING MACHINE P includes as part of itself that copy of H, the
>>> behavior of that H is part of the behavior of P, you MUST include it in
>>> your analysis.
>>
>> Until the behavior of the input demonstrates an infinite execution
>> behavior pattern the behavior of H is a pure x86 emulator, thus cannot
>> possibly have any effect on the behavior of its input.
>
> What difference does that make about whether you can ignore the behavior
> the the part of P that happens to be its copy of the algorithm of H?
>
I know how you love to dishonestly change the subject the same way that
Ben does so that to people hardly paying attention it may seem that your
drivel is a rebuttal. P does not contain a copy of H and you know this.
I wish that I could call you a lying scumbag, but that would not have
the proper professional decorum so I must refrain.
void P(u32 x)
{
u32 Input_Halts = H(x, x);
if (Input_Halts)
HERE: goto HERE;
}
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-07-03 09:53 -0400 |
| Message-ID | <qZZDI.11053$MK4.10031@fx41.iad> |
| In reply to | #35626 |
On 7/2/21 9:57 PM, olcott wrote:
> On 7/2/2021 8:36 PM, Richard Damon wrote:
>> On 7/2/21 8:06 PM, olcott wrote:
>>> On 7/2/2021 6:33 PM, Richard Damon wrote:
>>>> On 7/2/21 10:26 AM, olcott wrote:
>>>>> On 7/2/2021 6:15 AM, Richard Damon wrote:
>>>>>> WRONG. You trace is incorrect. If it was a trace of simulation of
>>>>>> P(P),
>>>>>> then we would see the simulation of the machibne H within P. We
>>>>>> don't,
>>>>>> therefore this is NOT the proper trace of the simulation.
>>>>>>
>>>>>> FAIL.
>>>>>
>>>>>
>>>>> Since the question is whether or not H must abort the simulation of
>>>>> P on
>>>>> the basis of the behavior of P it is utterly incorrect for H to
>>>>> examine
>>>>> its own behavior. Maybe if I tell you this 150 more times it will
>>>>> start
>>>>> to sink in and you will get it.
>>>>>
>>>>
>>>> No, since the REAL question is whether TURING MACHINE P(P) is
>>>> halting or
>>>> not, and TURING MACHINE P includes as part of itself that copy of H,
>>>> the
>>>> behavior of that H is part of the behavior of P, you MUST include it in
>>>> your analysis.
>>>
>>> Until the behavior of the input demonstrates an infinite execution
>>> behavior pattern the behavior of H is a pure x86 emulator, thus cannot
>>> possibly have any effect on the behavior of its input.
>>
>> What difference does that make about whether you can ignore the behavior
>> the the part of P that happens to be its copy of the algorithm of H?
>>
> I know how you love to dishonestly change the subject the same way that
> Ben does so that to people hardly paying attention it may seem that your
> drivel is a rebuttal. P does not contain a copy of H and you know this.
Back to this dishonest dodge.
Please show how TURING MACHINE P can execute the algorithm of H without
including a copy of it, or having it as an explicit input?
This shows how you absolutely have NO understanding of Turing Machines.
Please show any example of actual Turing Machine code (you know, the
actual set of tuples that define a machine) that uses code from another
machine without including a copy of it in the machine or having it as in
input.
If you can't do that, you have FAILED to prove your idiotic assertion
that a Turing Machine can possible 'call' another machine without
including a explicit copy of it in its code or within its input.
>
> I wish that I could call you a lying scumbag, but that would not have
> the proper professional decorum so I must refrain.
>
> void P(u32 x)
> {
> u32 Input_Halts = H(x, x);
> if (Input_Halts)
> HERE: goto HERE;
> }
>
>
>
Which isn't a complete Turing Machine Description. It isn't even a
complete program, so the definition even fails the concept of basic
Software Engineering.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-07-03 09:43 -0500 |
| Message-ID | <MrOdna_rm6zk6n39nZ2dnUU7-cnNnZ2d@giganews.com> |
| In reply to | #35632 |
On 7/3/2021 8:53 AM, Richard Damon wrote:
> On 7/2/21 9:57 PM, olcott wrote:
>> On 7/2/2021 8:36 PM, Richard Damon wrote:
>>> On 7/2/21 8:06 PM, olcott wrote:
>>>> On 7/2/2021 6:33 PM, Richard Damon wrote:
>>>>> On 7/2/21 10:26 AM, olcott wrote:
>>>>>> On 7/2/2021 6:15 AM, Richard Damon wrote:
>>>>>>> WRONG. You trace is incorrect. If it was a trace of simulation of
>>>>>>> P(P),
>>>>>>> then we would see the simulation of the machibne H within P. We
>>>>>>> don't,
>>>>>>> therefore this is NOT the proper trace of the simulation.
>>>>>>>
>>>>>>> FAIL.
>>>>>>
>>>>>>
>>>>>> Since the question is whether or not H must abort the simulation of
>>>>>> P on
>>>>>> the basis of the behavior of P it is utterly incorrect for H to
>>>>>> examine
>>>>>> its own behavior. Maybe if I tell you this 150 more times it will
>>>>>> start
>>>>>> to sink in and you will get it.
>>>>>>
>>>>>
>>>>> No, since the REAL question is whether TURING MACHINE P(P) is
>>>>> halting or
>>>>> not, and TURING MACHINE P includes as part of itself that copy of H,
>>>>> the
>>>>> behavior of that H is part of the behavior of P, you MUST include it in
>>>>> your analysis.
>>>>
>>>> Until the behavior of the input demonstrates an infinite execution
>>>> behavior pattern the behavior of H is a pure x86 emulator, thus cannot
>>>> possibly have any effect on the behavior of its input.
>>>
>>> What difference does that make about whether you can ignore the behavior
>>> the the part of P that happens to be its copy of the algorithm of H?
>>>
>> I know how you love to dishonestly change the subject the same way that
>> Ben does so that to people hardly paying attention it may seem that your
>> drivel is a rebuttal. P does not contain a copy of H and you know this.
>
> Back to this dishonest dodge.
>
> Please show how TURING MACHINE P can execute the algorithm of H without
> including a copy of it, or having it as an explicit input?
>
To make my point complete and easy to understand I use C / x86
void P(u32 x)
{
u32 Input_Halts = H(x, x);
if (Input_Halts)
HERE: goto HERE;
}
Since you dishonestly want to continue with rebuttals even after I
totally prove my point it looks like you will never get my point.
Revelation 21:8 King James Version
all liars, shall have their part in the lake which burneth with fire and
brimstone: which is the second death.
Your little troll game may have eternal consequences.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-07-03 11:57 -0400 |
| Message-ID | <_N%DI.4489$_Z2.3917@fx23.iad> |
| In reply to | #35633 |
On 7/3/21 10:43 AM, olcott wrote:
> On 7/3/2021 8:53 AM, Richard Damon wrote:
>> On 7/2/21 9:57 PM, olcott wrote:
>>> On 7/2/2021 8:36 PM, Richard Damon wrote:
>>>> On 7/2/21 8:06 PM, olcott wrote:
>>>>> On 7/2/2021 6:33 PM, Richard Damon wrote:
>>>>>> On 7/2/21 10:26 AM, olcott wrote:
>>>>>>> On 7/2/2021 6:15 AM, Richard Damon wrote:
>>>>>>>> WRONG. You trace is incorrect. If it was a trace of simulation of
>>>>>>>> P(P),
>>>>>>>> then we would see the simulation of the machibne H within P. We
>>>>>>>> don't,
>>>>>>>> therefore this is NOT the proper trace of the simulation.
>>>>>>>>
>>>>>>>> FAIL.
>>>>>>>
>>>>>>>
>>>>>>> Since the question is whether or not H must abort the simulation of
>>>>>>> P on
>>>>>>> the basis of the behavior of P it is utterly incorrect for H to
>>>>>>> examine
>>>>>>> its own behavior. Maybe if I tell you this 150 more times it will
>>>>>>> start
>>>>>>> to sink in and you will get it.
>>>>>>>
>>>>>>
>>>>>> No, since the REAL question is whether TURING MACHINE P(P) is
>>>>>> halting or
>>>>>> not, and TURING MACHINE P includes as part of itself that copy of H,
>>>>>> the
>>>>>> behavior of that H is part of the behavior of P, you MUST include
>>>>>> it in
>>>>>> your analysis.
>>>>>
>>>>> Until the behavior of the input demonstrates an infinite execution
>>>>> behavior pattern the behavior of H is a pure x86 emulator, thus cannot
>>>>> possibly have any effect on the behavior of its input.
>>>>
>>>> What difference does that make about whether you can ignore the
>>>> behavior
>>>> the the part of P that happens to be its copy of the algorithm of H?
>>>>
>>> I know how you love to dishonestly change the subject the same way that
>>> Ben does so that to people hardly paying attention it may seem that your
>>> drivel is a rebuttal. P does not contain a copy of H and you know this.
>>
>> Back to this dishonest dodge.
What is dishonest about it. Just that it shows that your statement is wrong.
>>
>> Please show how TURING MACHINE P can execute the algorithm of H without
>> including a copy of it, or having it as an explicit input?
>>
> To make my point complete and easy to understand I use C / x86
But, you make a claim that it is a Turing Equivalent. PROVE IT.
>
> void P(u32 x)
> {
> u32 Input_Halts = H(x, x);
> if (Input_Halts)
> HERE: goto HERE;
> }
>
> Since you dishonestly want to continue with rebuttals even after I
> totally prove my point it looks like you will never get my point.
>
> Revelation 21:8 King James Version
> all liars, shall have their part in the lake which burneth with fire and
> brimstone: which is the second death.
>
> Your little troll game may have eternal consequences.
>
I.E. you can't show your claim in Turing Machines, because they don't apply.
FALSE PREMISE, UNSOUND LOGIC.
PERIOD.
YOU FAIL.
[toc] | [prev] | [next] | [standalone]
| From | Daniel Pehoushek <pehoushek1@gmail.com> |
|---|---|
| Date | 2021-07-06 04:21 -0700 |
| Message-ID | <fed8988d-2f6b-4fa7-93e0-8f550194d5dfn@googlegroups.com> |
| In reply to | #35639 |
this is a theory group. get the hell out.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-07-06 17:36 +0100 |
| Message-ID | <87pmvv8kmk.fsf@bsb.me.uk> |
| In reply to | #35798 |
Daniel Pehoushek <pehoushek1@gmail.com> writes: > this is a theory group. get the hell out. You can't throw people out. All you can do is filter what you read (if you use a good newsreader). The best way to make the group better is to post interesting things. How did your Bob program get on in the competition? -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Daniel Pehoushek <pehoushek1@gmail.com> |
|---|---|
| Date | 2021-07-06 11:30 -0700 |
| Message-ID | <a8859c4a-01e2-44dc-9de8-dcfec783963cn@googlegroups.com> |
| In reply to | #35809 |
On Tuesday, July 6, 2021 at 12:36:41 PM UTC-4, Ben Bacarisse wrote: > Daniel Pehoushek <pehou...@gmail.com> writes: > > > this is a theory group. get the hell out. > You can't throw people out. All you can do is filter what you read (if > you use a good newsreader). The best way to make the group better is to > post interesting things. How did your Bob program get on in the > competition? > > -- > Ben. well, you are probably right. love the pooh by the way. the model counting competition 2021 results are going to be announced friday. the competition is about computing #P on small boolean formulas. the competition may be thought of as advanced ai research. speaking of posts, do you see my other posts on comp.theory? not getting any bites, so i am unsure my other posts are "going out". sincerely daniel
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-07-07 00:19 +0100 |
| Message-ID | <87h7h781zb.fsf@bsb.me.uk> |
| In reply to | #35812 |
Daniel Pehoushek <pehoushek1@gmail.com> writes: > speaking of posts, do you see my other posts on comp.theory? > not getting any bites, so i am unsure my other posts are "going out". I think so, but I don't know how many posts you are referring to. They were incomprehensible to me. That might explain the lack of interest. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-07-01 09:30 -0500 |
| Message-ID | <KpydnYR_oZoHTED9nZ2dnUU7-UGdnZ2d@giganews.com> |
| In reply to | #35563 |
On 7/1/2021 3:38 AM, David Brown wrote: > On 30/06/2021 19:15, olcott wrote: >> On 6/30/2021 11:01 AM, Peter wrote: >>> olcott wrote: >>>> Because my writing style is not in the ballpark of academic quality >>>> [...] >>> >>> Then fix it. >>> >> >> I didn't know where to begin on this except for asking for a computer >> science professor to coach me. >> > > There is your answer - talk to a computer scientist at a university. > You need to /talk/ to someone, physically and directly. Posting stuff > on Usenet is not working for you. > > I did talk to the guy that taught theory of computation at my alma mater. Because of covid he did not have office hours. He was so annoyed that I called him at home that he denied that he was who he already admitted that he is. I sent him an email of the link to my paper. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-07-01 08:49 -0700 |
| Message-ID | <4e394e9b-bd3f-45c7-8a72-964aac08bf13n@googlegroups.com> |
| In reply to | #35572 |
On Thursday, 1 July 2021 at 15:30:57 UTC+1, olcott wrote: > On 7/1/2021 3:38 AM, David Brown wrote: > > On 30/06/2021 19:15, olcott wrote: > >> On 6/30/2021 11:01 AM, Peter wrote: > >>> olcott wrote: > >>>> Because my writing style is not in the ballpark of academic quality > >>>> [...] > >>> > >>> Then fix it. > >>> > >> > >> I didn't know where to begin on this except for asking for a computer > >> science professor to coach me. > >> > > > > There is your answer - talk to a computer scientist at a university. > > You need to /talk/ to someone, physically and directly. Posting stuff > > on Usenet is not working for you. > > > > > I did talk to the guy that taught theory of computation at my alma > mater. Because of covid he did not have office hours. He was so annoyed > that I called him at home that he denied that he was who he already > admitted that he is. I sent him an email of the link to my paper. > Exactly. On comp.theory, anyone can post, and so people here accept that posts about halt deciders, proofs that P = NP, algorithms for quickly factoring large numbers, arguments that infinity is a real number, and so on go with the territory. However if you try to interest people outside of Usenet in the same types of things, you might get a much more hostile reaction.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-07-01 10:52 -0500 |
| Message-ID | <Jq-dnTHbjK9NeUD9nZ2dnUU7-XudnZ2d@giganews.com> |
| In reply to | #35574 |
On 7/1/2021 10:49 AM, Malcolm McLean wrote: > On Thursday, 1 July 2021 at 15:30:57 UTC+1, olcott wrote: >> On 7/1/2021 3:38 AM, David Brown wrote: >>> On 30/06/2021 19:15, olcott wrote: >>>> On 6/30/2021 11:01 AM, Peter wrote: >>>>> olcott wrote: >>>>>> Because my writing style is not in the ballpark of academic quality >>>>>> [...] >>>>> >>>>> Then fix it. >>>>> >>>> >>>> I didn't know where to begin on this except for asking for a computer >>>> science professor to coach me. >>>> >>> >>> There is your answer - talk to a computer scientist at a university. >>> You need to /talk/ to someone, physically and directly. Posting stuff >>> on Usenet is not working for you. >>> >>> >> I did talk to the guy that taught theory of computation at my alma >> mater. Because of covid he did not have office hours. He was so annoyed >> that I called him at home that he denied that he was who he already >> admitted that he is. I sent him an email of the link to my paper. >> > Exactly. On comp.theory, anyone can post, and so people here accept that > posts about halt deciders, proofs that P = NP, algorithms for quickly factoring > large numbers, arguments that infinity is a real number, and so on go with > the territory. > > However if you try to interest people outside of Usenet in the same types of > things, you might get a much more hostile reaction. > The verifiable fact that I am correct should overcome the presumption that I am not correct. 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]
| From | Daniel Pehoushek <pehoushek1@gmail.com> |
|---|---|
| Date | 2021-07-01 12:48 -0700 |
| Message-ID | <a001a51a-52dc-45cd-a109-28926028c490n@googlegroups.com> |
| In reply to | #35575 |
again, i, gres 2380, competently decide that olcott must halt this is a theory group. get the hell out.
[toc] | [prev] | [next] | [standalone]
| From | Peter <peterxpercival@hotmail.com> |
|---|---|
| Date | 2021-07-01 23:05 +0100 |
| Message-ID | <sble7d$12iq$1@gioia.aioe.org> |
| In reply to | #35547 |
olcott wrote: > On 6/30/2021 11:01 AM, Peter wrote: >> olcott wrote: >>> Because my writing style is not in the ballpark of academic quality >>> [...] >> >> Then fix it. >> > > I didn't know where to begin If you have access to a university library, read journals. Halmos wrote a paper called 'How to write mathematics' I don't know if it's relevant but someone reading this might. If you've got time and money do a post graduate degree--not only might you learn how to write mathematics (by imitation) you might also learn that your not as clever as you think you are. > on this except for asking for a computer > science professor to coach me. > > Now I do know where to begin on this this paper seems to be a good > model: https://dl.acm.org/doi/abs/10.1145/24658.24665 No copy is > available online so I got one from my university. > > The other issue doesn't seem to have much of an alternative. A key part > of the problem that allowed the halting problem to continue to exist is > that it was only analyzed using Turing machines. > > When analyzed this way almost all of the details must simply be imagined > rather than explicitly specified. This left huge gaps in the reasoning > about the halting problem. > > I cannot convert my proof to the Turing machine model of computation > away from the RASP equivalent model of c/x86 without losing the steps of > my sound deductive inference that prove that my analysis is correct. > > Halting problem undecidability and infinitely nested simulation > > https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation > > > > -- The world will little note, nor long remember what we say here Abraham Lincoln at Gettysburg
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-07-01 17:13 -0500 |
| Message-ID | <7PmdncUkL9FuoEP9nZ2dnUU7-VHNnZ2d@giganews.com> |
| In reply to | #35584 |
On 7/1/2021 5:05 PM, Peter wrote: > olcott wrote: >> On 6/30/2021 11:01 AM, Peter wrote: >>> olcott wrote: >>>> Because my writing style is not in the ballpark of academic quality >>>> [...] >>> >>> Then fix it. >>> >> >> I didn't know where to begin > > If you have access to a university library, read journals. Halmos wrote > a paper called 'How to write mathematics' I don't know if it's relevant > but someone reading this might. If you've got time and money do a post > graduate degree-- I will literally be dead before then I have stage three cancer. > not only might you learn how to write mathematics (by > imitation) you might also learn that your not as clever as you think you > are. The easily verifiable fact that there have literally been zero errors pointed out in my sound deductive inference in six months provides very compelling evidence otherwise. The closest thing to an error that anyone pointed out in the last six months was merely a very difficult part of my sound deductive inference that others failed to comprehend. >> on this except for asking for a computer science professor to coach me. >> >> Now I do know where to begin on this this paper seems to be a good >> model: https://dl.acm.org/doi/abs/10.1145/24658.24665 No copy is >> available online so I got one from my university. >> >> The other issue doesn't seem to have much of an alternative. A key >> part of the problem that allowed the halting problem to continue to >> exist is that it was only analyzed using Turing machines. >> >> When analyzed this way almost all of the details must simply be >> imagined rather than explicitly specified. This left huge gaps in the >> reasoning about the halting problem. >> >> I cannot convert my proof to the Turing machine model of computation >> away from the RASP equivalent model of c/x86 without losing the steps >> of my sound deductive inference that prove that my analysis is correct. >> >> 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]
| From | Peter <peterxpercival@hotmail.com> |
|---|---|
| Date | 2021-07-02 14:16 +0100 |
| Message-ID | <sbn3j9$6rk$1@gioia.aioe.org> |
| In reply to | #35585 |
olcott wrote: > On 7/1/2021 5:05 PM, Peter wrote: >> olcott wrote: >>> On 6/30/2021 11:01 AM, Peter wrote: >>>> olcott wrote: >>>>> Because my writing style is not in the ballpark of academic quality >>>>> [...] >>>> >>>> Then fix it. >>>> >>> >>> I didn't know where to begin >> >> If you have access to a university library, read journals. Halmos >> wrote a paper called 'How to write mathematics' I don't know if it's >> relevant but someone reading this might. If you've got time and money >> do a post graduate degree-- > > I will literally be dead before then I have stage three cancer. > >> not only might you learn how to write mathematics (by imitation) you >> might also learn that your not as clever as you think you are. "you're" not "your". > > The easily verifiable fact that there have literally been zero errors > pointed out in my sound deductive inference in six months provides very > compelling evidence otherwise. Only you are making it impossible for you to become aware of your own limitations. > > The closest thing to an error that anyone pointed out in the last six > months was merely a very difficult part of my sound deductive inference > that others failed to comprehend. > >>> on this except for asking for a computer science professor to coach me. >>> >>> Now I do know where to begin on this this paper seems to be a good >>> model: https://dl.acm.org/doi/abs/10.1145/24658.24665 No copy is >>> available online so I got one from my university. >>> >>> The other issue doesn't seem to have much of an alternative. A key >>> part of the problem that allowed the halting problem to continue to >>> exist is that it was only analyzed using Turing machines. >>> >>> When analyzed this way almost all of the details must simply be >>> imagined rather than explicitly specified. This left huge gaps in the >>> reasoning about the halting problem. >>> >>> I cannot convert my proof to the Turing machine model of computation >>> away from the RASP equivalent model of c/x86 without losing the steps >>> of my sound deductive inference that prove that my analysis is correct. >>> >>> Halting problem undecidability and infinitely nested simulation >>> >>> https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation >>> >>> >>> >>> >> >> > > -- The world will little note, nor long remember what we say here Abraham Lincoln at Gettysburg
[toc] | [prev] | [next] | [standalone]
Page 7 of 8 — ← Prev page 1 2 3 4 5 6 [7] 8 Next page →
Back to top | Article view | comp.theory
csiph-web