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 6 of 10 — ← Prev page 1 … 4 5 [6] 7 8 … 10 Next page →
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-06-27 13:10 -0400 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(dumber than a box of rocks ) |
| Message-ID | <2i2CI.30956$e21.27326@fx02.iad> |
| In reply to | #35415 |
On 6/27/21 10:43 AM, olcott wrote: > On 6/26/2021 9:06 PM, Richard Damon wrote: >> >> 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. > Then explain in simple words how you can examine program A to determine the Halting behavior of program B. Note, although you call then all 'P', they are TOTALLY different programs, with just the smallest part of common code. This is what you forget. Remember, you are using the Halting Problem defined for Turing Machines, so you need to work under the rules of Turing Machines, and that means that machine P includes ALL the code that is part of its algorithm, which includes the H that it is built on. IF you want to claim that you can determine detail characteristics of a Cat by examining a Dog, please give your justification. If we start with an H that does include the code to abort what it sees as an infinite recursion, then it is clear that the P built from this algorithm also does not get stuck in an infinite recursion, as it starts to simulate itself, then sees that same pattern that H would (since it is the same algorithm as H) and decide to abort its simulation, and then Halt. A Computation that Halt, is a Halting Computation, and not one that has gotten stuck in an infinite recursion. Your UNSOUND deduction that you can analyze this version of P by treating it just the same as to version built on an algorithm that doesn't terminate the simulation is totally flawed, which is why you get the wrong answer.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-27 13:00 -0500 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(dumber than a box of rocks ) |
| Message-ID | <xridnWsqutlXIUX9nZ2dnUU7-d3NnZ2d@giganews.com> |
| In reply to | #35416 |
On 6/27/2021 12:10 PM, Richard Damon wrote:
> On 6/27/21 10:43 AM, olcott wrote:
>> On 6/26/2021 9:06 PM, Richard Damon wrote:
>
>>>
>>> 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.
>>
>
> Then explain in simple words how you can examine program A to determine
> the Halting behavior of program B.
>
> Note, although you call then all 'P', they are TOTALLY different
> programs, with just the smallest part of common code.
>
That the different levels of infinite recursion are different programs
is such a foolishly stupid thing to say.
int Factorial(int n)
{
if (n > 1)
return n * Factorial(n - 1);
else
return 1;
}
> This is what you forget.
>
> Remember, you are using the Halting Problem defined for Turing Machines,
> so you need to work under the rules of Turing Machines, and that means
> that machine P includes ALL the code that is part of its algorithm,
> which includes the H that it is built on.
I am only talking about the C/x86 version of H/P nitwit.
--
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-27 15:40 -0400 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(dumber than a box of rocks ) |
| Message-ID | <Lu4CI.52036$4q1.40232@fx10.iad> |
| In reply to | #35418 |
On 6/27/21 2:00 PM, olcott wrote:
> On 6/27/2021 12:10 PM, Richard Damon wrote:
>> On 6/27/21 10:43 AM, olcott wrote:
>>> On 6/26/2021 9:06 PM, Richard Damon wrote:
>>
>>>>
>>>> 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.
>>>
>>
>> Then explain in simple words how you can examine program A to determine
>> the Halting behavior of program B.
>>
>> Note, although you call then all 'P', they are TOTALLY different
>> programs, with just the smallest part of common code.
>>
>
> That the different levels of infinite recursion are different programs
> is such a foolishly stupid thing to say.
Nonsense.
There are MANY programs that you call 'P', just as you talk about many
different H's
A key fact that you omit is that each H that you consider gets its own P
that it needs to decide, and those Ps are as different as the Hs they
are based on.
You REALLY need to keep the different machines straight, best done by
giving them unique names. It almost seems like you have forgotten the
distinction between the concept of the Formal Parameter used to define a
function and the actual argument given in the particular instance. The
machine in Linz is called H^ for a reason, it is the ^ transform for
machine H. Thus if the ACTUAL halt decider that claims to be able to
decide all machines given to it is called Halts, then the Machine that
Linz would propose would be called Halts^. Thus for things like your
halt decider that doesn't abort its input could be called Hn and thus
Linz would make a Hn^, and the Halt decider that does abort its input
when it detects your given pattern could be called Ha, and its Linz
challenger would be Ha^. Now things are well labled, and you argument is
that because we can easily look at the results of running Hn^ and seeing
infinite recursion, we can run Ha(Hn^,Hn^) and properly say that the
answer of non-Halting is correct, which IS a valid statement.
The problem is that Ha needs to get Ha^(Ha^) correct, which it doesn't
because the logic used to show Hn^(Hn^) was infinitly recursive doesn't
apply as Ha DOES terminate the loop, and thus so does Ha^ since it
copies the algorithm.
>
> int Factorial(int n)
> {
> if (n > 1)
> return n * Factorial(n - 1);
> else
> return 1;
> }
>
STRAWMAN.
>> This is what you forget.
>>
>> Remember, you are using the Halting Problem defined for Turing Machines,
>> so you need to work under the rules of Turing Machines, and that means
>> that machine P includes ALL the code that is part of its algorithm,
>> which includes the H that it is built on.
>
> I am only talking about the C/x86 version of H/P nitwit.
>
>
Then why are you using a Turing Machine reference design?
You have previously claimed that you are refuting Linz and the like,
which are ALL Turing Macnines based proofs.
In your earlier arguemnts you claimed that your machine H/Halts was an
equivalent to the Turing Machine H in the proof.
Are you retracting that claim? If you are claiming equivalence, then the
properties of Turing Machines still apply.
Note, this equivalent principle means that the machine that P represents
includes ALL of the code of H as part of it (even if it isn't part of
what you call P in C), thus changing H changes P.
Big Note about a C/x86 version of the Halting Problem. You need to be
VERY careful how you define things. First, because an x86 program that
doesn't do I/O is a finite program, it turns out that this means that if
you allow the Halt Decider to be an enough bigger machine, ANY such
finite machine can be correctly decided in finite time. (This setup also
means we can't form H^, as H^ needs to be the x86 program but H doesn't,
it can be bigger).
If we limit the Halt Decider to need to fit into the same finite
machine, it is easy to show that there are MANY programs that can't be
decided, all you need is for it to take up enough space that there is no
room left for the decider to fit with it.
IF we add I/O with bounded I/O space, we hit the same issue. Solvable it
the decider can be bigger (if you allow it to be enough bigger) and
unsolvable if your total memory has a fixed limit.
This means the only x86 style of Computations that gets interesting for
a general halting decider is one that allows for unbounded I/O. From
your description, your decider doesn't seem to have defined an API to do
this, and doesn't even allow you to run a decision on an arbitrary
computation due to your memory system. A REAL x86 theory of computation
decider would have a call where you provide the computation to decide as
a FILE (not a pointer to memory) so you really could provide an
arbitrary program to decide on.
A real theory of decider wouldn't have (or need) an 'out' for running
out of memory. Any decider that has a fixed memory bound is going to
have machines that it can not decide on, even if they are restricted to
that same memory bound.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-27 15:04 -0500 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(liar liar pants on fire ) |
| Message-ID | <HaCdnctKqN5eREX9nZ2dnUU7-cfNnZ2d@giganews.com> |
| In reply to | #35420 |
On 6/27/2021 2:40 PM, Richard Damon wrote:
> On 6/27/21 2:00 PM, olcott wrote:
>> On 6/27/2021 12:10 PM, Richard Damon wrote:
>>> On 6/27/21 10:43 AM, olcott wrote:
>>>> On 6/26/2021 9:06 PM, Richard Damon wrote:
>>>
>>>>>
>>>>> 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.
>>>>
>>>
>>> Then explain in simple words how you can examine program A to determine
>>> the Halting behavior of program B.
>>>
>>> Note, although you call then all 'P', they are TOTALLY different
>>> programs, with just the smallest part of common code.
>>>
>>
>> That the different levels of infinite recursion are different programs
>> is such a foolishly stupid thing to say.
>
> Nonsense.
>
> There are MANY programs that you call 'P', just as you talk about many
> different H's
That I have provided the source-code and machine-code for P along with
the execution trace of the machine-code of P proves that you are a damn
liar. Infinitely nested simulation has computationally equivalent
behavior to infinite recursion.
void P(u32 x)
{
u32 Input_Halts = H(x, x);
if (Input_Halts)
HERE: goto HERE;
}
_P()
[00000b25](01) 55 push ebp
[00000b26](02) 8bec mov ebp,esp
[00000b28](01) 51 push ecx
[00000b29](03) 8b4508 mov eax,[ebp+08]
[00000b2c](01) 50 push eax
[00000b2d](03) 8b4d08 mov ecx,[ebp+08]
[00000b30](01) 51 push ecx
[00000b31](05) e81ffeffff call 00000955
[00000b36](03) 83c408 add esp,+08
[00000b39](03) 8945fc mov [ebp-04],eax
[00000b3c](04) 837dfc00 cmp dword [ebp-04],+00
[00000b40](02) 7402 jz 00000b44
[00000b42](02) ebfe jmp 00000b42
[00000b44](02) 8be5 mov esp,ebp
[00000b46](01) 5d pop ebp
[00000b47](01) c3 ret
Size in bytes:(0035) [00000b47]
Columns
(1) Machine address of instruction
(2) Machine address of top of stack
(3) Value of top of stack after instruction executed
(4) Machine language bytes
(5) Assembly language text
===============================
Begin Local Halt Decider Simulation at Machine Address:b25
...[00000b25][002116fe][00211702](01) 55 push ebp
...[00000b26][002116fe][00211702](02) 8bec mov ebp,esp
...[00000b28][002116fa][002016ce](01) 51 push ecx
...[00000b29][002116fa][002016ce](03) 8b4508 mov eax,[ebp+08]
...[00000b2c][002116f6][00000b25](01) 50 push eax
...[00000b2d][002116f6][00000b25](03) 8b4d08 mov ecx,[ebp+08]
...[00000b30][002116f2][00000b25](01) 51 push ecx
...[00000b31][002116ee][00000b36](05) e81ffeffff call 00000955
...[00000b25][0025c126][0025c12a](01) 55 push ebp
...[00000b26][0025c126][0025c12a](02) 8bec mov ebp,esp
...[00000b28][0025c122][0024c0f6](01) 51 push ecx
...[00000b29][0025c122][0024c0f6](03) 8b4508 mov eax,[ebp+08]
...[00000b2c][0025c11e][00000b25](01) 50 push eax
...[00000b2d][0025c11e][00000b25](03) 8b4d08 mov ecx,[ebp+08]
...[00000b30][0025c11a][00000b25](01) 51 push ecx
...[00000b31][0025c116][00000b36](05) e81ffeffff call 00000955
Local Halt Decider: Infinite Recursion Detected Simulation Stopped
--
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-27 16:17 -0400 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(liar liar pants on fire ) |
| Message-ID | <i15CI.689600$ST2.7891@fx47.iad> |
| In reply to | #35422 |
On 6/27/21 4:04 PM, olcott wrote: > On 6/27/2021 2:40 PM, Richard Damon wrote: >> On 6/27/21 2:00 PM, olcott wrote: >>> On 6/27/2021 12:10 PM, Richard Damon wrote: >>>> On 6/27/21 10:43 AM, olcott wrote: >>>>> On 6/26/2021 9:06 PM, Richard Damon wrote: >>>> >>>>>> >>>>>> 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. >>>>> >>>> >>>> Then explain in simple words how you can examine program A to determine >>>> the Halting behavior of program B. >>>> >>>> Note, although you call then all 'P', they are TOTALLY different >>>> programs, with just the smallest part of common code. >>>> >>> >>> That the different levels of infinite recursion are different programs >>> is such a foolishly stupid thing to say. >> >> Nonsense. >> >> There are MANY programs that you call 'P', just as you talk about many >> different H's > > > That I have provided the source-code and machine-code for P along with > the execution trace of the machine-code of P proves that you are a damn > liar. Infinitely nested simulation has computationally equivalent > behavior to infinite recursion. No, you haven't provided the source code for the machine P, as that includes the source code for the subroutine H which you fail to povide. You trace proves that YOU are the liar as you selectively edit it. The REAL trace of P would include the trace of the code of H that P uses. You have also stopped the trace before it has ended, of if that IS the end, you have defined that H(P,P) either isn't a computation or doesn't answer the question. When You HAVE continued the trace, it shows that P(P) reaches its finite end. We can stay that given your claimed behavior of H, and the code for P you have given that by a PROPER emulation we get the following: Main calls P P calls H. H will do its things and then depending on the which answer you are pushing one of the folowing will happen: 1) H will return non-halting and P will then finish and Halt. 2) H is the version that doesn't know how to abort it simulation in this case and just goes into infinite recursion. 3) H does something unexplained but doesn't answer, maybe is some how aborts itself, but in any case, it never returns. In case 1, the fact that P finishes shows that P is a halting computation, and H was wrong. In case 2, the fact that H never answers means it never correctly decided. In case 3, H still never correctly decided. If H when called directly by main returns an answer and any case other than 1 happens, H is shown to NOT be a proper computation, and thus doesn't meet the requirements of the Halting Problem, and the claims that it is the equivalent of a Turng Machine is false.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-27 17:46 -0500 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(liar liar pants on fire ) |
| Message-ID | <gu2dnaKo4YV_YkX9nZ2dnUU7-Q2dnZ2d@giganews.com> |
| In reply to | #35423 |
On 6/27/2021 3:17 PM, Richard Damon wrote:
> On 6/27/21 4:04 PM, olcott wrote:
>> On 6/27/2021 2:40 PM, Richard Damon wrote:
>>> On 6/27/21 2:00 PM, olcott wrote:
>>>> On 6/27/2021 12:10 PM, Richard Damon wrote:
>>>>> On 6/27/21 10:43 AM, olcott wrote:
>>>>>> On 6/26/2021 9:06 PM, Richard Damon wrote:
>>>>>
>>>>>>>
>>>>>>> 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.
>>>>>>
>>>>>
>>>>> Then explain in simple words how you can examine program A to determine
>>>>> the Halting behavior of program B.
>>>>>
>>>>> Note, although you call then all 'P', they are TOTALLY different
>>>>> programs, with just the smallest part of common code.
>>>>>
>>>>
>>>> That the different levels of infinite recursion are different programs
>>>> is such a foolishly stupid thing to say.
>>>
>>> Nonsense.
>>>
>>> There are MANY programs that you call 'P', just as you talk about many
>>> different H's
>>
>>
>> That I have provided the source-code and machine-code for P along with
>> the execution trace of the machine-code of P proves that you are a damn
>> liar. Infinitely nested simulation has computationally equivalent
>> behavior to infinite recursion.
>
> No, you haven't provided the source code for the machine P, as that
OK I will up the ante, you are a damned liar.
void P(u32 x)
{
u32 Input_Halts = H(x, x);
if (Input_Halts)
HERE: goto HERE;
}
_P()
[00000b25](01) 55 push ebp
[00000b26](02) 8bec mov ebp,esp
[00000b28](01) 51 push ecx
[00000b29](03) 8b4508 mov eax,[ebp+08]
[00000b2c](01) 50 push eax
[00000b2d](03) 8b4d08 mov ecx,[ebp+08]
[00000b30](01) 51 push ecx
[00000b31](05) e81ffeffff call 00000955
[00000b36](03) 83c408 add esp,+08
[00000b39](03) 8945fc mov [ebp-04],eax
[00000b3c](04) 837dfc00 cmp dword [ebp-04],+00
[00000b40](02) 7402 jz 00000b44
[00000b42](02) ebfe jmp 00000b42
[00000b44](02) 8be5 mov esp,ebp
[00000b46](01) 5d pop ebp
[00000b47](01) c3 ret
Size in bytes:(0035) [00000b47]
--
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-27 19:03 -0400 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(liar liar pants on fire ) |
| Message-ID | <Ys7CI.664900$2N3.327614@fx33.iad> |
| In reply to | #35430 |
On 6/27/21 6:46 PM, olcott wrote:
> On 6/27/2021 3:17 PM, Richard Damon wrote:
>> On 6/27/21 4:04 PM, olcott wrote:
>>> On 6/27/2021 2:40 PM, Richard Damon wrote:
>>>> On 6/27/21 2:00 PM, olcott wrote:
>>>>> On 6/27/2021 12:10 PM, Richard Damon wrote:
>>>>>> On 6/27/21 10:43 AM, olcott wrote:
>>>>>>> On 6/26/2021 9:06 PM, Richard Damon wrote:
>>>>>>
>>>>>>>>
>>>>>>>> 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.
>>>>>>>
>>>>>>
>>>>>> Then explain in simple words how you can examine program A to
>>>>>> determine
>>>>>> the Halting behavior of program B.
>>>>>>
>>>>>> Note, although you call then all 'P', they are TOTALLY different
>>>>>> programs, with just the smallest part of common code.
>>>>>>
>>>>>
>>>>> That the different levels of infinite recursion are different programs
>>>>> is such a foolishly stupid thing to say.
>>>>
>>>> Nonsense.
>>>>
>>>> There are MANY programs that you call 'P', just as you talk about many
>>>> different H's
>>>
>>>
>>> That I have provided the source-code and machine-code for P along with
>>> the execution trace of the machine-code of P proves that you are a damn
>>> liar. Infinitely nested simulation has computationally equivalent
>>> behavior to infinite recursion.
>>
>> No, you haven't provided the source code for the machine P, as that
>
> OK I will up the ante, you are a damned liar.
That is the code for the FUNCTION P, not the complete code for the
MACHINE P.
If you don't understand the difference, you shouldn't be trying to prove
theorems about Turing Machines.
Call and Raise.
>
> void P(u32 x)
> {
> u32 Input_Halts = H(x, x);
> if (Input_Halts)
> HERE: goto HERE;
> }
>
> _P()
> [00000b25](01) 55 push ebp
> [00000b26](02) 8bec mov ebp,esp
> [00000b28](01) 51 push ecx
> [00000b29](03) 8b4508 mov eax,[ebp+08]
> [00000b2c](01) 50 push eax
> [00000b2d](03) 8b4d08 mov ecx,[ebp+08]
> [00000b30](01) 51 push ecx
> [00000b31](05) e81ffeffff call 00000955
> [00000b36](03) 83c408 add esp,+08
> [00000b39](03) 8945fc mov [ebp-04],eax
> [00000b3c](04) 837dfc00 cmp dword [ebp-04],+00
> [00000b40](02) 7402 jz 00000b44
> [00000b42](02) ebfe jmp 00000b42
> [00000b44](02) 8be5 mov esp,ebp
> [00000b46](01) 5d pop ebp
> [00000b47](01) c3 ret
> Size in bytes:(0035) [00000b47]
>
>
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-27 18:11 -0500 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(liar liar pants on fire ) |
| Message-ID | <nfOdnW60hPElmET9nZ2dnUU7-b_NnZ2d@giganews.com> |
| In reply to | #35431 |
On 6/27/2021 6:03 PM, Richard Damon wrote: > On 6/27/21 6:46 PM, olcott wrote: >> On 6/27/2021 3:17 PM, Richard Damon wrote: >>> On 6/27/21 4:04 PM, olcott wrote: >>>> On 6/27/2021 2:40 PM, Richard Damon wrote: >>>>> On 6/27/21 2:00 PM, olcott wrote: >>>>>> On 6/27/2021 12:10 PM, Richard Damon wrote: >>>>>>> On 6/27/21 10:43 AM, olcott wrote: >>>>>>>> On 6/26/2021 9:06 PM, Richard Damon wrote: >>>>>>> >>>>>>>>> >>>>>>>>> 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. >>>>>>>> >>>>>>> >>>>>>> Then explain in simple words how you can examine program A to >>>>>>> determine >>>>>>> the Halting behavior of program B. >>>>>>> >>>>>>> Note, although you call then all 'P', they are TOTALLY different >>>>>>> programs, with just the smallest part of common code. >>>>>>> >>>>>> >>>>>> That the different levels of infinite recursion are different programs >>>>>> is such a foolishly stupid thing to say. >>>>> >>>>> Nonsense. >>>>> >>>>> There are MANY programs that you call 'P', just as you talk about many >>>>> different H's >>>> >>>> >>>> That I have provided the source-code and machine-code for P along with >>>> the execution trace of the machine-code of P proves that you are a damn >>>> liar. Infinitely nested simulation has computationally equivalent >>>> behavior to infinite recursion. >>> >>> No, you haven't provided the source code for the machine P, as that >> >> OK I will up the ante, you are a damned liar. > > That is the code for the FUNCTION P, not the complete code for the > MACHINE P. > > If you don't understand the difference, you shouldn't be trying to prove > theorems about Turing Machines. > > Call and Raise. > Finally a response that is not pure nonsense. Because the behavior of VM P is entirely controlled by the machine language of function P your correct assessment is utterly moot. Infinitely nested simulation is essentially exactly the same thing as infinite recursion with a few extra purely extraneous details mixed in. -- 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-27 19:57 -0400 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(liar liar pants on fire ) |
| Message-ID | <of8CI.97145$iY.64308@fx41.iad> |
| In reply to | #35434 |
On 6/27/21 7:11 PM, olcott wrote: > On 6/27/2021 6:03 PM, Richard Damon wrote: >> That is the code for the FUNCTION P, not the complete code for the >> MACHINE P. >> >> If you don't understand the difference, you shouldn't be trying to prove >> theorems about Turing Machines. >> >> Call and Raise. >> > > Finally a response that is not pure nonsense. > > Because the behavior of VM P is entirely controlled by the machine > language of function P your correct assessment is utterly moot. How much do you want to bet on that?? Do you REALLY mean that the behavior of P is not affected by the definition of H? Are you sure? What about two simple deciders, H0, always returns 0, calls all machines non-halting H1, always returns 1, calls all machine halting. Do you still want to say that the machine P doesn't change behavior depending on the code of H? CHECKMATE.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-06-27 01:42 +0100 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) |
| Message-ID | <87y2awkuia.fsf@bsb.me.uk> |
| In reply to | #35379 |
olcott <NoOne@NoWhere.com> writes: > 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. I know. I was point out that your attribution line was a lie. You probably have no idea what that means having only used Usenet for a few decades. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Daniel Pehoushek <pehoushek1@gmail.com> |
|---|---|
| Date | 2021-06-26 17:48 -0700 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) |
| Message-ID | <60ca2e77-1c6b-4415-9c74-5a6e73e8d391n@googlegroups.com> |
| In reply to | #35382 |
-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.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-26 20:05 -0500 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) |
| Message-ID | <EOOdnZSMpbpwU0r9nZ2dnUU7-fPNnZ2d@giganews.com> |
| In reply to | #35383 |
On 6/26/2021 7:48 PM, Daniel Pehoushek wrote: > -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? I must first make my point understood by continual improvement of the words of this point. I can only do this through trial-and-error with feedback. Six months ago I had no way to clearly explain exactly why H(P,P)==0 is correct even though P(P) halts. I now have an irrefutable way to clearly explain this. It is the case that P(P) has infinite execution unless one of its infinite chain of invocations is aborted. Try reading the whole paper, if you are the author that you claim to be you should have the capacity to understand that it is correct, even though the form of this paper is not nearly in the ballpark of academic journal quality. Far too many people rank style over substance. Halting problem undecidability and infinitely nested simulation https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Daniel Pehoushek <pehoushek1@gmail.com> |
|---|---|
| Date | 2021-06-26 18:09 -0700 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) |
| Message-ID | <74435bee-b2b5-47b5-8bb3-8267131332bfn@googlegroups.com> |
| In reply to | #35388 |
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?
[toc] | [prev] | [next] | [standalone]
| From | Daniel Pehoushek <pehoushek1@gmail.com> |
|---|---|
| Date | 2021-06-26 18:13 -0700 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) |
| Message-ID | <21ad9305-684b-4e99-8386-61e01e7388a0n@googlegroups.com> |
| In reply to | #35392 |
+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?+
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-26 19:49 -0500 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(I dare you) |
| Message-ID | <be-dndHQ27uMVkr9nZ2dnUU7-RPNnZ2d@giganews.com> |
| In reply to | #35382 |
On 6/26/2021 7:42 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> 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. > > I know. I was point out that your attribution line was a lie. You > probably have no idea what that means having only used Usenet for a few > decades. > Ben Bacarisse the king of dishonest dodges. Ben Bacarisse the king of dishonest dodges. Ben Bacarisse the king of dishonest dodges. 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. 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 21:17 -0400 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(I dare you) |
| Message-ID | <CkQBI.30842$e21.11398@fx02.iad> |
| In reply to | #35385 |
On 6/26/21 8:49 PM, olcott wrote: > On 6/26/2021 7:42 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> 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. >> >> I know. I was point out that your attribution line was a lie. You >> probably have no idea what that means having only used Usenet for a few >> decades. >> > > Ben Bacarisse the king of dishonest dodges. > Ben Bacarisse the king of dishonest dodges. > Ben Bacarisse the king of dishonest dodges. Olcott is the emperor of the dishonest dodge, never answering the tough questions put to him to acutally explain what he is saying, > > 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. > > 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. > The error is a confusion of same named machines. It is True that Pn(Pn) based on a decider Hn that doesn't abort its simulation of Pn will have infinite execution. It it Ture that Ha, a decider based on an algorithm that will abort the simulation of this pattern can correct decide Pn(Pn) The error is that Ha needs to corretly answer for Ha(Pa,Pa), the Pa based on Ha. It is shown that Ha(Pa,Pa) says non-Halting, but the actual run of Pa(Pa) shows that it is Halting, the Ha is WRONG. You LIE like you always do by overloading symbols with different meanings and moving 'proofs' to things they do not apply to. WHAT IS YOU ANSWR TO THIS VALID REBUTTAL. (My guess is you are going to do you normal and just ignore it and lie again that no one has pointed out an error without you actually pointing out a factual error in the error being pointed out).
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-26 20:55 -0500 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(I dare you) |
| Message-ID | <5PudnZb1TYI0R0r9nZ2dnUU7-fHNnZ2d@giganews.com> |
| In reply to | #35394 |
On 6/26/2021 8:17 PM, Richard Damon wrote:
> On 6/26/21 8:49 PM, olcott wrote:
>> On 6/26/2021 7:42 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> 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.
>>>
>>> I know. I was point out that your attribution line was a lie. You
>>> probably have no idea what that means having only used Usenet for a few
>>> decades.
>>>
>>
>> Ben Bacarisse the king of dishonest dodges.
>> Ben Bacarisse the king of dishonest dodges.
>> Ben Bacarisse the king of dishonest dodges.
>
>
> Olcott is the emperor of the dishonest dodge, never answering the tough
> questions put to him to acutally explain what he is saying,
>
>>
>> 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.
>>
>> 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.
>>
>
> The error is a confusion of same named machines.
>
int Factorial(int n)
{
if (n > 1)
return n * Factorial(n - 1);
else
return 1;
}
That is not the way that recursion works.
void P(u32 x)
{
u32 Input_Halts = H(x, x);
if (Input_Halts)
HERE: goto HERE;
}
When P called with the machine address of P invokes simulating halt
decider H(P,P) P is invoking its own machine address in the same way
that Factorial is invoking its own machine address.
--
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:18 -0400 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(I dare you) |
| Message-ID | <geRBI.114225$od.55868@fx15.iad> |
| In reply to | #35398 |
On 6/26/21 9:55 PM, olcott wrote:
> On 6/26/2021 8:17 PM, Richard Damon wrote:
>> On 6/26/21 8:49 PM, olcott wrote:
>>> On 6/26/2021 7:42 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> 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.
>>>>
>>>> I know. I was point out that your attribution line was a lie. You
>>>> probably have no idea what that means having only used Usenet for a few
>>>> decades.
>>>>
>>>
>>> Ben Bacarisse the king of dishonest dodges.
>>> Ben Bacarisse the king of dishonest dodges.
>>> Ben Bacarisse the king of dishonest dodges.
>>
>>
>> Olcott is the emperor of the dishonest dodge, never answering the tough
>> questions put to him to acutally explain what he is saying,
>>
>>>
>>> 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.
>>>
>>> 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.
>>>
>>
>> The error is a confusion of same named machines.
>>
>
> int Factorial(int n)
> {
> if (n > 1)
> return n * Factorial(n - 1);
> else
> return 1;
> }
>
> That is not the way that recursion works.
>
> void P(u32 x)
> {
> u32 Input_Halts = H(x, x);
> if (Input_Halts)
> HERE: goto HERE;
> }
>
> When P called with the machine address of P invokes simulating halt
> decider H(P,P) P is invoking its own machine address in the same way
> that Factorial is invoking its own machine address.
>
WHO IS THROWING IN A DISHONEST DODGE NOW???????
What does that factorial have to do with the problem at hand at all.
You CLEARLY have no concept of what a Turing Machine is or what a
computation is.
The Turing Machine equivalent of P is NOT just to code you have write as
the function P, but it includes its copy of H and everything that H
uses. THAT IS ALL PART OF P.
Change H, and you change the Machine P. PERIOD.
GO ahead, submit your paper and get laughed at for being a moron.
If you made this sort of argument in a freshman course, the instructor
would likely suggest you look at a different major, it is so bad.
DEFINITION: A Turing machine is a mathematical model of computing that
combines a finite state machine which defines that algorithm of the
computation combined with an infinite tape with a finite symbol set, the
symbol under the current tape head, and the current state being the
inputs to the finite state machine, and the outputs being the next state
for the machine, what symbol to write on the tape in the current
location and if the tape is to move a step forward or backwards for the
next state.
That Finite State Machine contains that COMPLETE algorithm of the
machine, so the machine include ALL the code that is part of it. Thus
machine P includes its copy of the algorithm of machine H.
Change H, and you need to change P.
[toc] | [prev] | [next] | [standalone]
| From | Daniel Pehoushek <pehoushek1@gmail.com> |
|---|---|
| Date | 2021-06-26 19:33 -0700 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(I dare you) |
| Message-ID | <5b07cd08-8532-4f42-bd64-07302681fac6n@googlegroups.com> |
| In reply to | #35400 |
+++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?++++++ ========================== ++++++++++++============ +++++++++============= ==================== ================= ============== =========== go pete o go pete o go pete o go go go
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-06-26 20:05 -0700 |
| Subject | Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(I dare you) |
| Message-ID | <sb8ptv$18an$3@gioia.aioe.org> |
| In reply to | #35401 |
On 6/26/2021 7:33 PM, Daniel Pehoushek wrote: > +++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?++++++ > ========================== > ++++++++++++============ > +++++++++============= > ==================== > ================= > ============== > =========== > go pete o go > pete o go > pete o > go go > go > http://fractallife247.com/test/hmac_cipher/ver_0_0_0_1?ct_hmac_cipher=d1b79cd944162e0064a8bceecdfa2d74a7b1de0e8064b403dacc1a7934de866ca2d4b425a4349f8483a21a1bcab32500eea33f4aa2e443af64264b0e8d8edee51d4301a653bb6077e9e009089ce0111dd0375a6556b0912ed2f2667daa757c35a48e654644
[toc] | [prev] | [next] | [standalone]
Page 6 of 10 — ← Prev page 1 … 4 5 [6] 7 8 … 10 Next page →
Back to top | Article view | comp.theory
csiph-web