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 1 of 10 [1] 2 3 … 10 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-20 23:15 -0500 |
| Subject | What if a cat barks? |
| Message-ID | <BpqdnWBR5LTFj039nZ2dnUU7-XPNnZ2d@giganews.com> |
If you see an animal and test its DNA and confirm that it is definitely a cat, what happens when the cat barks? When we examine the behavior of the Peter Linz Ĥ applied to its own Turing machine description: ⟨Ĥ⟩ and simply assume that the embedded halt decider at its internal state of Ĥ.qx is a UTM then we find that this machine has infinitely nested simulation. SELF-EVIDENT-TRUTH Every computation that never halts unless its simulation is aborted is a computation that never halts. SELF-EVIDENT-TRUTH The <Ĥ> <Ĥ> input to the embedded halt decider at Ĥ.qx is a computation that never halts unless its simulation is aborted. ∴ IMPOSSIBLY FALSE CONCLUSION The embedded simulating halt decider at Ĥ.qx correctly decides its input: <Ĥ> <Ĥ> is a computation that never halts. The above three elements essentially provide the DNA of the cat. 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] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-06-20 22:04 -0700 |
| Message-ID | <sap6l7$130c$5@gioia.aioe.org> |
| In reply to | #35200 |
On 6/20/2021 9:15 PM, olcott wrote: > If you see an animal and test its DNA and confirm that it is definitely > a cat, what happens when the cat barks? [...] Have you been hearing cats bark lately? Wow.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-06-21 12:16 +0100 |
| Message-ID | <87lf73a2of.fsf@bsb.me.uk> |
| In reply to | #35201 |
"Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes: > On 6/20/2021 9:15 PM, olcott wrote: >> If you see an animal and test its DNA and confirm that it is >> definitely a cat, what happens when the cat barks? > [...] > > Have you been hearing cats bark lately? Wow. He's making a bad analogy. The correct analogy is that /assuming/ that a cat barks leads to a contradiction so we must reject the assumption. He can see the contradiction that assuming a halt decider leads to (at least he claimed to be able to see it) so what to do? He has to state that he has a barking cat -- a halt decider that works at least for the confounding case. Of course he doesn't, but he has to find some way to keep the discussion going (he only cares about keeping people talking). -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-06-21 17:15 -0700 |
| Message-ID | <sara30$1e0p$2@gioia.aioe.org> |
| In reply to | #35207 |
On 6/21/2021 4:16 AM, Ben Bacarisse wrote: > "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes: > >> On 6/20/2021 9:15 PM, olcott wrote: >>> If you see an animal and test its DNA and confirm that it is >>> definitely a cat, what happens when the cat barks? >> [...] >> >> Have you been hearing cats bark lately? Wow. > > He's making a bad analogy. The correct analogy is that /assuming/ that > a cat barks leads to a contradiction so we must reject the assumption. > > He can see the contradiction that assuming a halt decider leads to (at > least he claimed to be able to see it) so what to do? He has to state > that he has a barking cat -- a halt decider that works at least for the > confounding case. Of course he doesn't, but he has to find some way to > keep the discussion going (he only cares about keeping people talking). > Ahhh. Good. Okay, well I am still wondering why, when I tell him to run his "halt decider" against an unknown, black box program created by somebody else... Well, he seems to get pissed off. Afaict, his decider only works on programs that he already knows are, decided. Cheating 101? Or what? ;^o
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-21 20:07 -0500 |
| Message-ID | <-JidnS57a7VWqkz9nZ2dnUU7-LmdnZ2d@giganews.com> |
| In reply to | #35232 |
On 6/21/2021 7:15 PM, Chris M. Thomasson wrote: > On 6/21/2021 4:16 AM, Ben Bacarisse wrote: >> "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes: >> >>> On 6/20/2021 9:15 PM, olcott wrote: >>>> If you see an animal and test its DNA and confirm that it is >>>> definitely a cat, what happens when the cat barks? >>> [...] >>> >>> Have you been hearing cats bark lately? Wow. >> >> He's making a bad analogy. The correct analogy is that /assuming/ that >> a cat barks leads to a contradiction so we must reject the assumption. >> >> He can see the contradiction that assuming a halt decider leads to (at >> least he claimed to be able to see it) so what to do? He has to state >> that he has a barking cat -- a halt decider that works at least for the >> confounding case. Of course he doesn't, but he has to find some way to >> keep the discussion going (he only cares about keeping people talking). >> > > Ahhh. Good. Okay, well I am still wondering why, when I tell him to run > his "halt decider" against an unknown, black box program created by > somebody else... Well, he seems to get pissed off. Afaict, his decider > only works on programs that he already knows are, decided. Cheating 101? > Or what? ;^o It is not actually a contradiction at all if one is paying very close attention. Since people want me to be wrong they don't want to pay enough attention to see that I am right. -- 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-21 18:35 -0700 |
| Message-ID | <sareou$qdq$1@gioia.aioe.org> |
| In reply to | #35238 |
On 6/21/2021 6:07 PM, olcott wrote: > On 6/21/2021 7:15 PM, Chris M. Thomasson wrote: >> On 6/21/2021 4:16 AM, Ben Bacarisse wrote: >>> "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes: >>> >>>> On 6/20/2021 9:15 PM, olcott wrote: >>>>> If you see an animal and test its DNA and confirm that it is >>>>> definitely a cat, what happens when the cat barks? >>>> [...] >>>> >>>> Have you been hearing cats bark lately? Wow. >>> >>> He's making a bad analogy. The correct analogy is that /assuming/ that >>> a cat barks leads to a contradiction so we must reject the assumption. >>> >>> He can see the contradiction that assuming a halt decider leads to (at >>> least he claimed to be able to see it) so what to do? He has to state >>> that he has a barking cat -- a halt decider that works at least for the >>> confounding case. Of course he doesn't, but he has to find some way to >>> keep the discussion going (he only cares about keeping people talking). >>> >> >> Ahhh. Good. Okay, well I am still wondering why, when I tell him to >> run his "halt decider" against an unknown, black box program created >> by somebody else... Well, he seems to get pissed off. Afaict, his >> decider only works on programs that he already knows are, decided. >> Cheating 101? Or what? ;^o > > It is not actually a contradiction at all if one is paying very close > attention. Since people want me to be wrong they don't want to pay > enough attention to see that I am right. > If I give you a black box program, can you decide if it halts or not?
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-21 20:40 -0500 |
| Message-ID | <zZOdnUC2JPvxokz9nZ2dnUU7-UOdnZ2d@giganews.com> |
| In reply to | #35241 |
On 6/21/2021 8:35 PM, Chris M. Thomasson wrote: > On 6/21/2021 6:07 PM, olcott wrote: >> On 6/21/2021 7:15 PM, Chris M. Thomasson wrote: >>> On 6/21/2021 4:16 AM, Ben Bacarisse wrote: >>>> "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes: >>>> >>>>> On 6/20/2021 9:15 PM, olcott wrote: >>>>>> If you see an animal and test its DNA and confirm that it is >>>>>> definitely a cat, what happens when the cat barks? >>>>> [...] >>>>> >>>>> Have you been hearing cats bark lately? Wow. >>>> >>>> He's making a bad analogy. The correct analogy is that /assuming/ that >>>> a cat barks leads to a contradiction so we must reject the assumption. >>>> >>>> He can see the contradiction that assuming a halt decider leads to (at >>>> least he claimed to be able to see it) so what to do? He has to state >>>> that he has a barking cat -- a halt decider that works at least for the >>>> confounding case. Of course he doesn't, but he has to find some way to >>>> keep the discussion going (he only cares about keeping people talking). >>>> >>> >>> Ahhh. Good. Okay, well I am still wondering why, when I tell him to >>> run his "halt decider" against an unknown, black box program created >>> by somebody else... Well, he seems to get pissed off. Afaict, his >>> decider only works on programs that he already knows are, decided. >>> Cheating 101? Or what? ;^o >> >> It is not actually a contradiction at all if one is paying very close >> attention. Since people want me to be wrong they don't want to pay >> enough attention to see that I am right. >> > > If I give you a black box program, can you decide if it halts or not? Within the context of the halting problem that is a very stupid question. -- 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-21 18:42 -0700 |
| Message-ID | <sarf5p$qdq$2@gioia.aioe.org> |
| In reply to | #35243 |
On 6/21/2021 6:40 PM, olcott wrote: > On 6/21/2021 8:35 PM, Chris M. Thomasson wrote: >> On 6/21/2021 6:07 PM, olcott wrote: >>> On 6/21/2021 7:15 PM, Chris M. Thomasson wrote: >>>> On 6/21/2021 4:16 AM, Ben Bacarisse wrote: >>>>> "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes: >>>>> >>>>>> On 6/20/2021 9:15 PM, olcott wrote: >>>>>>> If you see an animal and test its DNA and confirm that it is >>>>>>> definitely a cat, what happens when the cat barks? >>>>>> [...] >>>>>> >>>>>> Have you been hearing cats bark lately? Wow. >>>>> >>>>> He's making a bad analogy. The correct analogy is that /assuming/ >>>>> that >>>>> a cat barks leads to a contradiction so we must reject the assumption. >>>>> >>>>> He can see the contradiction that assuming a halt decider leads to (at >>>>> least he claimed to be able to see it) so what to do? He has to state >>>>> that he has a barking cat -- a halt decider that works at least for >>>>> the >>>>> confounding case. Of course he doesn't, but he has to find some >>>>> way to >>>>> keep the discussion going (he only cares about keeping people >>>>> talking). >>>>> >>>> >>>> Ahhh. Good. Okay, well I am still wondering why, when I tell him to >>>> run his "halt decider" against an unknown, black box program created >>>> by somebody else... Well, he seems to get pissed off. Afaict, his >>>> decider only works on programs that he already knows are, decided. >>>> Cheating 101? Or what? ;^o >>> >>> It is not actually a contradiction at all if one is paying very close >>> attention. Since people want me to be wrong they don't want to pay >>> enough attention to see that I am right. >>> >> >> If I give you a black box program, can you decide if it halts or not? > > Within the context of the halting problem that is a very stupid question. > Why? Does the program halt or not? You cannot tell. Get over it.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-06-21 21:54 -0400 |
| Message-ID | <opbAI.48766$N%.30373@fx05.iad> |
| In reply to | #35244 |
On 6/21/21 9:42 PM, Chris M. Thomasson wrote: > On 6/21/2021 6:40 PM, olcott wrote: >> On 6/21/2021 8:35 PM, Chris M. Thomasson wrote: >>> On 6/21/2021 6:07 PM, olcott wrote: >>>> On 6/21/2021 7:15 PM, Chris M. Thomasson wrote: >>>>> On 6/21/2021 4:16 AM, Ben Bacarisse wrote: >>>>>> "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes: >>>>>> >>>>>>> On 6/20/2021 9:15 PM, olcott wrote: >>>>>>>> If you see an animal and test its DNA and confirm that it is >>>>>>>> definitely a cat, what happens when the cat barks? >>>>>>> [...] >>>>>>> >>>>>>> Have you been hearing cats bark lately? Wow. >>>>>> >>>>>> He's making a bad analogy. The correct analogy is that /assuming/ >>>>>> that >>>>>> a cat barks leads to a contradiction so we must reject the >>>>>> assumption. >>>>>> >>>>>> He can see the contradiction that assuming a halt decider leads to >>>>>> (at >>>>>> least he claimed to be able to see it) so what to do? He has to >>>>>> state >>>>>> that he has a barking cat -- a halt decider that works at least >>>>>> for the >>>>>> confounding case. Of course he doesn't, but he has to find some >>>>>> way to >>>>>> keep the discussion going (he only cares about keeping people >>>>>> talking). >>>>>> >>>>> >>>>> Ahhh. Good. Okay, well I am still wondering why, when I tell him to >>>>> run his "halt decider" against an unknown, black box program >>>>> created by somebody else... Well, he seems to get pissed off. >>>>> Afaict, his decider only works on programs that he already knows >>>>> are, decided. Cheating 101? Or what? ;^o >>>> >>>> It is not actually a contradiction at all if one is paying very >>>> close attention. Since people want me to be wrong they don't want to >>>> pay enough attention to see that I am right. >>>> >>> >>> If I give you a black box program, can you decide if it halts or not? >> >> Within the context of the halting problem that is a very stupid question. >> > > Why? Does the program halt or not? You cannot tell. Get over it. Well, the problem is that Turing Machines CAN'T be black boxes. And the definition of the Halting Problem is that the decider is given a full description of the Turing Machine, which is basically like a full listing of the program. Now, this works two ways, a PO needs to realize that his Halt Decider also can't avoid being examined, and thus H, if it answers, can't avoid giving that answer to H^, so that it can make the answer wrong.
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-06-22 12:22 -0700 |
| Message-ID | <satdah$an0$1@gioia.aioe.org> |
| In reply to | #35246 |
On 6/21/2021 6:54 PM, Richard Damon wrote: > On 6/21/21 9:42 PM, Chris M. Thomasson wrote: >> On 6/21/2021 6:40 PM, olcott wrote: >>> On 6/21/2021 8:35 PM, Chris M. Thomasson wrote: >>>> On 6/21/2021 6:07 PM, olcott wrote: >>>>> On 6/21/2021 7:15 PM, Chris M. Thomasson wrote: >>>>>> On 6/21/2021 4:16 AM, Ben Bacarisse wrote: >>>>>>> "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes: >>>>>>> >>>>>>>> On 6/20/2021 9:15 PM, olcott wrote: >>>>>>>>> If you see an animal and test its DNA and confirm that it is >>>>>>>>> definitely a cat, what happens when the cat barks? >>>>>>>> [...] >>>>>>>> >>>>>>>> Have you been hearing cats bark lately? Wow. >>>>>>> >>>>>>> He's making a bad analogy. The correct analogy is that /assuming/ >>>>>>> that >>>>>>> a cat barks leads to a contradiction so we must reject the >>>>>>> assumption. >>>>>>> >>>>>>> He can see the contradiction that assuming a halt decider leads to >>>>>>> (at >>>>>>> least he claimed to be able to see it) so what to do? He has to >>>>>>> state >>>>>>> that he has a barking cat -- a halt decider that works at least >>>>>>> for the >>>>>>> confounding case. Of course he doesn't, but he has to find some >>>>>>> way to >>>>>>> keep the discussion going (he only cares about keeping people >>>>>>> talking). >>>>>>> >>>>>> >>>>>> Ahhh. Good. Okay, well I am still wondering why, when I tell him to >>>>>> run his "halt decider" against an unknown, black box program >>>>>> created by somebody else... Well, he seems to get pissed off. >>>>>> Afaict, his decider only works on programs that he already knows >>>>>> are, decided. Cheating 101? Or what? ;^o >>>>> >>>>> It is not actually a contradiction at all if one is paying very >>>>> close attention. Since people want me to be wrong they don't want to >>>>> pay enough attention to see that I am right. >>>>> >>>> >>>> If I give you a black box program, can you decide if it halts or not? >>> >>> Within the context of the halting problem that is a very stupid question. >>> >> >> Why? Does the program halt or not? You cannot tell. Get over it. > > Well, the problem is that Turing Machines CAN'T be black boxes. And the > definition of the Halting Problem is that the decider is given a full > description of the Turing Machine, which is basically like a full > listing of the program. Oh, sorry. I thought his x86 simulator would run an x86 program and determine if it would halt or not. My bad. The assembled program would have all the information he needs right? Or, would I have to give him source code... Humm, I don't know. Does he have an assembler? When I say "black box", I was basically referring to a program that somebody else assembled into an executable. His simulator, as-is, should be able to simulate any x86 program and determine if it halts or not... Sound Kosher? > Now, this works two ways, a PO needs to realize that his Halt Decider > also can't avoid being examined, and thus H, if it answers, can't avoid > giving that answer to H^, so that it can make the answer wrong. > Right.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-06-22 18:57 -0400 |
| Message-ID | <TVtAI.65377$iY.38032@fx41.iad> |
| In reply to | #35279 |
On 6/22/21 3:22 PM, Chris M. Thomasson wrote: > On 6/21/2021 6:54 PM, Richard Damon wrote: >> >> Well, the problem is that Turing Machines CAN'T be black boxes. And the >> definition of the Halting Problem is that the decider is given a full >> description of the Turing Machine, which is basically like a full >> listing of the program. > > Oh, sorry. I thought his x86 simulator would run an x86 program and > determine if it would halt or not. My bad. The assembled program would > have all the information he needs right? Or, would I have to give him > source code... Humm, I don't know. Does he have an assembler? > > When I say "black box", I was basically referring to a program that > somebody else assembled into an executable. > > His simulator, as-is, should be able to simulate any x86 program and > determine if it halts or not... Sound Kosher? > > The problem is that the term 'black box' tend to mean something that you can't look inside of, which means that his simulator couldn't get at the object code of it. A program that was a real black box would have its internals encrypted and have test to make sure that it wasn't being 'spied' on before decrypting itself. Of course, without support from the OS, or some controlling program, things can't be perfect black boxes, just enough to be a pain to look into.
[toc] | [prev] | [next] | [standalone]
| From | Daniel Pehoushek <pehoushek1@gmail.com> |
|---|---|
| Date | 2021-06-22 16:07 -0700 |
| Message-ID | <be3886ce-4c3b-400c-838b-849916d7c811n@googlegroups.com> |
| In reply to | #35285 |
bug report the fly just now flew into my mouth i captured the body between my thumb and right forefinger the body of evidence is in a secure container that may be stored for a finite time period hubble on youtube is great you have all done well the universe is large some reasoning seems very very stupid
[toc] | [prev] | [next] | [standalone]
| From | wij <wyniijj@gmail.com> |
|---|---|
| Date | 2021-06-22 17:45 -0700 |
| Message-ID | <8dadae1a-4bc8-48cc-a67c-488fc4de8f67n@googlegroups.com> |
| In reply to | #35285 |
On Wednesday, 23 June 2021 at 06:57:58 UTC+8, Richard Damon wrote: > On 6/22/21 3:22 PM, Chris M. Thomasson wrote: > > On 6/21/2021 6:54 PM, Richard Damon wrote: > >> > >> Well, the problem is that Turing Machines CAN'T be black boxes. And the > >> definition of the Halting Problem is that the decider is given a full > >> description of the Turing Machine, which is basically like a full > >> listing of the program. > > > > Oh, sorry. I thought his x86 simulator would run an x86 program and > > determine if it would halt or not. My bad. The assembled program would > > have all the information he needs right? Or, would I have to give him > > source code... Humm, I don't know. Does he have an assembler? > > > > When I say "black box", I was basically referring to a program that > > somebody else assembled into an executable. > > > > His simulator, as-is, should be able to simulate any x86 program and > > determine if it halts or not... Sound Kosher? > > > > > The problem is that the term 'black box' tend to mean something that you > can't look inside of, which means that his simulator couldn't get at the > object code of it. > > A program that was a real black box would have its internals encrypted > and have test to make sure that it wasn't being 'spied' on before > decrypting itself. Of course, without support from the OS, or some > controlling program, things can't be perfect black boxes, just enough to > be a pain to look into. Black box program can be executed, like any app., by simulator or OS. The same as oracle can be used in TM, P can be a black box to H, black body in physics.
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-06-24 16:26 -0700 |
| Message-ID | <sb34ac$vm5$1@gioia.aioe.org> |
| In reply to | #35288 |
On 6/22/2021 5:45 PM, wij wrote: > On Wednesday, 23 June 2021 at 06:57:58 UTC+8, Richard Damon wrote: >> On 6/22/21 3:22 PM, Chris M. Thomasson wrote: >>> On 6/21/2021 6:54 PM, Richard Damon wrote: >>>> >>>> Well, the problem is that Turing Machines CAN'T be black boxes. And the >>>> definition of the Halting Problem is that the decider is given a full >>>> description of the Turing Machine, which is basically like a full >>>> listing of the program. >>> >>> Oh, sorry. I thought his x86 simulator would run an x86 program and >>> determine if it would halt or not. My bad. The assembled program would >>> have all the information he needs right? Or, would I have to give him >>> source code... Humm, I don't know. Does he have an assembler? >>> >>> When I say "black box", I was basically referring to a program that >>> somebody else assembled into an executable. >>> >>> His simulator, as-is, should be able to simulate any x86 program and >>> determine if it halts or not... Sound Kosher? >>> >>> >> The problem is that the term 'black box' tend to mean something that you >> can't look inside of, which means that his simulator couldn't get at the >> object code of it. >> >> A program that was a real black box would have its internals encrypted >> and have test to make sure that it wasn't being 'spied' on before >> decrypting itself. Of course, without support from the OS, or some >> controlling program, things can't be perfect black boxes, just enough to >> be a pain to look into. > > Black box program can be executed, like any app., by simulator or OS. > The same as oracle can be used in TM, P can be a black box to H, black body > in physics. > A valid x86 program should just run on his simulator. The simulator would start getting instructions and executing them. The question is, will the instruction stream halt, or not? I am guessing that his system would spawn a simulator in a sandbox or something, with a target program. The simulator fires up, initializes itself, and starts executing the target program.
[toc] | [prev] | [next] | [standalone]
| From | wij <wyniijj@gmail.com> |
|---|---|
| Date | 2021-06-25 00:39 -0700 |
| Message-ID | <e0b0f50d-5a60-4d80-a69c-9f557702778an@googlegroups.com> |
| In reply to | #35322 |
On Friday, 25 June 2021 at 07:26:09 UTC+8, Chris M. Thomasson wrote:
> On 6/22/2021 5:45 PM, wij wrote:
> > On Wednesday, 23 June 2021 at 06:57:58 UTC+8, Richard Damon wrote:
> >> On 6/22/21 3:22 PM, Chris M. Thomasson wrote:
> >>> On 6/21/2021 6:54 PM, Richard Damon wrote:
> >>>>
> >>>> Well, the problem is that Turing Machines CAN'T be black boxes. And the
> >>>> definition of the Halting Problem is that the decider is given a full
> >>>> description of the Turing Machine, which is basically like a full
> >>>> listing of the program.
> >>>
> >>> Oh, sorry. I thought his x86 simulator would run an x86 program and
> >>> determine if it would halt or not. My bad. The assembled program would
> >>> have all the information he needs right? Or, would I have to give him
> >>> source code... Humm, I don't know. Does he have an assembler?
> >>>
> >>> When I say "black box", I was basically referring to a program that
> >>> somebody else assembled into an executable.
> >>>
> >>> His simulator, as-is, should be able to simulate any x86 program and
> >>> determine if it halts or not... Sound Kosher?
> >>>
> >>>
> >> The problem is that the term 'black box' tend to mean something that you
> >> can't look inside of, which means that his simulator couldn't get at the
> >> object code of it.
> >>
> >> A program that was a real black box would have its internals encrypted
> >> and have test to make sure that it wasn't being 'spied' on before
> >> decrypting itself. Of course, without support from the OS, or some
> >> controlling program, things can't be perfect black boxes, just enough to
> >> be a pain to look into.
> >
> > Black box program can be executed, like any app., by simulator or OS.
> > The same as oracle can be used in TM, P can be a black box to H, black body
> > in physics.
> >
>
> A valid x86 program should just run on his simulator. The simulator
> would start getting instructions and executing them. The question is,
> will the instruction stream halt, or not? I am guessing that his system
> would spawn a simulator in a sandbox or something, with a target
> program. The simulator fires up, initializes itself, and starts
> executing the target program.
// program p.cpp
//-------------------
//extern bool H(Func p);
void P();
inline static bool H2(Func p) {
// Rewrite H to simulate H (or not).
// The rewrite can be in very different but functionally equivalent ways.
}
static const bool r=H2(P); // equivalent to r=H(P)
void P() {
if(r) {
for(;;) {}; // If H2(P)==true, P is in infinite loop.
}
};
int main() {
P();
};
// Note: P is written this way to demonstrate a way that H cannot possibly detect
// being traced by P.
//-----------
If H is a pure simulator, H(P) is doomed to be in infinite recursive call.
If H(f) is specified to return true iff f() returns, and not allowed to halt,
then the question is equivalent to asking for the value of r.
If r==true, H spec. says the execution of P() will return, but the compiled
executable of p.cpp will disagree (run in infinite loop).
If r==false, H spec. says the execution of P() will not return, but the compiled
executable of p.cpp will return.
I see no way function H can be done even using quantum computers.
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-06-26 14:40 -0700 |
| Message-ID | <sb86t9$sri$1@gioia.aioe.org> |
| In reply to | #35326 |
On 6/25/2021 12:39 AM, wij wrote:
> On Friday, 25 June 2021 at 07:26:09 UTC+8, Chris M. Thomasson wrote:
>> On 6/22/2021 5:45 PM, wij wrote:
>>> On Wednesday, 23 June 2021 at 06:57:58 UTC+8, Richard Damon wrote:
>>>> On 6/22/21 3:22 PM, Chris M. Thomasson wrote:
>>>>> On 6/21/2021 6:54 PM, Richard Damon wrote:
>>>>>>
>>>>>> Well, the problem is that Turing Machines CAN'T be black boxes. And the
>>>>>> definition of the Halting Problem is that the decider is given a full
>>>>>> description of the Turing Machine, which is basically like a full
>>>>>> listing of the program.
>>>>>
>>>>> Oh, sorry. I thought his x86 simulator would run an x86 program and
>>>>> determine if it would halt or not. My bad. The assembled program would
>>>>> have all the information he needs right? Or, would I have to give him
>>>>> source code... Humm, I don't know. Does he have an assembler?
>>>>>
>>>>> When I say "black box", I was basically referring to a program that
>>>>> somebody else assembled into an executable.
>>>>>
>>>>> His simulator, as-is, should be able to simulate any x86 program and
>>>>> determine if it halts or not... Sound Kosher?
>>>>>
>>>>>
>>>> The problem is that the term 'black box' tend to mean something that you
>>>> can't look inside of, which means that his simulator couldn't get at the
>>>> object code of it.
>>>>
>>>> A program that was a real black box would have its internals encrypted
>>>> and have test to make sure that it wasn't being 'spied' on before
>>>> decrypting itself. Of course, without support from the OS, or some
>>>> controlling program, things can't be perfect black boxes, just enough to
>>>> be a pain to look into.
>>>
>>> Black box program can be executed, like any app., by simulator or OS.
>>> The same as oracle can be used in TM, P can be a black box to H, black body
>>> in physics.
>>>
>>
>> A valid x86 program should just run on his simulator. The simulator
>> would start getting instructions and executing them. The question is,
>> will the instruction stream halt, or not? I am guessing that his system
>> would spawn a simulator in a sandbox or something, with a target
>> program. The simulator fires up, initializes itself, and starts
>> executing the target program.
>
> // program p.cpp
> //-------------------
> //extern bool H(Func p);
> void P();
>
> inline static bool H2(Func p) {
> // Rewrite H to simulate H (or not).
> // The rewrite can be in very different but functionally equivalent ways.
> }
>
> static const bool r=H2(P); // equivalent to r=H(P)
>
> void P() {
> if(r) {
> for(;;) {}; // If H2(P)==true, P is in infinite loop.
> }
> };
>
> int main() {
> P();
> };
>
> // Note: P is written this way to demonstrate a way that H cannot possibly detect
> // being traced by P.
> //-----------
>
> If H is a pure simulator, H(P) is doomed to be in infinite recursive call.
> If H(f) is specified to return true iff f() returns, and not allowed to halt,
> then the question is equivalent to asking for the value of r.
>
> If r==true, H spec. says the execution of P() will return, but the compiled
> executable of p.cpp will disagree (run in infinite loop).
> If r==false, H spec. says the execution of P() will not return, but the compiled
> executable of p.cpp will return.
>
> I see no way function H can be done even using quantum computers.
>
PO should run your program on his simulator and give us a result... ;^)
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-06-23 02:47 +0100 |
| Message-ID | <877dil9wtc.fsf@bsb.me.uk> |
| In reply to | #35232 |
"Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes: > On 6/21/2021 4:16 AM, Ben Bacarisse wrote: >> "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes: >> >>> On 6/20/2021 9:15 PM, olcott wrote: >>>> If you see an animal and test its DNA and confirm that it is >>>> definitely a cat, what happens when the cat barks? >>> [...] >>> >>> Have you been hearing cats bark lately? Wow. >> He's making a bad analogy. The correct analogy is that /assuming/ that >> a cat barks leads to a contradiction so we must reject the assumption. >> He can see the contradiction that assuming a halt decider leads to (at >> least he claimed to be able to see it) so what to do? He has to state >> that he has a barking cat -- a halt decider that works at least for the >> confounding case. Of course he doesn't, but he has to find some way to >> keep the discussion going (he only cares about keeping people talking). > > Ahhh. Good. Okay, well I am still wondering why, when I tell him to > run his "halt decider" against an unknown, black box program created > by somebody else... Well, he seems to get pissed off. Afaict, his > decider only works on programs that he already knows are, > decided. Cheating 101? Or what? ;^o Well he flip-flops on this. He keeps saying that he has a halt decider (sometimes without realising that he's said it) but when this is pointed out he claims he only cares about the one case -- the "hat" construction given in so many proofs. That, alone, would be noteworthy because it's impossible. Way back in Dec 2018, he was waffling about a decider for one case (which is trivial), when someone (I think it was Mike Terry) spotted that he was actually claiming to have a TM H that gave the correct result for the computation <[H^], [H^]> (my notation -- I'll explain it if you really care about the details). Once it was pointed out that everyone knows this is impossible PO was delighted and wrote things like: "Everyone has claimed that H on input pair (Ĥ, Ĥ) meeting the Linz specs does not exist. I now have a fully encoded pair of Turing Machines H / Ĥ proving them wrong." "I now have an actual H that decides actual halting for an actual (Ĥ, Ĥ) input pair. I have to write the UTM to execute this code, that should not take very long. The key thing is the H and Ĥ are 100% fully encoded as actual Turing machines." "I am waiting to encode the UTM in C++ so that I can actually execute H on the input pair: (Ĥ, Ĥ). This should take a week or two. It is not a universal halt decider, yet it is exactly and precisely the Peter Linz H and Ĥ, with H actually deciding input pair: (Ĥ, Ĥ) on the basis of Ĥ actually deciding itself." I refer to this as the Big Lie because, of course, he never had any such pair of TMs, but as you can see, it was getting one (impossible) case right that was the jumping-off point for the last two an half years of nonsense. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-22 21:15 -0500 |
| Subject | Re: What if a cat barks? [ sound deduction proves that I am correct ] |
| Message-ID | <Jr2dnTtXcoihBE_9nZ2dnUU7-anNnZ2d@giganews.com> |
| In reply to | #35291 |
On 6/22/2021 8:47 PM, Ben Bacarisse wrote: > "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes: > >> On 6/21/2021 4:16 AM, Ben Bacarisse wrote: >>> "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes: >>> >>>> On 6/20/2021 9:15 PM, olcott wrote: >>>>> If you see an animal and test its DNA and confirm that it is >>>>> definitely a cat, what happens when the cat barks? >>>> [...] >>>> >>>> Have you been hearing cats bark lately? Wow. >>> He's making a bad analogy. The correct analogy is that /assuming/ that >>> a cat barks leads to a contradiction so we must reject the assumption. >>> He can see the contradiction that assuming a halt decider leads to (at >>> least he claimed to be able to see it) so what to do? He has to state >>> that he has a barking cat -- a halt decider that works at least for the >>> confounding case. Of course he doesn't, but he has to find some way to >>> keep the discussion going (he only cares about keeping people talking). >> >> Ahhh. Good. Okay, well I am still wondering why, when I tell him to >> run his "halt decider" against an unknown, black box program created >> by somebody else... Well, he seems to get pissed off. Afaict, his >> decider only works on programs that he already knows are, >> decided. Cheating 101? Or what? ;^o > > Well he flip-flops on this. He keeps saying that he has a halt decider > (sometimes without realising that he's said it) but when this is pointed > out he claims he only cares about the one case -- the "hat" construction > given in so many proofs. > > That, alone, would be noteworthy because it's impossible. Way back in > Dec 2018, he was waffling about a decider for one case (which is > trivial), when someone (I think it was Mike Terry) spotted that he was > actually claiming to have a TM H that gave the correct result for the > computation <[H^], [H^]> (my notation -- I'll explain it if you really > care about the details). Once it was pointed out that everyone knows > this is impossible PO was delighted and wrote things like: > > "Everyone has claimed that H on input pair (Ĥ, Ĥ) meeting the Linz > specs does not exist. I now have a fully encoded pair of Turing > Machines H / Ĥ proving them wrong." > > "I now have an actual H that decides actual halting for an actual (Ĥ, > Ĥ) input pair. I have to write the UTM to execute this code, that > should not take very long. The key thing is the H and Ĥ are 100% > fully encoded as actual Turing machines." > > "I am waiting to encode the UTM in C++ so that I can actually execute > H on the input pair: (Ĥ, Ĥ). This should take a week or two. It is not > a universal halt decider, yet it is exactly and precisely the Peter > Linz H and Ĥ, with H actually deciding input pair: (Ĥ, Ĥ) on the basis > of Ĥ actually deciding itself." > > I refer to this as the Big Lie because, of course, he never had any such > pair of TMs, but as you can see, it was getting one (impossible) case > right that was the jumping-off point for the last two an half years of > nonsense. > Yes and of course when I make a C program that is computationally equivalent to the standard relation between the HP halt decider and its impossible input and show all of the steps of how this halt decider correctly decides this "known" to be impossible input that does not count at all because it is not 100% perfectly an actual TM. The C program is implemented in the x86utm operating system using an actual x86 emulator. This work began in earnest at the end of 2019 after the huge false start of trying to implement an interpreter for a tiny subset of C from scratch. Halting problem undecidability and infinitely nested simulation https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation Ben: You (and others) have affirmed premise (1). You might be able to see that the conclusion logically follows from premise (1) and premise (2). There was one very highly qualified person that has affirmed that premise (2) is a verified fact. Premise(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. Premise(2) 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). 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 | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-06-22 23:00 -0400 |
| Subject | Re: What if a cat barks? [ sound deduction proves that I am correct ] |
| Message-ID | <ctxAI.834238$nn2.737324@fx48.iad> |
| In reply to | #35292 |
On 6/22/21 10:15 PM, olcott wrote: > On 6/22/2021 8:47 PM, Ben Bacarisse wrote: >> "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes: >> >>> On 6/21/2021 4:16 AM, Ben Bacarisse wrote: >>>> "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes: >>>> >>>>> On 6/20/2021 9:15 PM, olcott wrote: >>>>>> If you see an animal and test its DNA and confirm that it is >>>>>> definitely a cat, what happens when the cat barks? >>>>> [...] >>>>> >>>>> Have you been hearing cats bark lately? Wow. >>>> He's making a bad analogy. The correct analogy is that /assuming/ that >>>> a cat barks leads to a contradiction so we must reject the assumption. >>>> He can see the contradiction that assuming a halt decider leads to (at >>>> least he claimed to be able to see it) so what to do? He has to state >>>> that he has a barking cat -- a halt decider that works at least for the >>>> confounding case. Of course he doesn't, but he has to find some way to >>>> keep the discussion going (he only cares about keeping people talking). >>> >>> Ahhh. Good. Okay, well I am still wondering why, when I tell him to >>> run his "halt decider" against an unknown, black box program created >>> by somebody else... Well, he seems to get pissed off. Afaict, his >>> decider only works on programs that he already knows are, >>> decided. Cheating 101? Or what? ;^o >> >> Well he flip-flops on this. He keeps saying that he has a halt decider >> (sometimes without realising that he's said it) but when this is pointed >> out he claims he only cares about the one case -- the "hat" construction >> given in so many proofs. >> >> That, alone, would be noteworthy because it's impossible. Way back in >> Dec 2018, he was waffling about a decider for one case (which is >> trivial), when someone (I think it was Mike Terry) spotted that he was >> actually claiming to have a TM H that gave the correct result for the >> computation <[H^], [H^]> (my notation -- I'll explain it if you really >> care about the details). Once it was pointed out that everyone knows >> this is impossible PO was delighted and wrote things like: >> >> "Everyone has claimed that H on input pair (Ĥ, Ĥ) meeting the Linz >> specs does not exist. I now have a fully encoded pair of Turing >> Machines H / Ĥ proving them wrong." >> >> "I now have an actual H that decides actual halting for an actual (Ĥ, >> Ĥ) input pair. I have to write the UTM to execute this code, that >> should not take very long. The key thing is the H and Ĥ are 100% >> fully encoded as actual Turing machines." >> >> "I am waiting to encode the UTM in C++ so that I can actually execute >> H on the input pair: (Ĥ, Ĥ). This should take a week or two. It is not >> a universal halt decider, yet it is exactly and precisely the Peter >> Linz H and Ĥ, with H actually deciding input pair: (Ĥ, Ĥ) on the basis >> of Ĥ actually deciding itself." >> >> I refer to this as the Big Lie because, of course, he never had any such >> pair of TMs, but as you can see, it was getting one (impossible) case >> right that was the jumping-off point for the last two an half years of >> nonsense. >> > > Yes and of course when I make a C program that is computationally > equivalent to the standard relation between the HP halt decider and its > impossible input and show all of the steps of how this halt decider > correctly decides this "known" to be impossible input that does not > count at all because it is not 100% perfectly an actual TM. Except that it isn't because H^ doesn't make copies as it is supposed to so you don't end up with a true equivalent. This lets you 'cheat' to detect the recursion that doesn't really exist in the original problem. You also make you machine unable to handle ANY input because you keep everything in the same code address space. Your test that you use in H to detect this recursion is something that is IMPOSSIBLE to do with a Turing Machine because they just don't have addresses like that. So no, they aren't 'equivalents' in any strict sense, but you don't seen to understand Turing Machines enough to be able to tell the difference. > > The C program is implemented in the x86utm operating system using an > actual x86 emulator. This work began in earnest at the end of 2019 after > the huge false start of trying to implement an interpreter for a tiny > subset of C from scratch. > > Halting problem undecidability and infinitely nested simulation > > https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation > > Ben: You (and others) have affirmed premise (1). People agree to premise (1) for the RIGHT definition of the words. This is that it is aborting NEEDS to be done by the machine that is doing the simulation, not some copy aborting another copy at some other layer. This is your flaw here. > > You might be able to see that the conclusion logically follows from > premise (1) and premise (2). But it doesn't since premise (1) and premise (2) use the words with different meanings the the combination is unsound > > There was one very highly qualified person that has affirmed that > premise (2) is a verified fact. > > Premise(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. But that meaning isn't what you then make it mean. The actual machine H that is doing the decision does NOT 'need' to abort the simulation because the copy of it inside P will, and thus P will halt if given time. PERIOD. WRONG ANSWER. > > Premise(2) 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). > > From the above true premises it necessarily follows that simulating halt > decider H correctly reports that its input: (P,P) never halts. > > Wrong. You need to decide what you are really trying to do. If you want to try to convince people you need to accept that you need to use the words as they are generally defined, and that you can't just change things. If you REALLY think you have something provable, then it shouldn't require these linguistic arguments, but should be able to be proved from basic accepted principles and detailed logic. If your only method is based on these linguistic arguments, then you need to admit that your meanings do not match the REAL accepted meanings, and thus your logic IS FLAWED. Fundamentally, the problem is your langauge definitions are inconsistent, as is common with natural language, which is why real logicians don't rely on it, but work with formalisms to get around the ambiguities.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-22 22:21 -0500 |
| Subject | Re: What if a cat barks? [ sound deduction proves that I am correct ] |
| Message-ID | <ePidnVYePKcoNU_9nZ2dnUU7-SnNnZ2d@giganews.com> |
| In reply to | #35293 |
On 6/22/2021 10:00 PM, Richard Damon wrote:
> On 6/22/21 10:15 PM, olcott wrote:
>> On 6/22/2021 8:47 PM, Ben Bacarisse wrote:
>>> "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:
>>>
>>>> On 6/21/2021 4:16 AM, Ben Bacarisse wrote:
>>>>> "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:
>>>>>
>>>>>> On 6/20/2021 9:15 PM, olcott wrote:
>>>>>>> If you see an animal and test its DNA and confirm that it is
>>>>>>> definitely a cat, what happens when the cat barks?
>>>>>> [...]
>>>>>>
>>>>>> Have you been hearing cats bark lately? Wow.
>>>>> He's making a bad analogy. The correct analogy is that /assuming/ that
>>>>> a cat barks leads to a contradiction so we must reject the assumption.
>>>>> He can see the contradiction that assuming a halt decider leads to (at
>>>>> least he claimed to be able to see it) so what to do? He has to state
>>>>> that he has a barking cat -- a halt decider that works at least for the
>>>>> confounding case. Of course he doesn't, but he has to find some way to
>>>>> keep the discussion going (he only cares about keeping people talking).
>>>>
>>>> Ahhh. Good. Okay, well I am still wondering why, when I tell him to
>>>> run his "halt decider" against an unknown, black box program created
>>>> by somebody else... Well, he seems to get pissed off. Afaict, his
>>>> decider only works on programs that he already knows are,
>>>> decided. Cheating 101? Or what? ;^o
>>>
>>> Well he flip-flops on this. He keeps saying that he has a halt decider
>>> (sometimes without realising that he's said it) but when this is pointed
>>> out he claims he only cares about the one case -- the "hat" construction
>>> given in so many proofs.
>>>
>>> That, alone, would be noteworthy because it's impossible. Way back in
>>> Dec 2018, he was waffling about a decider for one case (which is
>>> trivial), when someone (I think it was Mike Terry) spotted that he was
>>> actually claiming to have a TM H that gave the correct result for the
>>> computation <[H^], [H^]> (my notation -- I'll explain it if you really
>>> care about the details). Once it was pointed out that everyone knows
>>> this is impossible PO was delighted and wrote things like:
>>>
>>> "Everyone has claimed that H on input pair (Ĥ, Ĥ) meeting the Linz
>>> specs does not exist. I now have a fully encoded pair of Turing
>>> Machines H / Ĥ proving them wrong."
>>>
>>> "I now have an actual H that decides actual halting for an actual (Ĥ,
>>> Ĥ) input pair. I have to write the UTM to execute this code, that
>>> should not take very long. The key thing is the H and Ĥ are 100%
>>> fully encoded as actual Turing machines."
>>>
>>> "I am waiting to encode the UTM in C++ so that I can actually execute
>>> H on the input pair: (Ĥ, Ĥ). This should take a week or two. It is not
>>> a universal halt decider, yet it is exactly and precisely the Peter
>>> Linz H and Ĥ, with H actually deciding input pair: (Ĥ, Ĥ) on the basis
>>> of Ĥ actually deciding itself."
>>>
>>> I refer to this as the Big Lie because, of course, he never had any such
>>> pair of TMs, but as you can see, it was getting one (impossible) case
>>> right that was the jumping-off point for the last two an half years of
>>> nonsense.
>>>
>>
>> Yes and of course when I make a C program that is computationally
>> equivalent to the standard relation between the HP halt decider and its
>> impossible input and show all of the steps of how this halt decider
>> correctly decides this "known" to be impossible input that does not
>> count at all because it is not 100% perfectly an actual TM.
>
> Except that it isn't because H^ doesn't make copies as it is supposed to
> so you don't end up with a true equivalent.
Others know that it is sufficiently equivalent.
procedure compute_g(i):
if f(i, i) == 0 then
return 0
else
loop forever // (Wikipedia:Halting Problem)
Its pretty obvious that the C code and the pseudo-code are saying
exactly the same thing.
// Simplified Linz Ĥ (Linz:1990:319)
void P(u32 x)
{
u32 Input_Halts = H(x, x);
if (Input_Halts)
HERE: goto HERE;
}
> This lets you 'cheat' to
> detect the recursion that doesn't really exist in the original problem.
Because others know that it is sufficiently equivalent they can also see
the infinite recursion in the Linz proof as soon as they sufficiently
understand my x86/C proof.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 1 of 10 [1] 2 3 … 10 Next page →
Back to top | Article view | comp.theory
csiph-web