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 3 of 8 — ← Prev page 1 2 [3] 4 5 6 7 8 Next page →
| From | Daniel Pehoushek <pehoushek1@gmail.com> |
|---|---|
| Date | 2021-06-28 09:40 -0700 |
| Message-ID | <b5750750-13bf-4928-90b4-a224ff622710n@googlegroups.com> |
| In reply to | #35491 |
to olcott: get the hell out.
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]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-06-28 19:19 -0400 |
| Message-ID | <1OsCI.865543$nn2.357071@fx48.iad> |
| In reply to | #35491 |
On 6/28/21 12:35 PM, olcott wrote:
> On 6/28/2021 11:09 AM, David Brown wrote:
>> On 28/06/2021 15: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.
>>>
>>> No one here has ever pointed out any actual error in the essence of my
>>> work and it is a damned lie to say that they have.
>>>
>>> I did make a huge mistake when I was discussing the diagonalization
>>> proof.
>>>
>>
>> No one needs to read your arguments to know that you have made a
>> fundamental mistake. The same would apply if you claimed to have
>> trisected an angle, squared a circle, found an odd number divisible by
>> 2, or any other problem that have been proven impossible.
>>
>
> // 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);
> }
>
> Everyone knows that H cannot possibly return the correct halt status of
> H(P,P) to P.
THERE you just admitted you are wrong. H cannpt possible return the
correct halt status.
> No one has even considered that a simulating halt decider H
> would abort its simulation of P and correctly report that P(P) never
> halts on the basis that P(P) specifies infinitely nested simulation.
>
Nope, that case IS covered, and it STILL gives the fact that it can't
give the right answer. The only way that H can avoid giving the wrong
answer is to not give an answer, but then it fails to be a decider.
PERIOD.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-29 18:14 -0500 |
| Message-ID | <a9ednZsuxJXYNEb9nZ2dnUU7-UnNnZ2d@giganews.com> |
| In reply to | #35513 |
On 6/28/2021 6:19 PM, Richard Damon wrote:
> On 6/28/21 12:35 PM, olcott wrote:
>> On 6/28/2021 11:09 AM, David Brown wrote:
>>> On 28/06/2021 15: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.
>>>>
>>>> No one here has ever pointed out any actual error in the essence of my
>>>> work and it is a damned lie to say that they have.
>>>>
>>>> I did make a huge mistake when I was discussing the diagonalization
>>>> proof.
>>>>
>>>
>>> No one needs to read your arguments to know that you have made a
>>> fundamental mistake. The same would apply if you claimed to have
>>> trisected an angle, squared a circle, found an odd number divisible by
>>> 2, or any other problem that have been proven impossible.
>>>
>>
>> // 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);
>> }
>>
>> Everyone knows that H cannot possibly return the correct halt status of
>> H(P,P) to P.
>
> THERE you just admitted you are wrong. H cannpt possible return the
> correct halt status.
>
I did not say that nitwit.
I said in the above computation H cannot return the correct halt status
to P because P is calling H in infinitely nested simulation and must
have its simulation aborted before H returns any value to it.
Since I told you this at least 100 times you are a liar and not simply
mistaken.
Halting problem undecidability and infinitely nested simulation
https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation
>
>> No one has even considered that a simulating halt decider H
>> would abort its simulation of P and correctly report that P(P) never
>> halts on the basis that P(P) specifies infinitely nested simulation.
>>
>
> Nope, that case IS covered, and it STILL gives the fact that it can't
> give the right answer. The only way that H can avoid giving the wrong
> answer is to not give an answer, but then it fails to be a decider.
>
>
> PERIOD.
>
>
--
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-06-30 22:09 -0400 |
| Message-ID | <wt9DI.7072$NP.4258@fx42.iad> |
| In reply to | #35529 |
On 6/29/21 7:14 PM, olcott wrote:
> On 6/28/2021 6:19 PM, Richard Damon wrote:
>> On 6/28/21 12:35 PM, olcott wrote:
>>> On 6/28/2021 11:09 AM, David Brown wrote:
>>>> On 28/06/2021 15: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.
>>>>>
>>>>> No one here has ever pointed out any actual error in the essence of my
>>>>> work and it is a damned lie to say that they have.
>>>>>
>>>>> I did make a huge mistake when I was discussing the diagonalization
>>>>> proof.
>>>>>
>>>>
>>>> No one needs to read your arguments to know that you have made a
>>>> fundamental mistake. The same would apply if you claimed to have
>>>> trisected an angle, squared a circle, found an odd number divisible by
>>>> 2, or any other problem that have been proven impossible.
>>>>
>>>
>>> // 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);
>>> }
>>>
>>> Everyone knows that H cannot possibly return the correct halt status of
>>> H(P,P) to P.
>>
>> THERE you just admitted you are wrong. H cannpt possible return the
>> correct halt status.
>>
>
> I did not say that nitwit.
Your EXACT statement (as I quoted) was:
>
> Everyone knows that H cannot possibly return the correct halt status of H(P,P) to P.
Which is exactly what I said.
>
> I said in the above computation H cannot return the correct halt status
> to P because P is calling H in infinitely nested simulation and must
> have its simulation aborted before H returns any value to it.
That is NOT what you said. Read your words.
This above statement is just illogical drivel.
Since the Test case is to run the program with main calling P(P), then
in this case that top level P can't be aborted by the copy of H that is
in it, as it isn't being simulated by any H.
That H, as you have declared, aborts the simulation and then continues
on, presumably to return the answer to either main (in the exampl above
when main calls H) or to P when main calls P which uses H.
Thus the ONLY meaning of H cannot return the correct halt status is that
whatever answer H returns is wrong, that or H fails to meet the basic
requirements of a decider by not answering the question of by not being
a proper computation.
>
> Since I told you this at least 100 times you are a liar and not simply
> mistaken.
>
> Halting problem undecidability and infinitely nested simulation
>
> https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation
>
Which i full of errors as I am working on a grand rebunk.
First one is that it ignore the actual definition of what Halting is.
Wrong Definition, wrong results.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-30 22:23 -0500 |
| Message-ID | <KYGdnfQDgLTTqED9nZ2dnUU7-TfNnZ2d@giganews.com> |
| In reply to | #35555 |
On 6/30/2021 9:09 PM, Richard Damon wrote:
> On 6/29/21 7:14 PM, olcott wrote:
>> On 6/28/2021 6:19 PM, Richard Damon wrote:
>>> On 6/28/21 12:35 PM, olcott wrote:
>>>> On 6/28/2021 11:09 AM, David Brown wrote:
>>>>> On 28/06/2021 15: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.
>>>>>>
>>>>>> No one here has ever pointed out any actual error in the essence of my
>>>>>> work and it is a damned lie to say that they have.
>>>>>>
>>>>>> I did make a huge mistake when I was discussing the diagonalization
>>>>>> proof.
>>>>>>
>>>>>
>>>>> No one needs to read your arguments to know that you have made a
>>>>> fundamental mistake. The same would apply if you claimed to have
>>>>> trisected an angle, squared a circle, found an odd number divisible by
>>>>> 2, or any other problem that have been proven impossible.
>>>>>
>>>>
>>>> // 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);
>>>> }
>>>>
>>>> Everyone knows that H cannot possibly return the correct halt status of
>>>> H(P,P) to P.
>>>
>>> THERE you just admitted you are wrong. H cannpt possible return the
>>> correct halt status.
>>>
>>
>> I did not say that nitwit.
>
> Your EXACT statement (as I quoted) was:
>
>>
>> Everyone knows that H cannot possibly return the correct halt status of H(P,P) to P.
>
> Which is exactly what I said.
>
>>
>> I said in the above computation H cannot return the correct halt status
>> to P because P is calling H in infinitely nested simulation and must
>> have its simulation aborted before H returns any value to it.
>
> That is NOT what you said. Read your words.
>
> This above statement is just illogical drivel.
>
As I have repeated many many times even though H cannot possibly return
a correct halt status to P.
IN THE ABOVE COMPUTATION NOT SOME OTHER DIFFERENT COMPUTATION
IN THE ABOVE COMPUTATION NOT SOME OTHER DIFFERENT COMPUTATION
IN THE ABOVE COMPUTATION NOT SOME OTHER DIFFERENT COMPUTATION
IN THE ABOVE COMPUTATION NOT SOME OTHER DIFFERENT COMPUTATION
IN THE ABOVE COMPUTATION NOT SOME OTHER DIFFERENT COMPUTATION
H does correctly abort the simulation of P and correct returns 0 (for
not halting) to main().
The halting problem proofs are wrong because they never freaking
bothered to examine all of the details of what happens when H is a
SIMULATING HALT DECIDER.
The halting problem proofs are wrong because they never freaking
bothered to examine all of the details of what happens when H is a
SIMULATING HALT DECIDER.
The halting problem proofs are wrong because they never freaking
bothered to examine all of the details of what happens when H is a
SIMULATING HALT DECIDER.
The halting problem proofs are wrong because they never freaking
bothered to examine all of the details of what happens when H is a
SIMULATING HALT DECIDER.
The halting problem proofs are wrong because they never freaking
bothered to examine all of the details of what happens when H is a
SIMULATING HALT DECIDER.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | "dklei...@gmail.com" <dkleinecke@gmail.com> |
|---|---|
| Date | 2021-06-30 20:53 -0700 |
| Message-ID | <14665f91-4483-41aa-93c4-5050ad68bc26n@googlegroups.com> |
| In reply to | #35558 |
On Wednesday, June 30, 2021 at 8:24:05 PM UTC-7, olcott wrote:
> On 6/30/2021 9:09 PM, Richard Damon wrote:
> > On 6/29/21 7:14 PM, olcott wrote:
> >> On 6/28/2021 6:19 PM, Richard Damon wrote:
> >>> On 6/28/21 12:35 PM, olcott wrote:
> >>>> On 6/28/2021 11:09 AM, David Brown wrote:
> >>>>> On 28/06/2021 15: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.
> >>>>>>
> >>>>>> No one here has ever pointed out any actual error in the essence of my
> >>>>>> work and it is a damned lie to say that they have.
> >>>>>>
> >>>>>> I did make a huge mistake when I was discussing the diagonalization
> >>>>>> proof.
> >>>>>>
> >>>>>
> >>>>> No one needs to read your arguments to know that you have made a
> >>>>> fundamental mistake. The same would apply if you claimed to have
> >>>>> trisected an angle, squared a circle, found an odd number divisible by
> >>>>> 2, or any other problem that have been proven impossible.
> >>>>>
> >>>>
> >>>> // 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);
> >>>> }
> >>>>
> >>>> Everyone knows that H cannot possibly return the correct halt status of
> >>>> H(P,P) to P.
> >>>
> >>> THERE you just admitted you are wrong. H cannpt possible return the
> >>> correct halt status.
> >>>
> >>
> >> I did not say that nitwit.
> >
> > Your EXACT statement (as I quoted) was:
> >
> >>
> >> Everyone knows that H cannot possibly return the correct halt status of H(P,P) to P.
> >
> > Which is exactly what I said.
> >
> >>
> >> I said in the above computation H cannot return the correct halt status
> >> to P because P is calling H in infinitely nested simulation and must
> >> have its simulation aborted before H returns any value to it.
> >
> > That is NOT what you said. Read your words.
> >
> > This above statement is just illogical drivel.
> >
> As I have repeated many many times even though H cannot possibly return
> a correct halt status to P.
>
> IN THE ABOVE COMPUTATION NOT SOME OTHER DIFFERENT COMPUTATION
> IN THE ABOVE COMPUTATION NOT SOME OTHER DIFFERENT COMPUTATION
> IN THE ABOVE COMPUTATION NOT SOME OTHER DIFFERENT COMPUTATION
> IN THE ABOVE COMPUTATION NOT SOME OTHER DIFFERENT COMPUTATION
> IN THE ABOVE COMPUTATION NOT SOME OTHER DIFFERENT COMPUTATION
>
> H does correctly abort the simulation of P and correct returns 0 (for
> not halting) to main().
>
> The halting problem proofs are wrong because they never freaking
> bothered to examine all of the details of what happens when H is a
> SIMULATING HALT DECIDER.
>
> The halting problem proofs are wrong because they never freaking
> bothered to examine all of the details of what happens when H is a
> SIMULATING HALT DECIDER.
>
> The halting problem proofs are wrong because they never freaking
> bothered to examine all of the details of what happens when H is a
> SIMULATING HALT DECIDER.
>
> The halting problem proofs are wrong because they never freaking
> bothered to examine all of the details of what happens when H is a
> SIMULATING HALT DECIDER.
>
> The halting problem proofs are wrong because they never freaking
> bothered to examine all of the details of what happens when H is a
> SIMULATING HALT DECIDER.
>
And what then is the definition of SIMULATING HALT DECIDER?
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-30 23:01 -0500 |
| Message-ID | <N6-dnVpSVLq3o0D9nZ2dnUU7-S_NnZ2d@giganews.com> |
| In reply to | #35559 |
On 6/30/2021 10:53 PM, dklei...@gmail.com wrote:
> On Wednesday, June 30, 2021 at 8:24:05 PM UTC-7, olcott wrote:
>> On 6/30/2021 9:09 PM, Richard Damon wrote:
>>> On 6/29/21 7:14 PM, olcott wrote:
>>>> On 6/28/2021 6:19 PM, Richard Damon wrote:
>>>>> On 6/28/21 12:35 PM, olcott wrote:
>>>>>> On 6/28/2021 11:09 AM, David Brown wrote:
>>>>>>> On 28/06/2021 15: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.
>>>>>>>>
>>>>>>>> No one here has ever pointed out any actual error in the essence of my
>>>>>>>> work and it is a damned lie to say that they have.
>>>>>>>>
>>>>>>>> I did make a huge mistake when I was discussing the diagonalization
>>>>>>>> proof.
>>>>>>>>
>>>>>>>
>>>>>>> No one needs to read your arguments to know that you have made a
>>>>>>> fundamental mistake. The same would apply if you claimed to have
>>>>>>> trisected an angle, squared a circle, found an odd number divisible by
>>>>>>> 2, or any other problem that have been proven impossible.
>>>>>>>
>>>>>>
>>>>>> // 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);
>>>>>> }
>>>>>>
>>>>>> Everyone knows that H cannot possibly return the correct halt status of
>>>>>> H(P,P) to P.
>>>>>
>>>>> THERE you just admitted you are wrong. H cannpt possible return the
>>>>> correct halt status.
>>>>>
>>>>
>>>> I did not say that nitwit.
>>>
>>> Your EXACT statement (as I quoted) was:
>>>
>>>>
>>>> Everyone knows that H cannot possibly return the correct halt status of H(P,P) to P.
>>>
>>> Which is exactly what I said.
>>>
>>>>
>>>> I said in the above computation H cannot return the correct halt status
>>>> to P because P is calling H in infinitely nested simulation and must
>>>> have its simulation aborted before H returns any value to it.
>>>
>>> That is NOT what you said. Read your words.
>>>
>>> This above statement is just illogical drivel.
>>>
>> As I have repeated many many times even though H cannot possibly return
>> a correct halt status to P.
>>
>> IN THE ABOVE COMPUTATION NOT SOME OTHER DIFFERENT COMPUTATION
>> IN THE ABOVE COMPUTATION NOT SOME OTHER DIFFERENT COMPUTATION
>> IN THE ABOVE COMPUTATION NOT SOME OTHER DIFFERENT COMPUTATION
>> IN THE ABOVE COMPUTATION NOT SOME OTHER DIFFERENT COMPUTATION
>> IN THE ABOVE COMPUTATION NOT SOME OTHER DIFFERENT COMPUTATION
>>
>> H does correctly abort the simulation of P and correct returns 0 (for
>> not halting) to main().
>>
>> The halting problem proofs are wrong because they never freaking
>> bothered to examine all of the details of what happens when H is a
>> SIMULATING HALT DECIDER.
>>
>> The halting problem proofs are wrong because they never freaking
>> bothered to examine all of the details of what happens when H is a
>> SIMULATING HALT DECIDER.
>>
>> The halting problem proofs are wrong because they never freaking
>> bothered to examine all of the details of what happens when H is a
>> SIMULATING HALT DECIDER.
>>
>> The halting problem proofs are wrong because they never freaking
>> bothered to examine all of the details of what happens when H is a
>> SIMULATING HALT DECIDER.
>>
>> The halting problem proofs are wrong because they never freaking
>> bothered to examine all of the details of what happens when H is a
>> SIMULATING HALT DECIDER.
>>
> And what then is the definition of SIMULATING HALT DECIDER?
>
It is in my paper, let me know if it needs clarification.
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-06-30 23:31 -0700 |
| Message-ID | <a1fa866b-0657-46c2-9233-f5e7b0b6500en@googlegroups.com> |
| In reply to | #35560 |
i have decided olcott must halt
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-07-01 07:08 -0400 |
| Message-ID | <xmhDI.16048$Vj7.12637@fx46.iad> |
| In reply to | #35558 |
On 6/30/21 11:23 PM, olcott wrote:
> On 6/30/2021 9:09 PM, Richard Damon wrote:
>> On 6/29/21 7:14 PM, olcott wrote:
>>> On 6/28/2021 6:19 PM, Richard Damon wrote:
>>>> On 6/28/21 12:35 PM, olcott wrote:
>>>>> On 6/28/2021 11:09 AM, David Brown wrote:
>>>>>> On 28/06/2021 15: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.
>>>>>>>
>>>>>>> No one here has ever pointed out any actual error in the essence
>>>>>>> of my
>>>>>>> work and it is a damned lie to say that they have.
>>>>>>>
>>>>>>> I did make a huge mistake when I was discussing the diagonalization
>>>>>>> proof.
>>>>>>>
>>>>>>
>>>>>> No one needs to read your arguments to know that you have made a
>>>>>> fundamental mistake. The same would apply if you claimed to have
>>>>>> trisected an angle, squared a circle, found an odd number
>>>>>> divisible by
>>>>>> 2, or any other problem that have been proven impossible.
>>>>>>
>>>>>
>>>>> // 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);
>>>>> }
>>>>>
>>>>> Everyone knows that H cannot possibly return the correct halt
>>>>> status of
>>>>> H(P,P) to P.
>>>>
>>>> THERE you just admitted you are wrong. H cannpt possible return the
>>>> correct halt status.
>>>>
>>>
>>> I did not say that nitwit.
>>
>> Your EXACT statement (as I quoted) was:
>>
>>>
>>> Everyone knows that H cannot possibly return the correct halt status
>>> of H(P,P) to P.
>>
>> Which is exactly what I said.
>>
>>>
>>> I said in the above computation H cannot return the correct halt status
>>> to P because P is calling H in infinitely nested simulation and must
>>> have its simulation aborted before H returns any value to it.
>>
>> That is NOT what you said. Read your words.
>>
>> This above statement is just illogical drivel.
>>
>
> As I have repeated many many times even though H cannot possibly return
> a correct halt status to P.
Right, It is IMPOSSIBLE for H to return the correrct answer because
whatever answer it returns will let P do the opposite.
>
> IN THE ABOVE COMPUTATION NOT SOME OTHER DIFFERENT COMPUTATION
> IN THE ABOVE COMPUTATION NOT SOME OTHER DIFFERENT COMPUTATION
> IN THE ABOVE COMPUTATION NOT SOME OTHER DIFFERENT COMPUTATION
> IN THE ABOVE COMPUTATION NOT SOME OTHER DIFFERENT COMPUTATION
> IN THE ABOVE COMPUTATION NOT SOME OTHER DIFFERENT COMPUTATION
Yes, we are talking abot two computatons and the relationship between
the results.
We have H(P,P), which we have your claim that it will return non-Halting.
We have P(P) which includes within it the computaton H(P,P), and if
H(P,P) is non-Halting, then P(P) will be Halting.
Thus the answer H gave was wrong.
>
> H does correctly abort the simulation of P and correct returns 0 (for
> not halting) to main().
FALSE. H says P(P) is non-halting, but the computation P(P) is halting.
That is the wrong answer.
>
> The halting problem proofs are wrong because they never freaking
> bothered to examine all of the details of what happens when H is a
> SIMULATING HALT DECIDER.
But THEY DID, because they looked at an H without limited how it did its
answer. Linz does not fail to consider that case, because he doesn't
consider any particular method of H working.
The definition of Halting is INDEPENDENT of how the decider operates,
despite the fact that you want to try to come up with some alternate
definition of Halting for a simulating decider, all that rule does is
help you define correctly deciding.
Halting IS Halting. P(P) Halts, you even admit that yourself. You just
seem to want to define some alternate definition of Halting that differs
from that. THAT IS ILLOGICAL.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-07-01 10:41 -0500 |
| Subject | Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] |
| Message-ID | <6KydnWYp7cqtf0D9nZ2dnUU7-aXNnZ2d@giganews.com> |
| In reply to | #35567 |
On 7/1/2021 6:08 AM, Richard Damon wrote:
> On 6/30/21 11:23 PM, olcott wrote:
>> On 6/30/2021 9:09 PM, Richard Damon wrote:
>>> On 6/29/21 7:14 PM, olcott wrote:
>>>> On 6/28/2021 6:19 PM, Richard Damon wrote:
>>>>> On 6/28/21 12:35 PM, olcott wrote:
>>>>>> On 6/28/2021 11:09 AM, David Brown wrote:
>>>>>>> On 28/06/2021 15: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.
>>>>>>>>
>>>>>>>> No one here has ever pointed out any actual error in the essence
>>>>>>>> of my
>>>>>>>> work and it is a damned lie to say that they have.
>>>>>>>>
>>>>>>>> I did make a huge mistake when I was discussing the diagonalization
>>>>>>>> proof.
>>>>>>>>
>>>>>>>
>>>>>>> No one needs to read your arguments to know that you have made a
>>>>>>> fundamental mistake. The same would apply if you claimed to have
>>>>>>> trisected an angle, squared a circle, found an odd number
>>>>>>> divisible by
>>>>>>> 2, or any other problem that have been proven impossible.
>>>>>>>
>>>>>>
>>>>>> // 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);
>>>>>> }
>>>>>>
>>>>>> Everyone knows that H cannot possibly return the correct halt
>>>>>> status of
>>>>>> H(P,P) to P.
>>>>>
>>>>> THERE you just admitted you are wrong. H cannpt possible return the
>>>>> correct halt status.
>>>>>
>>>>
>>>> I did not say that nitwit.
>>>
>>> Your EXACT statement (as I quoted) was:
>>>
>>>>
>>>> Everyone knows that H cannot possibly return the correct halt status
>>>> of H(P,P) to P.
>>>
>>> Which is exactly what I said.
>>>
>>>>
>>>> I said in the above computation H cannot return the correct halt status
>>>> to P because P is calling H in infinitely nested simulation and must
>>>> have its simulation aborted before H returns any value to it.
>>>
>>> That is NOT what you said. Read your words.
>>>
>>> This above statement is just illogical drivel.
>>>
>>
>> As I have repeated many many times even though H cannot possibly return
>> a correct halt status to P.
>
> Right, It is IMPOSSIBLE for H to return the correrct answer because
> whatever answer it returns will let P do the opposite.
>
>>
>> IN THE ABOVE COMPUTATION NOT SOME OTHER DIFFERENT COMPUTATION
>> IN THE ABOVE COMPUTATION NOT SOME OTHER DIFFERENT COMPUTATION
>> IN THE ABOVE COMPUTATION NOT SOME OTHER DIFFERENT COMPUTATION
>> IN THE ABOVE COMPUTATION NOT SOME OTHER DIFFERENT COMPUTATION
>> IN THE ABOVE COMPUTATION NOT SOME OTHER DIFFERENT COMPUTATION
>
> Yes, we are talking abot two computatons and the relationship between
> the results.
>
> We have H(P,P), which we have your claim that it will return non-Halting.
>
> We have P(P) which includes within it the computaton H(P,P), and if
> H(P,P) is non-Halting, then P(P) will be Halting.
>
> Thus the answer H gave was wrong.
We can make an undecidable problem by simply phrasing a question such
that correct answers are impossible.
When we ask a guy that has never been married
Have you stopped beating your wife?
The false presupposition of this question forces both answers to this
polar (yes/no) question to be incorrect.
When we transform this same question into an equivalent question that
does not have the false presupposition: Are you currently beating your
wife? then this correct question can be correctly answered.
When the first erroneous question is transformed into an equivalent
question having the error removed the "undecidable" problem becomes
decidable.
We can even do the same thing with the liar Paradox:
LP := This sentence is not true.
Is LP true, No. Then that makes it false? No.
The Liar Paradox is not a truth bearer.
We can do the same thing with the halting problem:
Because a simulating halt decider must always abort the simulation of
every input that never halts its halt deciding criteria must be adapted.
[ Does the input halt on its input? ] must become
[ Does the input halt without having its simulation aborted? ]
This change is required because every input to a simulating halt decider
either halts on its own or halts because its simulation has been aborted.
When this new criteria is understood to be necessarily true on the basis
of the meaning of its words then we have logically justified certainty
that H(P,P)==0 is correct.
Failing to comprehend this is not any rebuttal what-so-ever.
Failing to comprehend this is not any rebuttal what-so-ever.
Failing to comprehend this is not any rebuttal what-so-ever.
Failing to comprehend this is not any rebuttal what-so-ever.
Failing to comprehend this is not any rebuttal what-so-ever.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-07-01 21:23 +0100 |
| Subject | Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] |
| Message-ID | <87im1tiy0a.fsf@bsb.me.uk> |
| In reply to | #35573 |
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. 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. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-07-01 16:25 -0500 |
| Subject | Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] |
| Message-ID | <iZ6dnV1rGdxUr0P9nZ2dnUU7-XXNnZ2d@giganews.com> |
| In reply to | #35580 |
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. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-07-01 16:42 -0500 |
| Subject | Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] |
| Message-ID | <qbKdnUr-BrFWq0P9nZ2dnUU7-WHNnZ2d@giganews.com> |
| In reply to | #35581 |
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.
>>
>
> Ĥ.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.
>
When the entire set of possible {true, false} Boolean return values from
an (input / TM) pair provides an incorrect halting status
this is analogous to the entire set of polar {yes, no} answers for the
wife beating status of a specific person that has never been married.
In the first case both true, false} are the wrong return value from a
Boolean function and in the second case both {Yes, no} are the wrong
answer to a polar question.
>> 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.
>
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-07-02 00:24 +0100 |
| Subject | Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] |
| Message-ID | <871r8hipni.fsf@bsb.me.uk> |
| In reply to | #35583 |
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.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-07-01 18:37 -0500 |
| Subject | Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] |
| Message-ID | <ap6dna5qns9czEP9nZ2dnUU7-afNnZ2d@giganews.com> |
| In reply to | #35587 |
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).
Because you have dodged this question so persistently over the years by
saying that there is a halt status for Ĥ applied to ⟨Ĥ⟩, when this is
clearly NOT the question that I am asking I must suppose that you simply
flat out don't know this answer.
Perhaps it is called an undecidable instance of a decision problem.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-07-02 02:52 +0100 |
| Subject | Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] |
| Message-ID | <87v95th47x.fsf@bsb.me.uk> |
| In reply to | #35588 |
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.
For every actual TM, X, there is a correct yes/no answer for all the
halting problem instances involving X. For every TM for which we can
form X^ (which is all of them if we slightly relax the construction) the
same is also true. I.e. for every TM X, the instance <[X^],[X^]> has a
correct yes/no answer because the computation X^([X^]) either halts or
it does not halt. However, X does not give it.
This is why your Big Lie of Dec 2018 was considered interesting. You
claimed to have an impossible TM pair, fully encoded. Now you simply
claim to have a TM (or "equivalent") that gets the answer wrong. That
possibility was never in doubt. No one is interested in a TM X that
rejects <[X^],[X^]> despite X^([X^]) being a halting computation.
> when this is clearly NOT the question that I am asking I must suppose
> that you simply flat out don't know this answer.
Or you just don't understand what I (and others) have been telling you
for years.
> Perhaps it is called an undecidable instance of a decision problem.
No it is not. It can only be an instance if H (and therefore H^ and
[H^]) exists. Every instance of every decision problem has a correct
yes/no answer. If not, it's not a decision problem. In particular,
every instance of the halting problem has a correct yes/no answer: yes
for the instances the represent halting computation and no for all the
others.
Curiously, the way you've tried to get out of the Big Lie of Dec 2018
has not been to deny that there is a correct answer, but to declare that
"no" is the correct answer for a halting computation. You could accept
that every instance has a correct answer without actually damaging your
current nonsensical claim in any way.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-07-01 21:23 -0500 |
| Subject | Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] |
| Message-ID | <lLudnVSo28Ma5UP9nZ2dnUU7-VnNnZ2d@giganews.com> |
| In reply to | #35589 |
On 7/1/2021 8:52 PM, 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.
>
> For every actual TM, X, there is a correct yes/no answer for all the
> halting problem instances involving X. For every TM for which we can
> form X^ (which is all of them if we slightly relax the construction) the
> same is also true. I.e. for every TM X, the instance <[X^],[X^]> has a
> correct yes/no answer because the computation X^([X^]) either halts or
> it does not halt. However, X does not give it.
>
What is the specific term-of-the-art for the category of the cases of
(TM X / Input I) such that X(I) cannot give the correct answer?
> This is why your Big Lie of Dec 2018 was considered interesting. You
> claimed to have an impossible TM pair, fully encoded. Now you simply
> claim to have a TM (or "equivalent") that gets the answer wrong. That
> possibility was never in doubt. No one is interested in a TM X that
> rejects <[X^],[X^]> despite X^([X^]) being a halting computation.
That I called the RASP equivalent of a TM is a TM is not a fascist Nazi
attempt to subvert Democracy by claiming that the election was stolen.
It is very disgraceful to the many millions of people that have been
murdered by the Nazis (the origin of the term "big lie") for you to use
this term in such a cavalier way.
>> when this is clearly NOT the question that I am asking I must suppose
>> that you simply flat out don't know this answer.
>
> Or you just don't understand what I (and others) have been telling you
> for years.
>
If this was true then "others" could point to at least one technical
mistake in my paper that shows that my sound deductive inference is
incorrect.
Halting problem undecidability and infinitely nested simulation
https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation
>> Perhaps it is called an undecidable instance of a decision problem.
>
> No it is not. It can only be an instance if H (and therefore H^ and
> [H^]) exists. Every instance of every decision problem has a correct
> yes/no answer. If not, it's not a decision problem. In particular,
> every instance of the halting problem has a correct yes/no answer: yes
> for the instances the represent halting computation and no for all the
> others.
>
> Curiously, the way you've tried to get out of the Big Lie of Dec 2018
> has not been to deny that there is a correct answer, but to declare that
> "no" is the correct answer for a halting computation. You could accept
> that every instance has a correct answer without actually damaging your
> current nonsensical claim in any way.
>
You have already agreed with the one axiom of my sound deductive inference.
On 5/11/2021 11:10 AM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> Truism:
>> Every simulation that would never stop unless Halts() stops
>> it at some point specifies infinite execution.
>
> Any algorithm that implements this truism is, of course, a halting
> decider.
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 below).
Conclusion(3) From the above true premises it necessarily follows that
simulating halt decider H correctly reports that its input: (P,P) never
halts.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-07-02 20:02 +0100 |
| Subject | Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] |
| Message-ID | <87sg0wfsjk.fsf@bsb.me.uk> |
| In reply to | #35590 |
olcott <NoOne@NoWhere.com> writes:
> On 7/1/2021 8:52 PM, 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.
>> For every actual TM, X, there is a correct yes/no answer for all the
>> halting problem instances involving X. For every TM for which we can
>> form X^ (which is all of them if we slightly relax the construction) the
>> same is also true. I.e. for every TM X, the instance <[X^],[X^]> has a
>> correct yes/no answer because the computation X^([X^]) either halts or
>> it does not halt. However, X does not give it.
>
> What is the specific term-of-the-art for the category of the cases of
> (TM X / Input I) such that X(I) cannot give the correct answer?
There is none because serious people don't attribute agency to TMs. If
you ask instead what the term is for inputs I such that X(I) is not the
correct answer, then these are just called the cases X gets wrong. You
know that term as well as anyone.
>> This is why your Big Lie of Dec 2018 was considered interesting. You
>> claimed to have an impossible TM pair, fully encoded. Now you simply
>> claim to have a TM (or "equivalent") that gets the answer wrong. That
>> possibility was never in doubt. No one is interested in a TM X that
>> rejects <[X^],[X^]> despite X^([X^]) being a halting computation.
> It is very disgraceful to the many millions of people that have been
> murdered by the Nazis (the origin of the term "big lie") for you to
> use this term in such a cavalier way.
You mean, presumably, disrespectful, but you are quite right. I never
thought of that. Thank you for point it out. I'll call it your Grand
Delusion and I'll also mention the dishonest subsequent cover-up. (I
don't actually think you lied in Dec 2018. You lied afterwards when
walking back the deluded claim you made.)
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-07-02 14:27 -0500 |
| Subject | Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] |
| Message-ID | <HoOdnbsSntc39UL9nZ2dnUU7-TXNnZ2d@giganews.com> |
| In reply to | #35614 |
On 7/2/2021 2:02 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 7/1/2021 8:52 PM, 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.
>>> For every actual TM, X, there is a correct yes/no answer for all the
>>> halting problem instances involving X. For every TM for which we can
>>> form X^ (which is all of them if we slightly relax the construction) the
>>> same is also true. I.e. for every TM X, the instance <[X^],[X^]> has a
>>> correct yes/no answer because the computation X^([X^]) either halts or
>>> it does not halt. However, X does not give it.
>>
>> What is the specific term-of-the-art for the category of the cases of
>> (TM X / Input I) such that X(I) cannot give the correct answer?
>
> There is none because serious people don't attribute agency to TMs. If
> you ask instead what the term is for inputs I such that X(I) is not the
> correct answer, then these are just called the cases X gets wrong. You
> know that term as well as anyone.
>
So then we are back to my own pathological self-reference(olcott 2004).
>>> This is why your Big Lie of Dec 2018 was considered interesting. You
>>> claimed to have an impossible TM pair, fully encoded. Now you simply
>>> claim to have a TM (or "equivalent") that gets the answer wrong. That
>>> possibility was never in doubt. No one is interested in a TM X that
>>> rejects <[X^],[X^]> despite X^([X^]) being a halting computation.
>
>> It is very disgraceful to the many millions of people that have been
>> murdered by the Nazis (the origin of the term "big lie") for you to
>> use this term in such a cavalier way.
>
> You mean, presumably, disrespectful, but you are quite right. I never
> thought of that. Thank you for point it out. I'll call it your Grand
> Delusion and I'll also mention the dishonest subsequent cover-up. (I
> don't actually think you lied in Dec 2018. You lied afterwards when
> walking back the deluded claim you made.)
>
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.
At the point in time I knew that the generic idea of Turing equivalence
was correct yet had no idea that anyone else in the field understood this.
A fully encoded Turing machine is equivalent to a fully encoded RASP
machine which is equivalent to an x86 virtual machine which is
equivalent to the C source code of this x86 virtual machine.
When I pointed out that you already agreed with the one axiom of my
proof (sound deductive inference) and the second premise is easily
verified as an established fact, apparently all that is left to keep up
the ruse of your fake rebuttal is STUTTER.
On 5/11/2021 11:10 AM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> Truism:
>> Every simulation that would never stop unless Halts() stops
>> it at some point specifies infinite execution.
>
> Any algorithm that implements this truism is, of course, a halting
> decider.
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 below).
When the simulator is determining whether or not it must abort the
simulation of its input based on the behavior of its input the simulator
must only examine the behavior of its input and must ignore its own
behavior.
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]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-07-02 23:16 +0100 |
| Subject | Re: Why don't I simply submit my paper to an academic journal for review?[ incorrect questions ] |
| Message-ID | <87mtr4fjko.fsf@bsb.me.uk> |
| In reply to | #35615 |
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. 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. -- Ben.
[toc] | [prev] | [next] | [standalone]
Page 3 of 8 — ← Prev page 1 2 [3] 4 5 6 7 8 Next page →
Back to top | Article view | comp.theory
csiph-web