Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #35200 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2021-06-20 23:15 -0500 |
| Last post | 2021-06-22 12:25 -0700 |
| Articles | 20 on this page of 198 — 11 participants |
Back to article view | Back to comp.theory
What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-20 23:15 -0500
Re: What if a cat barks? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-20 22:04 -0700
Re: What if a cat barks? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-21 12:16 +0100
Re: What if a cat barks? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-21 17:15 -0700
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-21 20:07 -0500
Re: What if a cat barks? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-21 18:35 -0700
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-21 20:40 -0500
Re: What if a cat barks? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-21 18:42 -0700
Re: What if a cat barks? Richard Damon <Richard@Damon-Family.org> - 2021-06-21 21:54 -0400
Re: What if a cat barks? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-22 12:22 -0700
Re: What if a cat barks? Richard Damon <Richard@Damon-Family.org> - 2021-06-22 18:57 -0400
Re: What if a cat barks? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-22 16:07 -0700
Re: What if a cat barks? wij <wyniijj@gmail.com> - 2021-06-22 17:45 -0700
Re: What if a cat barks? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-24 16:26 -0700
Re: What if a cat barks? wij <wyniijj@gmail.com> - 2021-06-25 00:39 -0700
Re: What if a cat barks? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-26 14:40 -0700
Re: What if a cat barks? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-23 02:47 +0100
Re: What if a cat barks? [ sound deduction proves that I am correct ] olcott <NoOne@NoWhere.com> - 2021-06-22 21:15 -0500
Re: What if a cat barks? [ sound deduction proves that I am correct ] Richard Damon <Richard@Damon-Family.org> - 2021-06-22 23:00 -0400
Re: What if a cat barks? [ sound deduction proves that I am correct ] olcott <NoOne@NoWhere.com> - 2021-06-22 22:21 -0500
Re: What if a cat barks? [ sound deduction proves that I am correct ] Richard Damon <Richard@Damon-Family.org> - 2021-06-23 06:57 -0400
Re: What if a cat barks? [ sound deduction proves that I am correct ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-06-23 05:25 -0700
Re: What if a cat barks? [ sound deduction proves that I am correct ] olcott <NoOne@NoWhere.com> - 2021-06-23 10:33 -0500
Re: What if a cat barks? [ sound deduction proves that I am correct ] Richard Damon <Richard@Damon-Family.org> - 2021-06-23 21:09 -0400
Re: What if a cat barks? [ sound deduction proves that I am correct ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-23 17:00 +0100
Re: What if a cat barks? [ sound deduction proves that I am correct ] olcott <NoOne@NoWhere.com> - 2021-06-23 11:12 -0500
Re: What if a cat barks? [ sound deduction proves that I am correct ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-06-24 02:40 -0700
Re: What if a cat barks? [ sound deduction proves that I am correct ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-24 11:49 +0100
Re: What if a cat barks? [ sound deduction proves that I am correct ] olcott <NoOne@NoWhere.com> - 2021-06-24 10:39 -0500
Re: What if a cat barks? [ sound deduction proves that I am correct ] Richard Damon <Richard@Damon-Family.org> - 2021-06-24 22:51 -0400
Re: What if a cat barks? [ sound deduction proves that I am correct ] olcott <NoOne@NoWhere.com> - 2021-06-24 10:25 -0500
Re: What if a cat barks? [ sound deduction proves that I am correct ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-06-24 08:47 -0700
Re: What if a cat barks? [ sound deduction proves that I am correct ] olcott <NoOne@NoWhere.com> - 2021-06-24 11:03 -0500
Re: What if a cat barks? [ sound deduction proves that I am correct ] Richard Damon <Richard@Damon-Family.org> - 2021-06-23 21:23 -0400
Re: What if a cat barks? [ sound deduction proves that I am correct ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-23 11:01 +0100
Re: What if a cat barks? [ sound deduction proves that I am correct ] olcott <NoOne@NoWhere.com> - 2021-06-23 10:35 -0500
Re: What if a cat barks? André G. Isaak <agisaak@gm.invalid> - 2021-06-21 12:24 -0600
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-21 16:11 -0500
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-21 16:26 -0500
Re: What if a cat barks? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-21 14:58 -0700
Re: What if a cat barks? Richard Damon <Richard@Damon-Family.org> - 2021-06-21 20:03 -0400
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-21 19:37 -0500
Re: What if a cat barks? André G. Isaak <agisaak@gm.invalid> - 2021-06-21 19:05 -0600
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-21 20:48 -0500
Re: What if a cat barks? Richard Damon <Richard@Damon-Family.org> - 2021-06-21 22:02 -0400
Re: What if a cat barks? Richard Damon <Richard@Damon-Family.org> - 2021-06-21 21:17 -0400
Re: What if a cat barks? André G. Isaak <agisaak@gm.invalid> - 2021-06-21 18:57 -0600
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-21 20:39 -0500
Re: What if a cat barks? Richard Damon <Richard@Damon-Family.org> - 2021-06-21 22:22 -0400
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-21 21:29 -0500
Re: What if a cat barks? Richard Damon <Richard@Damon-Family.org> - 2021-06-22 07:00 -0400
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-22 09:23 -0500
Re: What if a cat barks? Richard Damon <Richard@Damon-Family.org> - 2021-06-22 18:40 -0400
Re: What if a cat barks? André G. Isaak <agisaak@gm.invalid> - 2021-06-21 20:29 -0600
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-21 22:09 -0500
Re: What if a cat barks? André G. Isaak <agisaak@gm.invalid> - 2021-06-22 10:47 -0600
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-22 12:05 -0500
Re: What if a cat barks? André G. Isaak <agisaak@gm.invalid> - 2021-06-22 12:38 -0600
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-22 14:17 -0500
Re: What if a cat barks? André G. Isaak <agisaak@gm.invalid> - 2021-06-23 11:29 -0600
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-23 15:07 -0500
Re: What if a cat barks? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-23 15:12 -0700
Re: What if a cat barks? André G. Isaak <agisaak@gm.invalid> - 2021-06-23 17:13 -0600
Re: What if a cat barks? [ sound deduction is a proof ] olcott <NoOne@NoWhere.com> - 2021-06-23 19:01 -0500
Re: What if a cat barks? [ sound deduction is a proof ] André G. Isaak <agisaak@gm.invalid> - 2021-06-23 18:49 -0600
Re: What if a cat barks? [ sound deduction is a proof ] olcott <NoOne@NoWhere.com> - 2021-06-23 22:03 -0500
Re: What if a cat barks? [ sound deduction is a proof ] Richard Damon <Richard@Damon-Family.org> - 2021-06-24 07:29 -0400
Re: What if a cat barks? [ sound deduction is a proof ](axiom) olcott <NoOne@NoWhere.com> - 2021-06-24 10:42 -0500
Re: What if a cat barks? [ sound deduction is a proof ](axiom) Richard Damon <Richard@Damon-Family.org> - 2021-06-24 22:39 -0400
Re: What if a cat barks? [ sound deduction is a proof ](axiom) olcott <NoOne@NoWhere.com> - 2021-06-25 11:33 -0500
Re: What if a cat barks? [ sound deduction is a proof ](axiom) Richard Damon <Richard@Damon-Family.org> - 2021-06-25 13:14 -0400
Re: What if a cat barks? [ sound deduction is a proof ](axiom) olcott <NoOne@NoWhere.com> - 2021-06-25 13:50 -0500
Re: What if a cat barks? [ sound deduction is a proof ](axiom) Richard Damon <Richard@Damon-Family.org> - 2021-06-25 16:11 -0400
Re: What if a cat barks? [ sound deduction is a proof ](axiom) olcott <NoOne@NoWhere.com> - 2021-06-25 15:40 -0500
Re: What if a cat barks? [ sound deduction is a proof ](axiom) Richard Damon <Richard@Damon-Family.org> - 2021-06-25 17:59 -0400
Re: What if a cat barks? [ sound deduction is a proof ](axiom) olcott <NoOne@NoWhere.com> - 2021-06-25 17:56 -0500
Re: What if a cat barks? [ sound deduction is a proof ](axiom) Richard Damon <Richard@Damon-Family.org> - 2021-06-25 20:40 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-25 20:01 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-25 21:37 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-25 20:46 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-25 22:07 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-25 22:07 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-26 01:11 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Jeff Barnett <jbb@notatt.com> - 2021-06-26 04:27 -0600
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-26 15:51 +0100
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(Ben lies) olcott <NoOne@NoWhere.com> - 2021-06-26 10:52 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(Ben lies) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 12:08 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-26 11:18 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 13:38 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(Ben lies) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-26 18:57 +0100
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(Ben lies) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 14:12 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(Ben lies) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-26 11:43 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) olcott <NoOne@NoWhere.com> - 2021-06-26 19:01 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 20:32 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) olcott <NoOne@NoWhere.com> - 2021-06-26 19:54 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-26 18:03 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 21:08 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-26 20:39 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 22:06 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(dumber than a box of rocks ) olcott <NoOne@NoWhere.com> - 2021-06-27 09:43 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(dumber than a box of rocks ) Richard Damon <Richard@Damon-Family.org> - 2021-06-27 13:10 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(dumber than a box of rocks ) olcott <NoOne@NoWhere.com> - 2021-06-27 13:00 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(dumber than a box of rocks ) Richard Damon <Richard@Damon-Family.org> - 2021-06-27 15:40 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(liar liar pants on fire ) olcott <NoOne@NoWhere.com> - 2021-06-27 15:04 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(liar liar pants on fire ) Richard Damon <Richard@Damon-Family.org> - 2021-06-27 16:17 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(liar liar pants on fire ) olcott <NoOne@NoWhere.com> - 2021-06-27 17:46 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(liar liar pants on fire ) Richard Damon <Richard@Damon-Family.org> - 2021-06-27 19:03 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(liar liar pants on fire ) olcott <NoOne@NoWhere.com> - 2021-06-27 18:11 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(liar liar pants on fire ) Richard Damon <Richard@Damon-Family.org> - 2021-06-27 19:57 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-27 01:42 +0100
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-26 17:48 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) olcott <NoOne@NoWhere.com> - 2021-06-26 20:05 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-26 18:09 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-26 18:13 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(I dare you) olcott <NoOne@NoWhere.com> - 2021-06-26 19:49 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(I dare you) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 21:17 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(I dare you) olcott <NoOne@NoWhere.com> - 2021-06-26 20:55 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(I dare you) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 22:18 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(I dare you) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-26 19:33 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(I dare you) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-26 20:05 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(I dare you) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-26 20:03 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Jeff Barnett <jbb@notatt.com> - 2021-06-26 10:23 -0600
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-26 18:55 +0100
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Jeff Barnett <jbb@notatt.com> - 2021-06-26 17:04 -0600
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-06-27 10:54 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-06-27 20:24 +0100
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-27 14:56 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-27 16:32 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-06-27 22:01 +0100
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-27 17:26 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-27 19:07 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-27 18:18 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-27 17:00 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-27 17:11 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-27 17:15 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-27 20:02 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-06-28 02:29 +0100
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-27 20:44 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-27 21:40 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-27 22:16 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-27 21:37 +0100
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-27 17:28 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Jeff Barnett <jbb@notatt.com> - 2021-06-27 19:08 -0600
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-27 20:38 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-26 12:59 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-26 13:12 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 19:20 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-26 19:12 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 20:48 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-26 20:08 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 21:19 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-26 18:21 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 06:32 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-26 09:55 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 11:06 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-26 11:00 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-26 09:04 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 12:15 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-26 11:29 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 13:48 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-26 10:54 -0700
Re: What if a cat barks? [ sound deduction is a proof ] André G. Isaak <agisaak@gm.invalid> - 2021-06-24 15:13 -0600
Re: What if a cat barks? [ sound deduction is a proof ] olcott <NoOne@NoWhere.com> - 2021-06-24 16:40 -0500
Re: What if a cat barks? [ sound deduction is a proof ] André G. Isaak <agisaak@gm.invalid> - 2021-06-24 18:51 -0600
Re: What if a cat barks? [ sound deduction is a proof ] olcott <NoOne@NoWhere.com> - 2021-06-25 08:53 -0500
Re: What if a cat barks? [ sound deduction is a proof ] Richard Damon <Richard@Damon-Family.org> - 2021-06-25 11:39 -0400
Re: What if a cat barks? [ sound deduction is a proof ] Richard Damon <Richard@Damon-Family.org> - 2021-06-23 21:04 -0400
Re: What if a cat barks? wij <wyniijj@gmail.com> - 2021-06-21 00:46 -0700
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-21 08:48 -0500
Re: What if a cat barks? wij <wyniijj@gmail.com> - 2021-06-21 08:33 -0700
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-21 10:38 -0500
Re: What if a cat barks? wij <wyniijj@gmail.com> - 2021-06-22 04:52 -0700
Re: What if a cat barks? wij <wyniijj@gmail.com> - 2021-06-22 05:56 -0700
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-22 09:09 -0500
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-22 09:06 -0500
Re: What if a cat barks? wij <wyniijj@gmail.com> - 2021-06-22 10:02 -0700
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-22 12:08 -0500
Re: What if a cat barks? wij <wyniijj@gmail.com> - 2021-06-22 10:13 -0700
Re: What if a cat barks? wij <wyniijj@gmail.com> - 2021-06-22 10:16 -0700
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-22 12:22 -0500
Re: What if a cat barks? Richard Damon <Richard@Damon-Family.org> - 2021-06-22 18:52 -0400
Re: What if a cat barks? wij <wyniijj@gmail.com> - 2021-06-22 17:31 -0700
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-22 20:12 -0500
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-22 12:21 -0500
Re: What if a cat barks? Richard Damon <Richard@Damon-Family.org> - 2021-06-22 18:51 -0400
Re: What if a cat barks? Richard Damon <Richard@Damon-Family.org> - 2021-06-22 18:46 -0400
Re: What if a cat barks? Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-06-21 02:17 -0700
Re: What if a cat barks? [ no false assumptions please ] olcott <NoOne@NoWhere.com> - 2021-06-21 08:44 -0500
Re: What if a cat barks? [ no false assumptions please ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-06-22 02:38 -0700
Re: What if a cat barks? [ no false assumptions please ] olcott <NoOne@NoWhere.com> - 2021-06-22 08:55 -0500
Re: What if a cat barks? Richard Damon <Richard@Damon-Family.org> - 2021-06-21 07:20 -0400
Re: What if a cat barks? [ How can a cat bark? ] olcott <NoOne@NoWhere.com> - 2021-06-21 10:07 -0500
Re: What if a cat barks? [ How can a cat bark? ] Richard Damon <Richard@Damon-Family.org> - 2021-06-21 20:09 -0400
Re: What if a cat barks? [ How can a cat bark? ] olcott <NoOne@NoWhere.com> - 2021-06-21 19:36 -0500
Re: What if a cat barks? [ How can a cat bark? ] Richard Damon <Richard@Damon-Family.org> - 2021-06-21 21:23 -0400
Re: What if a cat barks? Peter <peterxpercival@hotmail.com> - 2021-06-22 15:05 +0100
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-22 09:33 -0500
Re: What if a cat barks? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-22 12:25 -0700
Page 5 of 10 — ← Prev page 1 … 3 4 [5] 6 7 … 10 Next page →
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-06-25 22:07 -0400 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) |
| Message-ID | <EZvBI.43029$7Y.22867@fx03.iad> |
| In reply to | #35341 |
On 6/25/21 9:46 PM, olcott wrote: > On 6/25/2021 8:37 PM, Richard Damon wrote: >> On 6/25/21 9:01 PM, olcott wrote: >>> On 6/25/2021 7:40 PM, Richard Damon wrote: >>>> On 6/25/21 6:56 PM, olcott wrote: >>>>> On 6/25/2021 4:59 PM, Richard Damon wrote: >>>>>> On 6/25/21 4:40 PM, olcott wrote: >>>>>>> On 6/25/2021 3:11 PM, Richard Damon wrote: >>>>>>>> On 6/25/21 2:50 PM, olcott wrote: >>>>>>>>> On 6/25/2021 12:14 PM, Richard Damon wrote: >>>>>>>>> >>>>>>>>>> WRONG. P is DEFINED based on H. If you Hypothetically create a P >>>>>>>>>> that >>>>>>>>>> doesn't follow that form, then you are hypothetically creating >>>>>>>>>> nonsense >>>>>>>>>> and can't use it to for anything logical. >>>>>>>>>> >>>>>>>>> >>>>>>>>> Of every possible encoding of simulating partial halt decider H >>>>>>>>> that can >>>>>>>>> possibly exist H*, if H* never aborts the simulation of its input >>>>>>>>> results in the infinite execution of the invocation of of P(P) >>>>>>>>> then a >>>>>>>>> simulating halt decider H that does abort its simulation of this >>>>>>>>> input >>>>>>>>> does correctly decide that this input does specify the never >>>>>>>>> halting >>>>>>>>> behavior of an infinite chain of invocations. >>>>>>>> >>>>>>>> Yes, if H* is an element of the set of non-aborting deciders >>>>>>>> (Hn), P >>>>>>>> will result in infinite recursion, >>>>>>> >>>>>>> Which logically entails beyond all possible doubt that the set of >>>>>>> encodings of simulating partial halt deciders H2* that do abort the >>>>>>> simulation of the (P,P) input would correctly report that this input >>>>>>> never halts. >>>>>> >>>>>> WHY? >>>>>> >>>>> >>>>> Axiom(1) 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. >>>> >>>> WRONG. >>>> >>>> Your test does not match the plain meaning of the words, as has been >>>> explained many times. >>>> >>> >>> Those words may be over your head, yet several others understand that >>> they are necessarily correct. >> >> I have seen NO ONE agree to your interpretation of it. The plain meaning >> is that if it can be shown that if the given instance of the simulator >> simulating a given input doesn't stop its simulation that this >> simulation will run forevr, then the machine that is being simulated can >> be corrected decided as non-Halting. >> >> An more formal way to say that is if UTM(P,I) is non-halting then it is >> correct for H(P,I) to return the non-halting result. >> >> This actually follows since UTM(P,I) will be non-halting if and only if >> P(I) is non-halting by the definition of a UTM, so that statement is >> trivially proven. >> >> Your interpretation, where even if a copy of the algorithm of H is >> included in P and that included copy needs to abort the simulation of >> the copy of the machine that it was given, can be PROVEN wrong, as even >> you have shown that P(P) in this case does Halt, thus your claimed >> correct answer is wrong by the definition of the problem. >> >> Only if you define that your answer isn't actually supposed to be the >> answer to the halting problem can you justify your answer to be correct, >> but then you proof doesn't achieve the goal you claim. >> >>> >>>> Note, it is easy to show that your interpretation is wrong since even >>>> you admit that Linz H^, now called P by you will come to its end and >>>> halt when given it own representation as its input, and thus is BY >>>> DEFINITION a Halting Computation, Thus the H deciding it didn't need to >>>> abort its execution to get the wrong answer of Non-Halting. >>>> >>> >>> Because at least one invocation of the infinite invocation chain >>> specified by P(P) had to be terminated to prevent the infinite execution >>> of this infinite invocation chain it is confirmed beyond all possible >>> doubt that P(P) specifies an invocation chain. >> >> WRONG. Given that we have an H that can answer H(P,P) because it knows >> at least enough to terminate the pattern you describe, then when we run >> P(P) then because the H within it also knows to abort this sequence >> (since it is built on the same algorithm) this P is NOT part of an >> infinite chain of execution, and thus its H can return its (wrong) >> answer to it and that P can then Halt. > > P(P) specifies in infinite invocation sequence that is terminated on its > third invocation of H(P,P). > > P(P) specifies in infinite invocation sequence that is terminated on its > third invocation of H(P,P). > > P(P) specifies in infinite invocation sequence that is terminated on its > third invocation of H(P,P). > > P(P) specifies in infinite invocation sequence that is terminated on its > third invocation of H(P,P). > > P(P) specifies in infinite invocation sequence that is terminated on its > third invocation of H(P,P). > > Now I have told this this several hundred times. > > WRONG. P(P) starts. Calls H(P,P) H starts the simulation. H simulates P starting H simulates P calling H H simulates H starting its simulation H simulates H simulating P starting H simulates H simulating P calling H The first H about here detects what it THINKS is an infinite execution THe first H aborts its simulation The first H returns its answer (Non-Halting) to its caller P then Halts Showing P is a Halting Computation. This P was NEVER in an infinite invocation sequence because THIS version of P is built on an H that won't let the infinite invocation occur as part of *P*s algorithm. The P that was shown to be in an infinite invocation sequences wasn't this P but a different one, one that was built on a different H. That is like complaining about the auto design of your Rolls Royce because your FIAT keeps breaking down. It is a DIFFERENT Machine. Your logic fails because you habitually reuse symbols and names and lose the context they were defined in. Pn based on the Hn that doesn't abort is a non-halting computaiton. Pa based on the Ha that does abort (and decides incorrectly) is a Halting Computation You logic shows that Ha can be correct in deciding that Pn is non-halting. That is fine, and doesn't really prove anything. To claim that it also shows that Pa is non-halting is like saying a dog is a cat, and the fact that dogs barks says that cats do too.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-25 22:07 -0500 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) |
| Message-ID | <yr2dnWJMMpJLBEv9nZ2dnUU7-dvNnZ2d@giganews.com> |
| In reply to | #35342 |
On 6/25/2021 9:07 PM, Richard Damon wrote: > On 6/25/21 9:46 PM, olcott wrote: >> On 6/25/2021 8:37 PM, Richard Damon wrote: >>> On 6/25/21 9:01 PM, olcott wrote: >>>> On 6/25/2021 7:40 PM, Richard Damon wrote: >>>>> On 6/25/21 6:56 PM, olcott wrote: >>>>>> On 6/25/2021 4:59 PM, Richard Damon wrote: >>>>>>> On 6/25/21 4:40 PM, olcott wrote: >>>>>>>> On 6/25/2021 3:11 PM, Richard Damon wrote: >>>>>>>>> On 6/25/21 2:50 PM, olcott wrote: >>>>>>>>>> On 6/25/2021 12:14 PM, Richard Damon wrote: >>>>>>>>>> >>>>>>>>>>> WRONG. P is DEFINED based on H. If you Hypothetically create a P >>>>>>>>>>> that >>>>>>>>>>> doesn't follow that form, then you are hypothetically creating >>>>>>>>>>> nonsense >>>>>>>>>>> and can't use it to for anything logical. >>>>>>>>>>> >>>>>>>>>> >>>>>>>>>> Of every possible encoding of simulating partial halt decider H >>>>>>>>>> that can >>>>>>>>>> possibly exist H*, if H* never aborts the simulation of its input >>>>>>>>>> results in the infinite execution of the invocation of of P(P) >>>>>>>>>> then a >>>>>>>>>> simulating halt decider H that does abort its simulation of this >>>>>>>>>> input >>>>>>>>>> does correctly decide that this input does specify the never >>>>>>>>>> halting >>>>>>>>>> behavior of an infinite chain of invocations. >>>>>>>>> >>>>>>>>> Yes, if H* is an element of the set of non-aborting deciders >>>>>>>>> (Hn), P >>>>>>>>> will result in infinite recursion, >>>>>>>> >>>>>>>> Which logically entails beyond all possible doubt that the set of >>>>>>>> encodings of simulating partial halt deciders H2* that do abort the >>>>>>>> simulation of the (P,P) input would correctly report that this input >>>>>>>> never halts. >>>>>>> >>>>>>> WHY? >>>>>>> >>>>>> >>>>>> Axiom(1) 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. >>>>> >>>>> WRONG. >>>>> >>>>> Your test does not match the plain meaning of the words, as has been >>>>> explained many times. >>>>> >>>> >>>> Those words may be over your head, yet several others understand that >>>> they are necessarily correct. >>> >>> I have seen NO ONE agree to your interpretation of it. The plain meaning >>> is that if it can be shown that if the given instance of the simulator >>> simulating a given input doesn't stop its simulation that this >>> simulation will run forevr, then the machine that is being simulated can >>> be corrected decided as non-Halting. >>> >>> An more formal way to say that is if UTM(P,I) is non-halting then it is >>> correct for H(P,I) to return the non-halting result. >>> >>> This actually follows since UTM(P,I) will be non-halting if and only if >>> P(I) is non-halting by the definition of a UTM, so that statement is >>> trivially proven. >>> >>> Your interpretation, where even if a copy of the algorithm of H is >>> included in P and that included copy needs to abort the simulation of >>> the copy of the machine that it was given, can be PROVEN wrong, as even >>> you have shown that P(P) in this case does Halt, thus your claimed >>> correct answer is wrong by the definition of the problem. >>> >>> Only if you define that your answer isn't actually supposed to be the >>> answer to the halting problem can you justify your answer to be correct, >>> but then you proof doesn't achieve the goal you claim. >>> >>>> >>>>> Note, it is easy to show that your interpretation is wrong since even >>>>> you admit that Linz H^, now called P by you will come to its end and >>>>> halt when given it own representation as its input, and thus is BY >>>>> DEFINITION a Halting Computation, Thus the H deciding it didn't need to >>>>> abort its execution to get the wrong answer of Non-Halting. >>>>> >>>> >>>> Because at least one invocation of the infinite invocation chain >>>> specified by P(P) had to be terminated to prevent the infinite execution >>>> of this infinite invocation chain it is confirmed beyond all possible >>>> doubt that P(P) specifies an invocation chain. >>> >>> WRONG. Given that we have an H that can answer H(P,P) because it knows >>> at least enough to terminate the pattern you describe, then when we run >>> P(P) then because the H within it also knows to abort this sequence >>> (since it is built on the same algorithm) this P is NOT part of an >>> infinite chain of execution, and thus its H can return its (wrong) >>> answer to it and that P can then Halt. >> >> P(P) specifies in infinite invocation sequence that is terminated on its >> third invocation of H(P,P). >> >> P(P) specifies in infinite invocation sequence that is terminated on its >> third invocation of H(P,P). >> >> P(P) specifies in infinite invocation sequence that is terminated on its >> third invocation of H(P,P). >> >> P(P) specifies in infinite invocation sequence that is terminated on its >> third invocation of H(P,P). >> >> P(P) specifies in infinite invocation sequence that is terminated on its >> third invocation of H(P,P). >> >> Now I have told this this several hundred times. >> >> > > WRONG. > > P(P) starts. > > Calls H(P,P) > > H starts the simulation. > > H simulates P starting > > H simulates P calling H > > H simulates H starting its simulation > > H simulates H simulating P starting > > H simulates H simulating P calling H > > The first H about here detects what it THINKS is an infinite execution > > THe first H aborts its simulation > > The first H returns its answer (Non-Halting) to its caller > > P then Halts > > Showing P is a Halting Computation. As you already admitted P ONLY halts because some H aborts some P otherwise P never ever halts. As you already admitted P ONLY halts because some H aborts some P otherwise P never ever halts. As you already admitted P ONLY halts because some H aborts some P otherwise P never ever halts. As you already admitted P ONLY halts because some H aborts some P otherwise P never ever halts. As you already admitted P ONLY halts because some H aborts some P otherwise P never ever halts. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-06-26 01:11 -0700 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) |
| Message-ID | <sb6nfj$i1b$1@gioia.aioe.org> |
| In reply to | #35343 |
On 6/25/2021 8:07 PM, olcott wrote: > On 6/25/2021 9:07 PM, Richard Damon wrote: >> On 6/25/21 9:46 PM, olcott wrote: >>> On 6/25/2021 8:37 PM, Richard Damon wrote: >>>> On 6/25/21 9:01 PM, olcott wrote: >>>>> On 6/25/2021 7:40 PM, Richard Damon wrote: >>>>>> On 6/25/21 6:56 PM, olcott wrote: >>>>>>> On 6/25/2021 4:59 PM, Richard Damon wrote: >>>>>>>> On 6/25/21 4:40 PM, olcott wrote: >>>>>>>>> On 6/25/2021 3:11 PM, Richard Damon wrote: >>>>>>>>>> On 6/25/21 2:50 PM, olcott wrote: >>>>>>>>>>> On 6/25/2021 12:14 PM, Richard Damon wrote: >>>>>>>>>>> >>>>>>>>>>>> WRONG. P is DEFINED based on H. If you Hypothetically create >>>>>>>>>>>> a P >>>>>>>>>>>> that >>>>>>>>>>>> doesn't follow that form, then you are hypothetically creating >>>>>>>>>>>> nonsense >>>>>>>>>>>> and can't use it to for anything logical. >>>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> Of every possible encoding of simulating partial halt decider H >>>>>>>>>>> that can >>>>>>>>>>> possibly exist H*, if H* never aborts the simulation of its >>>>>>>>>>> input >>>>>>>>>>> results in the infinite execution of the invocation of of P(P) >>>>>>>>>>> then a >>>>>>>>>>> simulating halt decider H that does abort its simulation of this >>>>>>>>>>> input >>>>>>>>>>> does correctly decide that this input does specify the never >>>>>>>>>>> halting >>>>>>>>>>> behavior of an infinite chain of invocations. >>>>>>>>>> >>>>>>>>>> Yes, if H* is an element of the set of non-aborting deciders >>>>>>>>>> (Hn), P >>>>>>>>>> will result in infinite recursion, >>>>>>>>> >>>>>>>>> Which logically entails beyond all possible doubt that the set of >>>>>>>>> encodings of simulating partial halt deciders H2* that do abort >>>>>>>>> the >>>>>>>>> simulation of the (P,P) input would correctly report that this >>>>>>>>> input >>>>>>>>> never halts. >>>>>>>> >>>>>>>> WHY? >>>>>>>> >>>>>>> >>>>>>> Axiom(1) 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. >>>>>> >>>>>> WRONG. >>>>>> >>>>>> Your test does not match the plain meaning of the words, as has been >>>>>> explained many times. >>>>>> >>>>> >>>>> Those words may be over your head, yet several others understand that >>>>> they are necessarily correct. >>>> >>>> I have seen NO ONE agree to your interpretation of it. The plain >>>> meaning >>>> is that if it can be shown that if the given instance of the simulator >>>> simulating a given input doesn't stop its simulation that this >>>> simulation will run forevr, then the machine that is being simulated >>>> can >>>> be corrected decided as non-Halting. >>>> >>>> An more formal way to say that is if UTM(P,I) is non-halting then it is >>>> correct for H(P,I) to return the non-halting result. >>>> >>>> This actually follows since UTM(P,I) will be non-halting if and only if >>>> P(I) is non-halting by the definition of a UTM, so that statement is >>>> trivially proven. >>>> >>>> Your interpretation, where even if a copy of the algorithm of H is >>>> included in P and that included copy needs to abort the simulation of >>>> the copy of the machine that it was given, can be PROVEN wrong, as even >>>> you have shown that P(P) in this case does Halt, thus your claimed >>>> correct answer is wrong by the definition of the problem. >>>> >>>> Only if you define that your answer isn't actually supposed to be the >>>> answer to the halting problem can you justify your answer to be >>>> correct, >>>> but then you proof doesn't achieve the goal you claim. >>>> >>>>> >>>>>> Note, it is easy to show that your interpretation is wrong since even >>>>>> you admit that Linz H^, now called P by you will come to its end and >>>>>> halt when given it own representation as its input, and thus is BY >>>>>> DEFINITION a Halting Computation, Thus the H deciding it didn't >>>>>> need to >>>>>> abort its execution to get the wrong answer of Non-Halting. >>>>>> >>>>> >>>>> Because at least one invocation of the infinite invocation chain >>>>> specified by P(P) had to be terminated to prevent the infinite >>>>> execution >>>>> of this infinite invocation chain it is confirmed beyond all possible >>>>> doubt that P(P) specifies an invocation chain. >>>> >>>> WRONG. Given that we have an H that can answer H(P,P) because it knows >>>> at least enough to terminate the pattern you describe, then when we run >>>> P(P) then because the H within it also knows to abort this sequence >>>> (since it is built on the same algorithm) this P is NOT part of an >>>> infinite chain of execution, and thus its H can return its (wrong) >>>> answer to it and that P can then Halt. >>> >>> P(P) specifies in infinite invocation sequence that is terminated on its >>> third invocation of H(P,P). >>> >>> P(P) specifies in infinite invocation sequence that is terminated on its >>> third invocation of H(P,P). >>> >>> P(P) specifies in infinite invocation sequence that is terminated on its >>> third invocation of H(P,P). >>> >>> P(P) specifies in infinite invocation sequence that is terminated on its >>> third invocation of H(P,P). >>> >>> P(P) specifies in infinite invocation sequence that is terminated on its >>> third invocation of H(P,P). >>> >>> Now I have told this this several hundred times. >>> >>> >> >> WRONG. >> >> P(P) starts. >> >> Calls H(P,P) >> >> H starts the simulation. >> >> H simulates P starting >> >> H simulates P calling H >> >> H simulates H starting its simulation >> >> H simulates H simulating P starting >> >> H simulates H simulating P calling H >> >> The first H about here detects what it THINKS is an infinite execution >> >> THe first H aborts its simulation >> >> The first H returns its answer (Non-Halting) to its caller >> >> P then Halts >> >> Showing P is a Halting Computation. > > As you already admitted P ONLY halts because some H aborts some P > otherwise P never ever halts. > > As you already admitted P ONLY halts because some H aborts some P > otherwise P never ever halts. > > As you already admitted P ONLY halts because some H aborts some P > otherwise P never ever halts. > > As you already admitted P ONLY halts because some H aborts some P > otherwise P never ever halts. > > As you already admitted P ONLY halts because some H aborts some P > otherwise P never ever halts. > Are you nuts, or are recovering from a recent head injury?
[toc] | [prev] | [next] | [standalone]
| From | Jeff Barnett <jbb@notatt.com> |
|---|---|
| Date | 2021-06-26 04:27 -0600 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) |
| Message-ID | <faf6990d-6146-45f1-a2d9-be79919177b4@notatt.com> |
| In reply to | #35344 |
On 6/26/2021 2:11 AM, Chris M. Thomasson wrote: > On 6/25/2021 8:07 PM, olcott wrote: >> On 6/25/2021 9:07 PM, Richard Damon wrote: >>> On 6/25/21 9:46 PM, olcott wrote: >>>> On 6/25/2021 8:37 PM, Richard Damon wrote: >>>>> On 6/25/21 9:01 PM, olcott wrote: >>>>>> On 6/25/2021 7:40 PM, Richard Damon wrote: >>>>>>> On 6/25/21 6:56 PM, olcott wrote: >>>>>>>> On 6/25/2021 4:59 PM, Richard Damon wrote: >>>>>>>>> On 6/25/21 4:40 PM, olcott wrote: >>>>>>>>>> On 6/25/2021 3:11 PM, Richard Damon wrote: >>>>>>>>>>> On 6/25/21 2:50 PM, olcott wrote: >>>>>>>>>>>> On 6/25/2021 12:14 PM, Richard Damon wrote: >>>>>>>>>>>> >>>>>>>>>>>>> WRONG. P is DEFINED based on H. If you Hypothetically >>>>>>>>>>>>> create a P >>>>>>>>>>>>> that >>>>>>>>>>>>> doesn't follow that form, then you are hypothetically creating >>>>>>>>>>>>> nonsense >>>>>>>>>>>>> and can't use it to for anything logical. >>>>>>>>>>>>> >>>>>>>>>>>> >>>>>>>>>>>> Of every possible encoding of simulating partial halt decider H >>>>>>>>>>>> that can >>>>>>>>>>>> possibly exist H*, if H* never aborts the simulation of its >>>>>>>>>>>> input >>>>>>>>>>>> results in the infinite execution of the invocation of of P(P) >>>>>>>>>>>> then a >>>>>>>>>>>> simulating halt decider H that does abort its simulation of >>>>>>>>>>>> this >>>>>>>>>>>> input >>>>>>>>>>>> does correctly decide that this input does specify the never >>>>>>>>>>>> halting >>>>>>>>>>>> behavior of an infinite chain of invocations. >>>>>>>>>>> >>>>>>>>>>> Yes, if H* is an element of the set of non-aborting deciders >>>>>>>>>>> (Hn), P >>>>>>>>>>> will result in infinite recursion, >>>>>>>>>> >>>>>>>>>> Which logically entails beyond all possible doubt that the set of >>>>>>>>>> encodings of simulating partial halt deciders H2* that do >>>>>>>>>> abort the >>>>>>>>>> simulation of the (P,P) input would correctly report that this >>>>>>>>>> input >>>>>>>>>> never halts. >>>>>>>>> >>>>>>>>> WHY? >>>>>>>>> >>>>>>>> >>>>>>>> Axiom(1) 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. >>>>>>> >>>>>>> WRONG. >>>>>>> >>>>>>> Your test does not match the plain meaning of the words, as has been >>>>>>> explained many times. >>>>>>> >>>>>> >>>>>> Those words may be over your head, yet several others understand that >>>>>> they are necessarily correct. >>>>> >>>>> I have seen NO ONE agree to your interpretation of it. The plain >>>>> meaning >>>>> is that if it can be shown that if the given instance of the simulator >>>>> simulating a given input doesn't stop its simulation that this >>>>> simulation will run forevr, then the machine that is being >>>>> simulated can >>>>> be corrected decided as non-Halting. >>>>> >>>>> An more formal way to say that is if UTM(P,I) is non-halting then >>>>> it is >>>>> correct for H(P,I) to return the non-halting result. >>>>> >>>>> This actually follows since UTM(P,I) will be non-halting if and >>>>> only if >>>>> P(I) is non-halting by the definition of a UTM, so that statement is >>>>> trivially proven. >>>>> >>>>> Your interpretation, where even if a copy of the algorithm of H is >>>>> included in P and that included copy needs to abort the simulation of >>>>> the copy of the machine that it was given, can be PROVEN wrong, as >>>>> even >>>>> you have shown that P(P) in this case does Halt, thus your claimed >>>>> correct answer is wrong by the definition of the problem. >>>>> >>>>> Only if you define that your answer isn't actually supposed to be the >>>>> answer to the halting problem can you justify your answer to be >>>>> correct, >>>>> but then you proof doesn't achieve the goal you claim. >>>>> >>>>>> >>>>>>> Note, it is easy to show that your interpretation is wrong since >>>>>>> even >>>>>>> you admit that Linz H^, now called P by you will come to its end and >>>>>>> halt when given it own representation as its input, and thus is BY >>>>>>> DEFINITION a Halting Computation, Thus the H deciding it didn't >>>>>>> need to >>>>>>> abort its execution to get the wrong answer of Non-Halting. >>>>>>> >>>>>> >>>>>> Because at least one invocation of the infinite invocation chain >>>>>> specified by P(P) had to be terminated to prevent the infinite >>>>>> execution >>>>>> of this infinite invocation chain it is confirmed beyond all possible >>>>>> doubt that P(P) specifies an invocation chain. >>>>> >>>>> WRONG. Given that we have an H that can answer H(P,P) because it knows >>>>> at least enough to terminate the pattern you describe, then when we >>>>> run >>>>> P(P) then because the H within it also knows to abort this sequence >>>>> (since it is built on the same algorithm) this P is NOT part of an >>>>> infinite chain of execution, and thus its H can return its (wrong) >>>>> answer to it and that P can then Halt. >>>> >>>> P(P) specifies in infinite invocation sequence that is terminated on >>>> its >>>> third invocation of H(P,P). >>>> >>>> P(P) specifies in infinite invocation sequence that is terminated on >>>> its >>>> third invocation of H(P,P). >>>> >>>> P(P) specifies in infinite invocation sequence that is terminated on >>>> its >>>> third invocation of H(P,P). >>>> >>>> P(P) specifies in infinite invocation sequence that is terminated on >>>> its >>>> third invocation of H(P,P). >>>> >>>> P(P) specifies in infinite invocation sequence that is terminated on >>>> its >>>> third invocation of H(P,P). >>>> >>>> Now I have told this this several hundred times. >>>> >>>> >>> >>> WRONG. >>> >>> P(P) starts. >>> >>> Calls H(P,P) >>> >>> H starts the simulation. >>> >>> H simulates P starting >>> >>> H simulates P calling H >>> >>> H simulates H starting its simulation >>> >>> H simulates H simulating P starting >>> >>> H simulates H simulating P calling H >>> >>> The first H about here detects what it THINKS is an infinite execution >>> >>> THe first H aborts its simulation >>> >>> The first H returns its answer (Non-Halting) to its caller >>> >>> P then Halts >>> >>> Showing P is a Halting Computation. >> >> As you already admitted P ONLY halts because some H aborts some P >> otherwise P never ever halts. >> >> As you already admitted P ONLY halts because some H aborts some P >> otherwise P never ever halts. >> >> As you already admitted P ONLY halts because some H aborts some P >> otherwise P never ever halts. >> >> As you already admitted P ONLY halts because some H aborts some P >> otherwise P never ever halts. >> >> As you already admitted P ONLY halts because some H aborts some P >> otherwise P never ever halts. >> > > Are you nuts, or are recovering from a recent head injury? It's not recent. It seems he's been at it for a few decades. -- Jeff Barnett
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-06-26 15:51 +0100 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) |
| Message-ID | <87fsx4n0ge.fsf@bsb.me.uk> |
| In reply to | #35345 |
I've trimmed the newsgroups. I suggest everyone else does so as well. There is no need to damage more than one group with this junk. Jeff Barnett <jbb@notatt.com> writes: > On 6/26/2021 2:11 AM, Chris M. Thomasson wrote: >> Are you nuts, or are recovering from a recent head injury? > > It's not recent. It seems he's been at it for a few decades. I first cam across PO when he was about to get rich selling some software based on two junk patents he'd filed. The software was vapour ware (at the time) but the expectation of riches was real enough. The situation may be reversed now. I appear to have first talked about halting with PO in 2012. I had a look at one of the replies I made back then. See how predictable it all is: "You see? No connection to what I said. No discussion. Just a re-statement of the same false claim. Should I state, yet again, why it's false? Is there any reason to think you'd address the argument if I did so?" That's a shade off 20 years ago. It really is futile. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-26 10:52 -0500 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(Ben lies) |
| Message-ID | <PPKdnZySmaKq0Er9nZ2dnUU7-Q3NnZ2d@giganews.com> |
| In reply to | #35349 |
On 6/26/2021 9:51 AM, Ben Bacarisse wrote: > I've trimmed the newsgroups. I suggest everyone else does so as well. > There is no need to damage more than one group with this junk. > > Jeff Barnett <jbb@notatt.com> writes: > >> On 6/26/2021 2:11 AM, Chris M. Thomasson wrote: >>> Are you nuts, or are recovering from a recent head injury? >> >> It's not recent. It seems he's been at it for a few decades. > > I first cam across PO when he was about to get rich selling some > software based on two junk patents he'd filed. The software was vapour > ware (at the time) but the expectation of riches was real enough. The > situation may be reversed now. > > I appear to have first talked about halting with PO in 2012. I had a > look at one of the replies I made back then. See how predictable it all > is: > > "You see? No connection to what I said. No discussion. Just a > re-statement of the same false claim. Should I state, yet again, why > it's false? Is there any reason to think you'd address the argument > if I did so?" > > That's a shade off 20 years ago. It really is futile. > On 10/17/2006 7:03 PM, Ben Bacarisse wrote: > "Peter Olcott" <NoSpam@SeeScreen.com> writes: It is the case that P(P) has infinite execution unless one its infinite chain of invocations is aborted. You know there is no rebuttal to this because it is an easily verifiable fact, even Richard acknowledged that P(P) never halts On 6/25/2021 3:11 PM, Richard Damon wrote: > > Yes, if H* is an element of the set of non-aborting deciders (Hn), P > will result in infinite recursion, So you will misdirect with ad hominem and rhetoric because you know that there is no plausible rebuttal using logic. -- 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-26 12:08 -0400 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(Ben lies) |
| Message-ID | <7iIBI.69082$8O4.30085@fx16.iad> |
| In reply to | #35352 |
On 6/26/21 11:52 AM, olcott wrote: > On 6/26/2021 9:51 AM, Ben Bacarisse wrote: >> I've trimmed the newsgroups. I suggest everyone else does so as well. >> There is no need to damage more than one group with this junk. >> >> Jeff Barnett <jbb@notatt.com> writes: >> >>> On 6/26/2021 2:11 AM, Chris M. Thomasson wrote: >>>> Are you nuts, or are recovering from a recent head injury? >>> >>> It's not recent. It seems he's been at it for a few decades. >> >> I first cam across PO when he was about to get rich selling some >> software based on two junk patents he'd filed. The software was vapour >> ware (at the time) but the expectation of riches was real enough. The >> situation may be reversed now. >> >> I appear to have first talked about halting with PO in 2012. I had a >> look at one of the replies I made back then. See how predictable it all >> is: >> >> "You see? No connection to what I said. No discussion. Just a >> re-statement of the same false claim. Should I state, yet again, why >> it's false? Is there any reason to think you'd address the argument >> if I did so?" >> >> That's a shade off 20 years ago. It really is futile. >> > > On 10/17/2006 7:03 PM, Ben Bacarisse wrote: >> "Peter Olcott" <NoSpam@SeeScreen.com> writes: > > It is the case that P(P) has infinite execution unless one its infinite > chain of invocations is aborted. > > You know there is no rebuttal to this because it is an easily verifiable > fact, even Richard acknowledged that P(P) never halts Right, IF H doesn't abort P then P in non-halting. That does NOT mean that if H does abort a DIFFERENT P (since changing H changes P) that this different P is also non-halting. More clearly stated: Given Hn, which doesn't abort its simulation of Pn(Pn), then we can show that Pn(Pn) is non-Halting. But, when we look at Ha, that does abort its simuation, while we can show that Ha is correct in deciding Pn(Pn) as non-halting, it does NOT imply that Ha deciding that Pa(Pa) as non-Halting is correct, and in fact we can show that Pa(Pa) will be Halting, and thus we can PROVE that Ha is WRONG in deciding that Pa(Pa) is non-halting. Failure to keep your differing machines distinct. > > On 6/25/2021 3:11 PM, Richard Damon wrote: >> >> Yes, if H* is an element of the set of non-aborting deciders (Hn), P >> will result in infinite recursion, > > So you will misdirect with ad hominem and rhetoric because you know that > there is no plausible rebuttal using logic. > As I said above, this shows that the P made from the non-aborting decider is non-halting because it gets into an infintie loop. But that is ok, as that H also never answerss. Once you make your H be able to abort its simulation, the P that we get from that no longer has this problem. You just seem unable to keep this straight.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-26 11:18 -0500 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) |
| Message-ID | <LK-dnd0P1rf2zkr9nZ2dnUU7-XOdnZ2d@giganews.com> |
| In reply to | #35355 |
On 6/26/2021 11:08 AM, Richard Damon wrote:
> On 6/26/21 11:52 AM, olcott wrote:
>> On 6/26/2021 9:51 AM, Ben Bacarisse wrote:
>>> I've trimmed the newsgroups. I suggest everyone else does so as well.
>>> There is no need to damage more than one group with this junk.
>>>
>>> Jeff Barnett <jbb@notatt.com> writes:
>>>
>>>> On 6/26/2021 2:11 AM, Chris M. Thomasson wrote:
>>>>> Are you nuts, or are recovering from a recent head injury?
>>>>
>>>> It's not recent. It seems he's been at it for a few decades.
>>>
>>> I first cam across PO when he was about to get rich selling some
>>> software based on two junk patents he'd filed. The software was vapour
>>> ware (at the time) but the expectation of riches was real enough. The
>>> situation may be reversed now.
>>>
>>> I appear to have first talked about halting with PO in 2012. I had a
>>> look at one of the replies I made back then. See how predictable it all
>>> is:
>>>
>>> "You see? No connection to what I said. No discussion. Just a
>>> re-statement of the same false claim. Should I state, yet again, why
>>> it's false? Is there any reason to think you'd address the argument
>>> if I did so?"
>>>
>>> That's a shade off 20 years ago. It really is futile.
>>>
>>
>> On 10/17/2006 7:03 PM, Ben Bacarisse wrote:
>>> "Peter Olcott" <NoSpam@SeeScreen.com> writes:
>>
>> It is the case that P(P) has infinite execution unless one its infinite
>> chain of invocations is aborted.
>>
>> You know there is no rebuttal to this because it is an easily verifiable
>> fact, even Richard acknowledged that P(P) never halts
>
> Right, IF H doesn't abort P then P in non-halting.
>
> That does NOT mean that if H does abort a DIFFERENT P (since changing H
> changes P) that this different P is also non-halting.
>
In the computation int main() { P(P); } when no P ever halts unless some
H aborts some P this proves beyond all possible doubt that P(P)
specifies an infinitely recursive chain of invocations.
The computation int main() { P(P); } calls H(P,P) which is the first
invocation of an infinite chain of invocations. Whenever P calls H(P,P)
H must abort its simulation of P.
It is common knowledge that when any invocation of an infinite sequence
of invocations (such as infinite recursion or infinitely nested
simulation) is terminated then the entire sequence halts.
In the computation int main() { P(P); } the third element of the
infinite chain of invocations is terminated. The only reason that any P
ever halts is that some H aborted some P. This proves (axiomatically)
that P(P) really does specify an infinite invocation chain.
--
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-26 13:38 -0400 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) |
| Message-ID | <gCJBI.47257$z%.45741@fx06.iad> |
| In reply to | #35361 |
On 6/26/21 12:18 PM, olcott wrote:
> On 6/26/2021 11:08 AM, Richard Damon wrote:
>> On 6/26/21 11:52 AM, olcott wrote:
>>> On 6/26/2021 9:51 AM, Ben Bacarisse wrote:
>>>> I've trimmed the newsgroups. I suggest everyone else does so as well.
>>>> There is no need to damage more than one group with this junk.
>>>>
>>>> Jeff Barnett <jbb@notatt.com> writes:
>>>>
>>>>> On 6/26/2021 2:11 AM, Chris M. Thomasson wrote:
>>>>>> Are you nuts, or are recovering from a recent head injury?
>>>>>
>>>>> It's not recent. It seems he's been at it for a few decades.
>>>>
>>>> I first cam across PO when he was about to get rich selling some
>>>> software based on two junk patents he'd filed. The software was vapour
>>>> ware (at the time) but the expectation of riches was real enough. The
>>>> situation may be reversed now.
>>>>
>>>> I appear to have first talked about halting with PO in 2012. I had a
>>>> look at one of the replies I made back then. See how predictable it
>>>> all
>>>> is:
>>>>
>>>> "You see? No connection to what I said. No discussion. Just a
>>>> re-statement of the same false claim. Should I state, yet
>>>> again, why
>>>> it's false? Is there any reason to think you'd address the
>>>> argument
>>>> if I did so?"
>>>>
>>>> That's a shade off 20 years ago. It really is futile.
>>>>
>>>
>>> On 10/17/2006 7:03 PM, Ben Bacarisse wrote:
>>>> "Peter Olcott" <NoSpam@SeeScreen.com> writes:
>>>
>>> It is the case that P(P) has infinite execution unless one its infinite
>>> chain of invocations is aborted.
>>>
>>> You know there is no rebuttal to this because it is an easily verifiable
>>> fact, even Richard acknowledged that P(P) never halts
>>
>> Right, IF H doesn't abort P then P in non-halting.
>>
>> That does NOT mean that if H does abort a DIFFERENT P (since changing H
>> changes P) that this different P is also non-halting.
>>
>
> In the computation int main() { P(P); } when no P ever halts unless some
> H aborts some P this proves beyond all possible doubt that P(P)
> specifies an infinitely recursive chain of invocations.
>
Then you consider this an infinite loop:
for(int i=0; isLessThan(i, 5); i++) continue;
By the definition, if P halts because of its own algorithm, which
includes the algorithm of the H embedded in it, then it is a Halting
Computation.
> The computation int main() { P(P); } calls H(P,P) which is the first
> invocation of an infinite chain of invocations. Whenever P calls H(P,P)
> H must abort its simulation of P.
RIGHT, H aborts the SIMULATION of P, and returns its answer to its
caller, P which then Halts.
What do you disagree about that?
>
> It is common knowledge that when any invocation of an infinite sequence
> of invocations (such as infinite recursion or infinitely nested
> simulation) is terminated then the entire sequence halts.
WRONG. First, it NEVER was an infinite sequence of invocation, because H
was always going to abort it (or it would NEVER abort it). Thus the rule
really doesn't apply.
Second, if you are in a chain of potentially infinite recursion and a
piece of that chain takes an action to end the potentially infinite
recursion then the chain SUBSEQUENT to the termination is halted, and
the rest can continue. You confuse the case where the decider isn't part
of the loop.
Let me ask you, when the entire sequence is halted, does that mean the
H(P,P) that was the second part of the chain was halted too? Are you
saying it never gives its answer? That means that it does the same when
it is the first piece of the chain!
>
> In the computation int main() { P(P); } the third element of the
> infinite chain of invocations is terminated. The only reason that any P
> ever halts is that some H aborted some P. This proves (axiomatically)
> that P(P) really does specify an infinite invocation chain.
>
>
Right, the H that is part of P decided to end what would otherwise b4 an
infinite sequence, and thus it kept itself finite. Just like this loop
takes action to keep itself finite:
for(int i=0; i < 5; i++) continue;
If I neer did its test, it would be infinite.
If the H that is part of P didn't do the test it would be infinite.
SAME PATTERN. SAME REASONING.
FAIL.
Your Axiomatically claim is just your code word that you have no idea
how to even attempt to prove it. The word doesn't mean what you think it
does. It shows that you are out of your league of understanding.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-06-26 18:57 +0100 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(Ben lies) |
| Message-ID | <874kdkmrtn.fsf@bsb.me.uk> |
| In reply to | #35352 |
olcott <NoOne@NoWhere.com> writes: > On 10/17/2006 7:03 PM, Ben Bacarisse wrote: >> "Peter Olcott" <NoSpam@SeeScreen.com> writes: > > It is the case that P(P) has infinite execution... I did not quote you saying that 2006. That attribution line is a lie. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-06-26 14:12 -0400 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(Ben lies) |
| Message-ID | <I6KBI.20806$9q1.2448@fx09.iad> |
| In reply to | #35369 |
On 6/26/21 1:57 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > > >> On 10/17/2006 7:03 PM, Ben Bacarisse wrote: >>> "Peter Olcott" <NoSpam@SeeScreen.com> writes: >> >> It is the case that P(P) has infinite execution... > > I did not quote you saying that 2006. That attribution line is a lie. > Which makes it not that much different than the rest of what he writes.
[toc] | [prev] | [next] | [standalone]
| From | Daniel Pehoushek <pehoushek1@gmail.com> |
|---|---|
| Date | 2021-06-26 11:43 -0700 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(Ben lies) |
| Message-ID | <9109b9c4-5ea7-4f02-80b3-892e4b5bda04n@googlegroups.com> |
| In reply to | #35370 |
monotone reason is linearly decidable. try using "num main()" instead.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-26 19:01 -0500 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) |
| Message-ID | <NNWdnb9wOOF5Ikr9nZ2dnUU7-IHNnZ2d@giganews.com> |
| In reply to | #35369 |
On 6/26/2021 12:57 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > > >> On 10/17/2006 7:03 PM, Ben Bacarisse wrote: >>> "Peter Olcott" <NoSpam@SeeScreen.com> writes: >> >> It is the case that P(P) has infinite execution... > > I did not quote you saying that 2006. That attribution line is a lie. > I am just pointing out the date and time that you first spoke to me knucklehead. It was not 2012. Then I go on to point out the irrefutable reasoning that proves that I am correct. It is the case that P(P) has infinite execution unless one of its infinite chain of invocations is aborted. You know there is no rebuttal to this because it is an easily verifiable fact, even Richard acknowledged that P(P) never halts: On 6/25/2021 3:11 PM, Richard Damon wrote: > > Yes, if H* is an element of the set of non-aborting deciders (Hn), P > will result in infinite recursion, So you will misdirect with ad hominem and rhetoric because you know that there is no plausible rebuttal using logic. -- 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-26 20:32 -0400 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) |
| Message-ID | <MGPBI.300491$gZ.125279@fx44.iad> |
| In reply to | #35379 |
On 6/26/21 8:01 PM, olcott wrote: > On 6/26/2021 12:57 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >> >>> On 10/17/2006 7:03 PM, Ben Bacarisse wrote: >>>> "Peter Olcott" <NoSpam@SeeScreen.com> writes: >>> >>> It is the case that P(P) has infinite execution... >> >> I did not quote you saying that 2006. That attribution line is a lie. >> > > I am just pointing out the date and time that you first spoke to me > knucklehead. It was not 2012. Then I go on to point out the irrefutable > reasoning that proves that I am correct. > > It is the case that P(P) has infinite execution unless one of its > infinite chain of invocations is aborted. Yes, If H will never abort its P, then THAT P will be non-halting. Problem is that When you make an H that will abort the simulation, that gives you a different P which your 'proof' doesn't apply to. > > You know there is no rebuttal to this because it is an easily verifiable > fact, even Richard acknowledged that P(P) never halts: > > On 6/25/2021 3:11 PM, Richard Damon wrote: >> >> Yes, if H* is an element of the set of non-aborting deciders (Hn), P >> will result in infinite recursion, Right If H is a member of Hn which don't abort Pn, then Pn(Pn) will be non-halting. But Hn will never be able to answer the question Hn(Pn,Pn) as it gets stuck in that same infinite loop, so doesn't need to be shown incorrect by P. If H is a member of Ha that does abort, then Ha can correctly decide this of Pn. The problem is that It needs to decide Pa, and the proof doesn't apply to that, so it gets it wrong. You regularly make this mistake. You forget that the algorithm for the machine P is a function of the algorithm for the machine H, so you can't use one H to prove attributes about a different H's P. > > So you will misdirect with ad hominem and rhetoric because you know that > there is no plausible rebuttal using logic. > > So you admit that this is as factual as most of what you say. This basically says that you are an impeached witness, and EVERYTHING that you want to 'claim' you really need to provide some sort of 'Proof' or we don't need to believe it.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-26 19:54 -0500 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) |
| Message-ID | <v4ednRzO69PQUUr9nZ2dnUU7-aPNnZ2d@giganews.com> |
| In reply to | #35381 |
On 6/26/2021 7:32 PM, Richard Damon wrote:
> On 6/26/21 8:01 PM, olcott wrote:
>> On 6/26/2021 12:57 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>
>>>> On 10/17/2006 7:03 PM, Ben Bacarisse wrote:
>>>>> "Peter Olcott" <NoSpam@SeeScreen.com> writes:
>>>>
>>>> It is the case that P(P) has infinite execution...
>>>
>>> I did not quote you saying that 2006. That attribution line is a lie.
>>>
>>
>> I am just pointing out the date and time that you first spoke to me
>> knucklehead. It was not 2012. Then I go on to point out the irrefutable
>> reasoning that proves that I am correct.
>>
>> It is the case that P(P) has infinite execution unless one of its
>> infinite chain of invocations is aborted.
>
> Yes, If H will never abort its P, then THAT P will be non-halting.
>
> Problem is
That you do not understand that when one invocation of the connected
chain of invocations of infinite recursion int main(){ P(P); }
is aborted thus forcing the whole chain to halt, this does not mean that
int main(){ P(P); } does not specify a chain of infinite invocations.
Everyone here that is proficient at software engineering knows that I am
correct about this.
--
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-26 18:03 -0700 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) |
| Message-ID | <f4d6f4b2-c529-4c38-a938-938abe519b6bn@googlegroups.com> |
| In reply to | #35386 |
-I am just pointing out the date and time that you first spoke to me
-knucklehead. It was not 2012. Then I go on to point out the irrefutable
how can someone care so much about others opinions? have you studied
your reasons for collecting "databases of conversations"?
-reasoning I am correct.
-
-A not genius can out perform profoundly brilliant geniuses on a
-specific task such as the halting problem when 10,000-fold more time and
-effort is applied. By going over all the details enormously more times
-than anyone else has patience for, details that were never noticed
-before are uncovered.
my bob program for solving polynomial space time problems has a mind
that is one million times my own mind's speed. and yet, i am
much smarter than bob is about halt deciding bob. i would say
that my history of halt deciding a polynomial space time
solver is nearly perfect. would you like a copy of bob
to see how well you do?
+Genius is one per cent inspiration and ninety-nine per cent
+perspiration. Thomas Edison.
pete rose of the cincinnati reds said something similar when i was a boy.
+Ben Bacarisse the king
+Ben Bacarisse the king
+Ben Bacarisse the king
-I am daring you (or anyone else) to point out any error in the following.
-I am daring you (or anyone else) to point out any error in the following.
-I am daring you (or anyone else) to point out any error in the following.
-That you do not understand that when one invocation of the connected
-chain of invocations of infinite recursion int main(){ P(P); }
-
-is aborted thus forcing the whole chain to halt, this does not mean that
-int main(){ P(P); } does not specify a chain of infinite invocations.
try num main() and data type num
-Everyone here that is proficient at software engineering knows that I am
-incorrect about this.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-06-26 21:08 -0400 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) |
| Message-ID | <ucQBI.47500$z%.36426@fx06.iad> |
| In reply to | #35386 |
On 6/26/21 8:54 PM, olcott wrote:
> On 6/26/2021 7:32 PM, Richard Damon wrote:
>> On 6/26/21 8:01 PM, olcott wrote:
>>> On 6/26/2021 12:57 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>
>>>>> On 10/17/2006 7:03 PM, Ben Bacarisse wrote:
>>>>>> "Peter Olcott" <NoSpam@SeeScreen.com> writes:
>>>>>
>>>>> It is the case that P(P) has infinite execution...
>>>>
>>>> I did not quote you saying that 2006. That attribution line is a lie.
>>>>
>>>
>>> I am just pointing out the date and time that you first spoke to me
>>> knucklehead. It was not 2012. Then I go on to point out the irrefutable
>>> reasoning that proves that I am correct.
>>>
>>> It is the case that P(P) has infinite execution unless one of its
>>> infinite chain of invocations is aborted.
>>
>> Yes, If H will never abort its P, then THAT P will be non-halting.
>>
>> Problem is
> That you do not understand that when one invocation of the connected
> chain of invocations of infinite recursion int main(){ P(P); }
>
> is aborted thus forcing the whole chain to halt, this does not mean that
> int main(){ P(P); } does not specify a chain of infinite invocations.
>
> Everyone here that is proficient at software engineering knows that I am
> correct about this.
>
You say this, but refuse to answer the question of when this happens,
what happens to the execution path of the halt decider that made this
decision?
Remember, in this case, you have dectect the loop that includes BOTH P
and H in the loop. Thus this H is PART of the infinite chain that you
claim as ALL gone.
Did you machine just blow up?
Did it just abort the whole program?
Answer this for me, what actually happens.
And then, what does this mean as the behavior of the actual Turing
Machine this is supposed to be the equivalent of?
I don't think you have an answer for this, as once you define what
happens here, we can show how that answer shows you machine was wrong.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-26 20:39 -0500 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) |
| Message-ID | <n7mdnTZLZ5hHS0r9nZ2dnUU7-K_NnZ2d@giganews.com> |
| In reply to | #35391 |
On 6/26/2021 8:08 PM, Richard Damon wrote:
> On 6/26/21 8:54 PM, olcott wrote:
>> On 6/26/2021 7:32 PM, Richard Damon wrote:
>>> On 6/26/21 8:01 PM, olcott wrote:
>>>> On 6/26/2021 12:57 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>
>>>>>> On 10/17/2006 7:03 PM, Ben Bacarisse wrote:
>>>>>>> "Peter Olcott" <NoSpam@SeeScreen.com> writes:
>>>>>>
>>>>>> It is the case that P(P) has infinite execution...
>>>>>
>>>>> I did not quote you saying that 2006. That attribution line is a lie.
>>>>>
>>>>
>>>> I am just pointing out the date and time that you first spoke to me
>>>> knucklehead. It was not 2012. Then I go on to point out the irrefutable
>>>> reasoning that proves that I am correct.
>>>>
>>>> It is the case that P(P) has infinite execution unless one of its
>>>> infinite chain of invocations is aborted.
>>>
>>> Yes, If H will never abort its P, then THAT P will be non-halting.
>>>
>>> Problem is
>> That you do not understand that when one invocation of the connected
>> chain of invocations of infinite recursion int main(){ P(P); }
>>
>> is aborted thus forcing the whole chain to halt, this does not mean that
>> int main(){ P(P); } does not specify a chain of infinite invocations.
>>
>> Everyone here that is proficient at software engineering knows that I am
>> correct about this.
>>
>
> You say this, but refuse to answer the question of when this happens,
> what happens to the execution path of the halt decider that made this
> decision?
>
As long as we can know that P(P) specifies infinite recursion then we
know that H(P,P) did correctly abort its input an report that its input
never halts.
> Remember, in this case, you have dectect the loop that includes BOTH P
> and H in the loop. Thus this H is PART of the infinite chain that you
> claim as ALL gone.
>
> Did you machine just blow up?
>
> Did it just abort the whole program?
>
> Answer this for me, what actually happens.
>
As long as we can know that P(P) specifies infinite recursion then we
know that H(P,P) did correctly abort its input an report that its input
never halts.
This is correct and true no matter what else.
> And then, what does this mean as the behavior of the actual Turing
> Machine this is supposed to be the equivalent of?
> > I don't think you have an answer for this, as once you define what
> happens here, we can show how that answer shows you machine was wrong.
>
As long as we can know that P(P) specifies infinite recursion then we
know that H(P,P) did correctly abort its input an report that its input
never halts.
This is correct and true no matter what else.
If X > Y && Y > Z then X > Z
We don't even need to know what X, Y, and Z are
and we don't need to know the criterion measure of >.
--
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-26 22:06 -0400 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) |
| Message-ID | <L2RBI.684880$ST2.438800@fx47.iad> |
| In reply to | #35397 |
On 6/26/21 9:39 PM, olcott wrote:
> On 6/26/2021 8:08 PM, Richard Damon wrote:
>> On 6/26/21 8:54 PM, olcott wrote:
>>> On 6/26/2021 7:32 PM, Richard Damon wrote:
>>>> On 6/26/21 8:01 PM, olcott wrote:
>>>>> On 6/26/2021 12:57 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>
>>>>>>> On 10/17/2006 7:03 PM, Ben Bacarisse wrote:
>>>>>>>> "Peter Olcott" <NoSpam@SeeScreen.com> writes:
>>>>>>>
>>>>>>> It is the case that P(P) has infinite execution...
>>>>>>
>>>>>> I did not quote you saying that 2006. That attribution line is a
>>>>>> lie.
>>>>>>
>>>>>
>>>>> I am just pointing out the date and time that you first spoke to me
>>>>> knucklehead. It was not 2012. Then I go on to point out the
>>>>> irrefutable
>>>>> reasoning that proves that I am correct.
>>>>>
>>>>> It is the case that P(P) has infinite execution unless one of its
>>>>> infinite chain of invocations is aborted.
>>>>
>>>> Yes, If H will never abort its P, then THAT P will be non-halting.
>>>>
>>>> Problem is
>>> That you do not understand that when one invocation of the connected
>>> chain of invocations of infinite recursion int main(){ P(P); }
>>>
>>> is aborted thus forcing the whole chain to halt, this does not mean that
>>> int main(){ P(P); } does not specify a chain of infinite invocations.
>>>
>>> Everyone here that is proficient at software engineering knows that I am
>>> correct about this.
>>>
>>
>> You say this, but refuse to answer the question of when this happens,
>> what happens to the execution path of the halt decider that made this
>> decision?
>>
>
> As long as we can know that P(P) specifies infinite recursion then we
> know that H(P,P) did correctly abort its input an report that its input
> never halts.
Problem is that you keep refering to the wrong P. The P you proved this
for was based on the H that didn't abort. So you need to find an H that
doesn't abort its simulation of P(P) that can still give an answer.
That doesn't exist.
You are talking about Unicorns again.
Yes, AS LONG AS you know that, but that is only for Pn based on Hn.
All you have shown is that Ha can predict Pn but that doesn't matter, it
needs to predict Pa.
>
>> Remember, in this case, you have dectect the loop that includes BOTH P
>> and H in the loop. Thus this H is PART of the infinite chain that you
>> claim as ALL gone.
>>
>> Did you machine just blow up?
>>
>> Did it just abort the whole program?
>>
>> Answer this for me, what actually happens.
>>
>
> As long as we can know that P(P) specifies infinite recursion then we
> know that H(P,P) did correctly abort its input an report that its input
> never halts.
>
> This is correct and true no matter what else.
Except that if H can abort its input of P, then we haven't shown that
P(P) is an infinite recursion.
That proof was based on the presumption that H doesn't abort its input.
Assuption doesn't hold, argument is now unsound. PERIOD.
>
>> And then, what does this mean as the behavior of the actual Turing
>> Machine this is supposed to be the equivalent of?
>> > I don't think you have an answer for this, as once you define what
>> happens here, we can show how that answer shows you machine was wrong.
>>
>
> As long as we can know that P(P) specifies infinite recursion then we
> know that H(P,P) did correctly abort its input an report that its input
> never halts.
Except, as has been said many times, you have only shown that Pn(Pn)
specifies infinite recursion, and Hn gets caught in that same infinite
recursion. Once you change to Ha that knows how to get out of that trap,
it now needs to decide on Pa, which you have NOT proven infinite
recursion, and in fact it can be shown that it DOESN'T have infinite
recursion BECAUSE H will abort its simulation.
>
> This is correct and true no matter what else.
>
> If X > Y && Y > Z then X > Z
Maybe if you wrote out the logic for the actual case you were arguing it
might be more convising.
Your logic goes more like:
If H doesn't abort its simulation then P(P) has infinite recursion.
H does abort its simulation .... not much you can say now.
>
> We don't even need to know what X, Y, and Z are
> and we don't need to know the criterion measure of >.
>
STRAWMAN, we aren't doing that logic.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-27 09:43 -0500 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(dumber than a box of rocks ) |
| Message-ID | <zuydnfoTgbg6E0X9nZ2dnUU7-TnNnZ2d@giganews.com> |
| In reply to | #35399 |
On 6/26/2021 9:06 PM, Richard Damon wrote:
> On 6/26/21 9:39 PM, olcott wrote:
>> On 6/26/2021 8:08 PM, Richard Damon wrote:
>>> On 6/26/21 8:54 PM, olcott wrote:
>>>> On 6/26/2021 7:32 PM, Richard Damon wrote:
>>>>> On 6/26/21 8:01 PM, olcott wrote:
>>>>>> On 6/26/2021 12:57 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>
>>>>>>>> On 10/17/2006 7:03 PM, Ben Bacarisse wrote:
>>>>>>>>> "Peter Olcott" <NoSpam@SeeScreen.com> writes:
>>>>>>>>
>>>>>>>> It is the case that P(P) has infinite execution...
>>>>>>>
>>>>>>> I did not quote you saying that 2006. That attribution line is a
>>>>>>> lie.
>>>>>>>
>>>>>>
>>>>>> I am just pointing out the date and time that you first spoke to me
>>>>>> knucklehead. It was not 2012. Then I go on to point out the
>>>>>> irrefutable
>>>>>> reasoning that proves that I am correct.
>>>>>>
>>>>>> It is the case that P(P) has infinite execution unless one of its
>>>>>> infinite chain of invocations is aborted.
>>>>>
>>>>> Yes, If H will never abort its P, then THAT P will be non-halting.
>>>>>
>>>>> Problem is
>>>> That you do not understand that when one invocation of the connected
>>>> chain of invocations of infinite recursion int main(){ P(P); }
>>>>
>>>> is aborted thus forcing the whole chain to halt, this does not mean that
>>>> int main(){ P(P); } does not specify a chain of infinite invocations.
>>>>
>>>> Everyone here that is proficient at software engineering knows that I am
>>>> correct about this.
>>>>
>>>
>>> You say this, but refuse to answer the question of when this happens,
>>> what happens to the execution path of the halt decider that made this
>>> decision?
>>>
>>
>> As long as we can know that P(P) specifies infinite recursion then we
>> know that H(P,P) did correctly abort its input an report that its input
>> never halts.
>
>
> Problem is that you keep refering to the wrong P.
The problem is that people that are dumber than a box of rocks do not
understand that with infinite recursion "any P will do".
An invocation chain remains infinitely recursive until one of its
invocations from the 1 ... n is terminated.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 5 of 10 — ← Prev page 1 … 3 4 [5] 6 7 … 10 Next page →
Back to top | Article view | comp.theory
csiph-web