Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > sci.logic > #170305 > unrolled thread
| Started by | Newberry <newberryxy@gmail.com> |
|---|---|
| First post | 2018-01-16 13:02 -0800 |
| Last post | 2018-02-14 00:44 -0600 |
| Articles | 20 on this page of 310 — 14 participants |
Back to article view | Back to sci.logic
The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-01-16 13:02 -0800
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-16 13:49 -0800
Re: The Semantics of Halting Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2018-01-17 04:04 +0000
Re: The Semantics of Halting Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2018-01-17 10:06 +0000
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-01-17 09:48 -0600
Re: The Semantics of Halting Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2018-01-17 16:09 +0000
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-01-17 08:21 -0800
Re: The Semantics of Halting Peter Percival <peterxpercival@hotmail.com> - 2018-01-17 16:37 +0000
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-01-17 09:28 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-01-17 09:55 -0800
Re: The Semantics of Halting Jim Burns <james.g.burns@att.net> - 2018-01-17 13:24 -0500
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-01-17 21:11 -0600
Re: The Semantics of Halting Peter Percival <peterxpercival@hotmail.com> - 2018-01-17 18:45 +0000
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-17 19:35 -0800
Re: The Semantics of Halting Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2018-01-17 10:15 +0000
Re: The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-01-17 05:04 -0800
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-17 19:34 -0800
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-17 18:23 -0800
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-17 18:38 -0800
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-17 19:22 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-01-17 19:41 -0800
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-17 20:09 -0800
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-17 20:12 -0800
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-02-01 10:51 -0800
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-18 10:09 +0000
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-01-18 06:36 -0800
Re: The Semantics of Halting Peter Percival <peterxpercival@hotmail.com> - 2018-01-18 15:20 +0000
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-01-18 10:49 -0600
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-18 09:58 -0800
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-18 10:59 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-01-18 11:52 -0800
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-20 00:18 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-01-20 06:34 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-01-20 06:41 -0800
Re: The Semantics of Halting Peter Percival <peterxpercival@hotmail.com> - 2018-01-20 15:05 +0000
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-19 01:28 +0000
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-01-18 18:37 -0800
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-18 20:01 -0800
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-18 20:02 -0800
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-20 00:10 +0000
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-18 09:41 -0800
Re: The Semantics of Halting bursejan@gmail.com - 2018-01-20 06:41 -0800
Re: The Semantics of Halting bursejan@gmail.com - 2018-01-20 06:43 -0800
Re: The Semantics of Halting bursejan@gmail.com - 2018-01-20 06:50 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-01-20 09:12 -0600
Re: The Semantics of Halting bursejan@gmail.com - 2018-01-20 07:18 -0800
Re: The Semantics of Halting bursejan@gmail.com - 2018-01-20 07:20 -0800
Re: The Semantics of Halting bursejan@gmail.com - 2018-01-20 07:23 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-01-20 10:22 -0600
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-24 13:12 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-01-24 16:31 -0800
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-24 19:57 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-01-24 20:15 -0800
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-25 20:21 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-01-25 21:29 -0800
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-25 21:38 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-01-25 21:59 -0800
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-27 00:37 +0000
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-01-26 20:21 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-01-26 20:38 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-01-26 21:23 -0800
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-29 20:30 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-01-30 17:17 -0800
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-30 20:47 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-01-31 10:32 -0600
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-30 21:00 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-01-31 10:38 -0600
Re: The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-01-26 21:19 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-01-26 21:31 -0800
Re: The Semantics of Halting "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-27 13:41 -0600
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-01-27 13:15 -0800
Re: The Semantics of Halting "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-27 20:00 -0600
Re: The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-01-27 20:08 -0800
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-28 11:48 +0000
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-01-29 19:51 -0800
Re: The Semantics of Halting "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-29 22:29 -0600
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-01-30 17:13 -0800
Re: The Semantics of Halting "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-30 21:02 -0600
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-30 22:02 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-01-31 10:46 -0600
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-30 20:50 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-01-31 10:37 -0600
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-01-30 01:50 -0800
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-30 03:46 -0800
Re: The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-01-30 07:56 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-01-30 17:21 -0800
Re: The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-01-30 19:56 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-01-31 00:59 -0600
Re: The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-01-31 05:59 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-01-31 16:03 -0600
Re: The Semantics of Halting Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 22:10 +0000
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-01 16:21 -0600
Re: The Semantics of Halting Peter Percival <peterxpercival@hotmail.com> - 2018-02-05 15:02 +0000
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-05 16:24 -0800
Re: The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-01-31 15:10 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-01 16:47 -0600
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-01 23:02 +0000
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-01-29 19:36 -0800
Re: The Semantics of Halting "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-29 22:32 -0600
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-29 20:50 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-01-30 17:19 -0800
Re: The Semantics of Halting "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-30 21:08 -0600
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-01-30 23:32 -0600
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-30 22:04 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-01-31 10:48 -0600
Re: The Semantics of Halting Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 17:31 +0000
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-01-31 22:12 -0600
Re: The Semantics of Halting "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-31 22:41 -0600
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-01-31 22:55 -0800
Re: The Semantics of Halting "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-02-01 09:22 -0600
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-01 08:36 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-01 15:15 -0600
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-01 01:23 -0600
Re: The Semantics of Halting "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-02-01 09:46 -0600
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-01 14:51 -0600
Re: The Semantics of Halting Peter Percival <peterxpercival@hotmail.com> - 2018-02-01 20:58 +0000
Re: The Semantics of Halting "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-02-01 17:35 -0600
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-02-04 16:30 -0800
Re: The Semantics of Halting Peter Percival <peterxpercival@hotmail.com> - 2018-02-01 17:36 +0000
Re: The Semantics of Halting Peter Percival <peterxpercival@hotmail.com> - 2018-02-01 17:06 +0000
Re: The Semantics of Halting "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-31 19:45 -0600
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-01 19:16 -0600
Re: The Semantics of Halting Peter Percival <peterxpercival@hotmail.com> - 2018-02-02 20:39 +0000
Re: The Semantics of Halting "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-02-02 21:38 -0600
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-02 21:48 -0800
Re: The Semantics of Halting Jim Burns <james.g.burns@att.net> - 2018-02-03 10:56 -0500
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-02-03 15:12 -0800
Re: The Semantics of Halting Jim Burns <james.g.burns@att.net> - 2018-02-03 20:24 -0500
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-03 18:21 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-03 16:33 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-02-03 16:51 -0800
Re: The Semantics of Halting Peter Percival <peterxpercival@hotmail.com> - 2018-02-04 13:47 +0000
Re: The Semantics of Halting Jim Burns <james.g.burns@att.net> - 2018-02-04 19:35 -0500
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-04 20:32 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-02-03 14:55 -0800
Re: The Semantics of Halting "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-02-03 20:41 -0600
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-02-03 21:28 -0800
Re: The Semantics of Halting "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-02-05 19:02 -0600
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-02-05 17:34 -0800
Re: The Semantics of Halting "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-02-05 20:48 -0600
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-02-05 19:46 -0800
Re: The Semantics of Halting Peter Percival <peterxpercival@hotmail.com> - 2018-02-06 13:21 +0000
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-02-06 08:38 -0800
Re: The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-01-30 07:57 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-01-30 17:24 -0800
Re: The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-01-30 19:48 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-01-31 00:56 -0600
Re: The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-01-31 05:49 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-01-31 15:40 -0600
Re: The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-01-31 15:15 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-01 16:50 -0600
Re: The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-02-01 16:50 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-01 23:06 -0600
Re: The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-02-02 07:50 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-02 10:10 -0600
Re: The Semantics of Halting Jim Burns <james.g.burns@att.net> - 2018-02-02 19:33 -0500
Re: The Semantics of Halting Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 15:39 +0000
Re: The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-01-31 09:43 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-01-31 22:53 -0600
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-30 21:02 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-01-31 10:43 -0600
Re: The Semantics of Halting Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 17:28 +0000
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-01-31 22:10 -0600
Re: The Semantics of Halting "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-31 22:51 -0600
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-01 10:04 -0600
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-01 16:30 +0000
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-01 15:12 -0600
Re: The Semantics of Halting Peter Percival <peterxpercival@hotmail.com> - 2018-02-01 21:26 +0000
Re: The Semantics of Halting Peter Percival <peterxpercival@hotmail.com> - 2018-02-01 17:48 +0000
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-01-31 19:54 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-01 18:40 -0800
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-02-01 10:46 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-01-30 17:25 -0800
Re: The Semantics of Halting "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-30 21:10 -0600
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-01-30 23:41 -0600
Re: The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-01-30 22:12 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-01-31 10:50 -0600
Re: The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-01-31 09:53 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-01-31 23:13 -0600
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-01-31 22:24 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-01-31 22:28 -0800
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-01 11:25 +0000
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-01 08:33 -0800
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-01 17:45 +0000
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-01 10:43 -0600
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-01 22:28 +0000
Re: The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-02-01 08:05 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-01 15:21 -0800
Re: The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-02-01 17:08 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-01 22:33 -0800
Re: The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-02-02 09:38 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-02-03 14:41 -0800
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-04 00:08 +0000
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-02-03 16:31 -0800
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-04 01:19 +0000
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-03 22:28 -0600
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-04 02:24 -0800
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-04 21:24 +0000
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-02-05 17:19 -0800
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-06 02:40 +0000
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-06 03:18 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-02-06 08:35 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-06 13:45 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-02-06 16:47 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-06 22:40 -0600
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-06 22:21 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-06 23:24 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-07 09:54 -0600
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-02-06 22:28 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-02-06 22:52 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-06 22:36 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-06 19:46 -0800
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-07 01:52 +0000
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-02-06 18:45 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-07 18:58 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-02-07 19:12 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-07 19:25 -0800
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-08 15:31 +0000
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-08 19:35 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-08 22:38 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-08 23:22 -0800
Re: The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-02-09 09:28 -0800
Re: The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-02-10 22:17 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-11 00:49 -0600
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-11 00:38 -0800
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-11 12:13 +0000
Re: The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-02-11 07:14 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-02-12 18:05 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-12 18:23 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-12 21:00 -0600
Re: The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-02-12 20:39 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-12 21:26 -0800
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-13 04:21 +0000
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-13 10:12 -0600
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-13 20:03 +0000
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-13 19:24 -0600
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-14 02:41 +0000
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-13 22:34 -0600
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-14 05:29 +0000
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-14 00:22 -0600
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-14 14:05 +0000
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-14 09:44 -0600
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-14 16:18 +0000
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-02-09 11:10 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-09 21:27 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-07 17:52 -0600
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-07 17:12 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-02-07 17:33 -0800
Re: The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-02-07 20:14 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-02-07 20:58 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-07 21:08 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-02-07 21:45 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-07 22:48 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-02-07 23:16 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-07 23:25 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-07 21:13 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-07 23:08 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-02-07 23:20 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-07 23:29 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-07 23:34 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-07 14:06 -0600
Re: The Semantics of Halting Andy Walker <anw@cuboid.co.uk> - 2018-02-08 01:52 +0000
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-07 18:38 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-07 19:09 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-07 21:28 -0600
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-07 19:46 -0800
Re: The Semantics of Halting peteolcott <peterolcott2@gmail.com> - 2018-02-07 20:17 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-07 20:26 -0800
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-08 20:26 +0000
Re: The Semantics of Halting Andy Walker <anw@cuboid.co.uk> - 2018-02-09 12:27 +0000
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-09 23:06 -0600
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-07 21:26 +0000
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-07 17:30 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-07 14:58 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-07 11:45 -0600
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-07 18:25 +0000
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-06 22:34 -0600
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-07 15:43 +0000
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-07 03:40 +0000
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-03 16:40 -0800
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-02-04 16:40 -0800
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-31 21:12 +0000
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-01 09:58 -0600
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-01 22:00 +0000
Re: The Semantics of Halting "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-31 19:52 -0600
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-01 17:30 -0800
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-02-01 10:45 -0800
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-27 21:16 +0000
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-01-27 13:56 -0800
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-27 22:04 +0000
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-01-27 19:17 -0800
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-28 11:16 +0000
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-01-26 18:04 -0800
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-25 21:48 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-01-24 20:44 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-01-20 10:14 -0600
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-20 17:09 +0000
Re: The Semantics of Halting George Greene <greeneg@email.unc.edu> - 2018-01-24 13:11 -0800
Re: The Semantics of Halting "Renee Keller" <rkeller@aol.com> - 2018-01-24 10:25 -0500
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-01-20 09:19 -0600
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-01-24 15:41 -0800
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-07 19:58 -0800
Re: The Semantics of Halting Newberry <newberryxy@gmail.com> - 2018-02-07 20:23 -0800
Re: The Semantics of Halting "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-02-13 02:21 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-13 16:25 -0600
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-14 00:42 +0000
Re: The Semantics of Halting grahamcooper7@gmail.com - 2018-02-13 19:28 -0800
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-13 22:10 -0600
Re: The Semantics of Halting Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-14 05:35 +0000
Re: The Semantics of Halting Pete Olcott <Pete@NoEmail.address> - 2018-02-14 00:44 -0600
Page 15 of 16 — ← Prev page 1 … 13 14 [15] 16 Next page →
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2018-02-04 16:40 -0800 |
| Message-ID | <ca205d6b-5f50-43d0-9a37-7708946033f4@googlegroups.com> |
| In reply to | #171600 |
On Thursday, February 1, 2018 at 4:07:06 PM UTC-5, Pete Olcott wrote: > The HP proof counter-examples all get stuck in infinite > recursion They DO NOT. The Linz example you are talking about DOES NOT recurse, so that refutes you right there. BUT IT WOULDN'T EVEN MATTER IF THEY DID infinitely recurse, because if they did, then THEY WOULD NOT HALT, and any "Halt-decider" ANYWHERE NEAR this would have to RETURN FALSE in that context. The fact that, in this example, the purported halt- decider WOULD NOT return false, BUT WOULD INFINITELY RECURSE, implies that said halt-decider IS NOT a halt-decider. If "incorrect questions" produce infinite recursion, then a halt-decider should answer all of them with "false", HALTING in giving that answer. BUT IT CAN'T. SO IT FAILS. THEY *ALL* fail. This really is a proof that halt-deciders don't exist. Even if they ONLY failed on "incorrect questions", the fact that THEY CAN'T DETECT these "incorrect questions" and halt-false means THEY FAIL. NO TM meets the spec of a halt-decider. There is nothing wrong with any of the proofs of that fact, EVEN if those proofs make use of "incorrect questions". AN ACTUAL decider could IDENTIFY AND HANDLE those questions, ESPECIALLY IF *YOU* can (which you can't either, but whatever -- a question being non-well-founded does NOT make it "incorrect" in anyone's dictionary but yours). > It means the decider will not say either yes or no. It will not > decide this particular case. Therefore it is not a universal > decider. That proves the theorem. Exactly. > > because they > are specifically encoded to get stuck in infinite recursion. Well, "non-well-founded-questions" might do that BUT THE LINZ COUNTER- EXAMPLE THAT YOU HAVE BEEN QUOTING *DOES*NOT*!! > > > > > If we eliminate this infinite recursion from their encoding they > no longer get stuck. YOU CAN'T eliminate anything "from their encoding" without CHANGING THEM INTO *A*DIFFERENT* PROGRAM!! The question is ABOUT *THAT* program, NOT about some other! And that program (from the Linz example) DOES NOT EVEN HAVE any infinite recursion IN ANY case! Whether it does or doesn't recurse DEPENDS ON THE BEHAVIOR OF H! H can be ANY TM, INCLUDING some TMs that cause infinite recursion, but given that we INTEND H to be a halting decider, H*CAN'T* do anything that would cause infinite recursion, because H has to always halt! So you can JUST ASSUME, WITHOUT loss of generality, that H *DOESN'T* re-invoke the machine described by w^ (which is H^). YOU DON'T have to change anything's code or calling!
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2018-01-31 21:12 +0000 |
| Message-ID | <87tvv1bum6.fsf@bsb.me.uk> |
| In reply to | #171465 |
Pete Olcott <Pete@NoEmail.address> writes: > On 1/30/2018 9:10 PM, Shobe, Martin wrote: >> On 1/30/2018 7:25 PM, peteolcott wrote: <snip> >>> Not being able to correctly answer an incorrect question >>> is not an actual limitation at all. >> >> In the halting problem, the question isn't incorrect. > > No you are wrong. It is exactly the same thing as trying to figure out of > whether the Liar Paradox is true or False: > > "This sentence is not true". Unlike sentences which are not always true or false, TM calculations always halt or do not halt. This false analogy has got you into trouble before. > Most people get confused and think the problem is that if it is true then > it it false and if it is false then it it true. This is not the actual problem. > > The HP counter-example is merely the TM version of the Liar Paradox. > If it halts then go into an infinite loop otherwise halt. No it isn't. The main reason it isn't is that there is no HP counter-example. Now, you will probably accuse me of lying because you think you understand the proof and you are as sure as anyone has ever been that it is based on a counter-example, but I urge you to consider the possibility that I may know more about this than you think and that it may therefore be worth while trying to find out what I mean. At the moment you are thinking "Ben's just deliberately lying -- he knows as well as I do that the proof relies on a counter-example" and you just can't imagine there could be any other explanation. If you stick with that view, I can't help and you will continue to be egregiously wrong. But I am seriously and sincerely telling you no -- your whole sentence is rubbish from the word counter-example onwards. I won't say more now because it will be a total waste of time unless you decide that I might know something you'd like to know too. If you do want to know more, I am sure you can find some way of asking what I mean that will help me to know why think the proof you ave got so confused by is based on a counter-example. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Pete Olcott <Pete@NoEmail.address> |
|---|---|
| Date | 2018-02-01 09:58 -0600 |
| Message-ID | <I-2dnYipzemipO7HnZ2dnUU7-RvNnZ2d@giganews.com> |
| In reply to | #171521 |
On 1/31/2018 3:12 PM, Ben Bacarisse wrote: > Pete Olcott <Pete@NoEmail.address> writes: > >> On 1/30/2018 9:10 PM, Shobe, Martin wrote: >>> On 1/30/2018 7:25 PM, peteolcott wrote: > <snip> >>>> Not being able to correctly answer an incorrect question >>>> is not an actual limitation at all. >>> >>> In the halting problem, the question isn't incorrect. >> >> No you are wrong. It is exactly the same thing as trying to figure out of >> whether the Liar Paradox is true or False: >> >> "This sentence is not true". > > Unlike sentences which are not always true or false, TM calculations > always halt or do not halt. This false analogy has got you into trouble > before. http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/ The HP proof counter-examples all get stuck in infinite recursion because they are specifically encoded to get stuck in infinite recursion. If we eliminate this infinite recursion from their encoding they no longer get stuck. Definition of Turing Machine Ĥ (state transition sequence) q0 ŵ ⊢* Ĥ qx ŵ ŵ ⊢* Ĥ qy ∞ q0 ŵ ⊢* Ĥ qx ŵ ŵ ⊢* Ĥ qn Eliminating the infinite recursion from Ĥ we have: q0 ŵ ŵ2 ⊢* Ĥ qy ∞ q0 ŵ ŵ2 ⊢* Ĥ qn ŵ2 transitions to qn indicating that NULL input is not a TM that would halt on its input. thus causing ŵ to transition to qy. thus causing Ĥ to transition to qn correctly deciding halting for ŵ ŵ2. Copyright 2016 2017, 2018 Pete Olcott -- *∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2018-02-01 22:00 +0000 |
| Message-ID | <87k1vw5q17.fsf@bsb.me.uk> |
| In reply to | #171597 |
Pete Olcott <Pete@NoEmail.address> writes: > On 1/31/2018 3:12 PM, Ben Bacarisse wrote: >> Pete Olcott <Pete@NoEmail.address> writes: >> >>> On 1/30/2018 9:10 PM, Shobe, Martin wrote: >>>> On 1/30/2018 7:25 PM, peteolcott wrote: >> <snip> >>>>> Not being able to correctly answer an incorrect question >>>>> is not an actual limitation at all. >>>> >>>> In the halting problem, the question isn't incorrect. >>> >>> No you are wrong. It is exactly the same thing as trying to figure out of >>> whether the Liar Paradox is true or False: >>> >>> "This sentence is not true". >> >> Unlike sentences which are not always true or false, TM calculations >> always halt or do not halt. This false analogy has got you into trouble >> before. > > http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/ > > The HP proof counter-examples all get stuck in infinite recursion because they > are specifically encoded to get stuck in infinite recursion. I see we are stuck in a loop too. No, the proof has no "counter-examples" and the computations you call "counter-examples" do not get stuck in infinite recursion. You think (as you have from the very start) that what you keep incorrectly calling a counter-example is analogous to a question with no correct answer, and I (and others) keep telling you that that can not be the case because every computation either halts or does not halt, and so every question of the form "does computation X halt in input Y" has a correct yes/no answer. It does not matter that Y refers to some encoding of X -- there is still a correct answer. It is not just quibbling when I complain about your calling the computation used in the proof "a counter-example". You actually think there is such a thing and that (because of its contradictory nature) it is meaningless. This whole line of reasoning has been leading you astray for many, many years. There is no H that meets the specification, so there is no H' or H^ as described either. They are simply hypothesised for the purpose of a proof by contradiction. Things that can't, logically, exist are always "meaningless" in some sense. Of course the computation q0 w^ |-*H^ and its consequences are absurd -- there is not such machine as H^. > If we eliminate this infinite recursion from their encoding they no > longer get stuck. > > Definition of Turing Machine Ĥ (state transition sequence) > q0 ŵ ⊢* Ĥ qx ŵ ŵ ⊢* Ĥ qy ∞ > q0 ŵ ⊢* Ĥ qx ŵ ŵ ⊢* Ĥ qn This says that H^ always transitions from state qx to either state qy or qn in a finite number of steps. It directly contradicts what you (incorrectly) claim to be the case. You need to either stop writing it or start believing it (the latter being the correct choice). If you stop writing it, you could learn what the notation means and write what say in words using this notation. You would still be wrong, but you wouldn't be writing two contradictory things in the same post all the time. <snip> -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | "Shobe, Martin" <martin.shobe@yahoo.com> |
|---|---|
| Date | 2018-01-31 19:52 -0600 |
| Message-ID | <p4trsj$fls$1@dont-email.me> |
| In reply to | #171465 |
On 1/30/2018 11:41 PM, Pete Olcott wrote: > On 1/30/2018 9:10 PM, Shobe, Martin wrote: >> On 1/30/2018 7:25 PM, peteolcott wrote: >>> On Tuesday, January 30, 2018 at 9:57:27 AM UTC-6, Newberry wrote: >>>> peteolcott wrote: >>>>> On Saturday, January 27, 2018 at 10:08:54 PM UTC-6, Newberry wrote: >>>>>> peteolcott wrote: >>>>>>> On Saturday, January 27, 2018 at 1:41:31 PM UTC-6, Shobe, Martin >>>>>>> wrote: >>>>>>>> On 1/26/2018 11:31 PM, peteolcott wrote: >>>>>>>>> On Friday, January 26, 2018 at 11:19:10 PM UTC-6, Newberry wrote: >>>>>>>>>> peteolcott wrote: >>>>>>>>>>> On Friday, January 26, 2018 at 6:37:25 PM UTC-6, Ben >>>>>>>>>>> Bacarisse wrote: >>>>>>>>>>>> peteolcott writes: >>>>>>>>>>>> >>>>>>>>>>>>> On Thursday, January 25, 2018 at 11:38:40 PM UTC-6, George >>>>>>>>>>>>> Greene wrote: >>>>>>>>>>>>>> On Friday, January 26, 2018 at 12:29:23 AM UTC-5, >>>>>>>>>>>>>> peteolcott wrote: >>>>>>>>>>>>>>> I know what a TM is. >>>>>>>>>>>>>> >>>>>>>>>>>>>> No, dumbass, YOU REALLY don't. You don't even know >>>>>>>>>>>>>> whether it is software >>>>>>>>>>>>>> or hardware. >>>>>>>>>>>>>> >>>>>>>>>>>>> >>>>>>>>>>>>> You are the stupid one here George, everyone knows that a >>>>>>>>>>>>> TM (as >>>>>>>>>>>>> originally envisioned by Alan Turing) was a man with a >>>>>>>>>>>>> paper and >>>>>>>>>>>>> pencil. >>>>>>>>>>>> >>>>>>>>>>>> No. You can't have read Turing's 1936 paper because he's >>>>>>>>>>>> clear about >>>>>>>>>>>> what a-machines (the main subject of the paper) are. Don't >>>>>>>>>>>> you think it >>>>>>>>>>>> would have been worth a quick check before posting? >>>>>>>>>>>> >>>>>>>>>>>> And even if *you* are sure about this, how can you be so >>>>>>>>>>>> sure that >>>>>>>>>>>> "everyone knows" this false thing? >>>>>>>>>>>> >>>>>>>>>>>> By the way, you could do worse than actually read Turing's >>>>>>>>>>>> paper.. You >>>>>>>>>>>> would see a form of TM that might surprise you, along with a >>>>>>>>>>>> different >>>>>>>>>>>> proof of the result that we know call the halting theorem. >>>>>>>>>>>> And as a >>>>>>>>>>>> bonus, the paper outlines a proof that the lambda calculus is >>>>>>>>>>>> computationally equivalent to (what we now call) Turning >>>>>>>>>>>> machines. >>>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> Only untyped Lambda Calculus though. I spent a week studying it >>>>>>>>>>> from four different sources. It apparently is the language of >>>>>>>>>>> semantic subatomic compositionality considering it is TM >>>>>>>>>>> complete >>>>>>>>>>> with only four lines of BNF. >>>>>>>>>>> >>>>>>>>>>>> <snip> >>>>>>>>>>>>> Would you bet your soul that the Halting Problem proof is >>>>>>>>>>>>> correct? >>>>>>>>>>>> >>>>>>>>>>>> There are few theorems about which I am more certain. It >>>>>>>>>>>> has been >>>>>>>>>>>> extensively studied, verified, and proved in a variety of >>>>>>>>>>>> different ways >>>>>>>>>>>> (for example, Turing's original proof is rarely seen these >>>>>>>>>>>> days).. >>>>>>>>>>>> What's more, the result dovetails with a body on knowledge >>>>>>>>>>>> that I don't >>>>>>>>>>>> think you are aware of. Finally, it's one of the simplest >>>>>>>>>>>> theorems, >>>>>>>>>>>> with one of the simplest proofs. It can usually be covered >>>>>>>>>>>> in just one >>>>>>>>>>>> lecture with another set aside for the inevitable "can't a >>>>>>>>>>>> machine just >>>>>>>>>>>> detect the fact that it's being 'tricked'" objection. Yes, >>>>>>>>>>>> every year >>>>>>>>>>>> someone would come up with a version of your "pathological >>>>>>>>>>>> self-reference" (the kind from a decade ago -- I'm not sure >>>>>>>>>>>> what you >>>>>>>>>>>> mean by that phrase nowadays). >>>>>>>>>>>> >>>>>>>>>>>> -- >>>>>>>>>>>> Ben. >>>>>>>>>>> >>>>>>>>>>> Yet you never bothered to actually trace through the steps of >>>>>>>>>>> my new >>>>>>>>>>> insight so you essentially have nothing more than presumption >>>>>>>>>>> that I >>>>>>>>>>> am incorrect. I spent 3000 hours on this since 2004 and just >>>>>>>>>>> noticed >>>>>>>>>>> the infinitely recursive essence the first time on August >>>>>>>>>>> 2016. On >>>>>>>>>>> my post back then I simply thought it was a mistake by Linz. >>>>>>>>>>> >>>>>>>>>>> http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/ >>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> The trace of the evaluation sequence gets stuck in infinite >>>>>>>>>>> recursion >>>>>>>>>>> after state (qx), thus never makes it to state of (qy) or >>>>>>>>>>> ((qn)). >>>>>>>>>> >>>>>>>>>> That is the proof of the Halting Theorem. >>>>>>>>> >>>>>>>>> No it is not. >>>>>>>> >>>>>>>> Agreed, though if you could actually show that gets stuck in >>>>>>>> infinite >>>>>>>> recursion, it would be. The definition of H requires that it >>>>>>>> doesn't get >>>>>>>> stuck in infinite recursion regardless of what input is supplied. >>>>>>>> >>>>>>> >>>>>>> >>>>>>> Yet to provide a simpler analogy that would be like "defining" that >>>>>>> a TM always halts even if it is required to count the characters of >>>>>>> an infinite length string. (A self-contradictory specification). >>>>>>> >>>>>>> >>>>>>>> It is a very very subtle refutation of the Halting Theorem. >>>>>>>>> The above machine definition is required to evaluate an >>>>>>>>> infinite number >>>>>>>>> of finite strings. This is not at all the same thing as getting >>>>>>>>> stuck in >>>>>>>>> an infinite loop. >>>>>>>> >>>>>>>> There's nothing subtle about your error here. Both infinite >>>>>>>> loops and >>>>>>>> infinite recursion prevent H from halting. If you can prove that >>>>>>>> either >>>>>>>> happens, you've proven that H does not solve the halting problem. >>>>>>>> >>>>>>>> Martin Shobe >>>>>>> >>>>>>> If a TM cannot decide whether or not a TMD of infinite length halts >>>>>>> or fails to halt because the TMD is of infinite length then this >>>>>>> is not a valid counter-example showing the this TM is not a decider. >>>>>>> >>>>>>> The reasoning that I provided is exactly analogous to this. If >>>>>>> the David Hilbert mathematical formalism of the HP counter-example >>>>>>> specifies infinitely recursive inputs then this counter-example >>>>>>> is semantically incorrect and thus not valid. >>>>>> >>>>>> But the Halting Theorem does NOT say "there is no H that can always >>>>>> decide when P(q) halts WHEN P AND q ARE VALID." It says "there is >>>>>> no H >>>>>> that can always decide when P(q) halts if ANY P and q are considered >>>>>> including the non-valid ones." >>>>>> >>>>>>> It is exactly same error as the Liar Paradox: LP ≡ ~True(LP) >>>>>>> and the Truth Teller Paradox: TT ≡ True(TT) >>>>>>> TT does not evaluate to True or False for this same reason >>>>>>> (infinitely recursive evaluation sequence). >>>>>> >>>>>> That is what the Halting Theorem says: There is no universal decider >>>>>> because of the possibility of infinite recursion. Your self-reference >>>>>> argument corroborates the theorem, it does not refute it. >>>>> >>>>> Yet that is analogous to saying that no human is smart enough >>>>> to answer every yes/no question including incorrect yes/no questions >>>>> such as: What time is it (yes or no)? >>>> >>>> If you can say it about people why cannot a theorem say it about >>>> machines? >>> >>> Not being able to correctly answer an incorrect question >>> is not an actual limitation at all. >>> >> >> In the halting problem, the question isn't incorrect. > > > No you are wrong. It is exactly the same thing as trying to figure out of > whether the Liar Paradox is true or False: > > "This sentence is not true". No it isn't. Unlike "This sentence is not true". The question "does the Turing machine described by w halt on input m" always has a correct answer. The halting function is total. > Most people get confused and think the problem is that if it is true then > it it false and if it is false then it it true. This is not the actual > problem. > > The HP counter-example is merely the TM version of the Liar Paradox. > If it halts then go into an infinite loop otherwise halt. > > "This sentence is True" is not true either. Saul Kripke has a good idea. > he called it ungrounded. Why and how is it ungrounded? The HP isn't ungrounded as Kripke means the term. Is this another term where you're using a subtly incompatible meaning? > Its evaluation sequence gets stuck in infinite recursion, this is > formalized > in HOL with self-reference semantics. No. Martin Shobe
[toc] | [prev] | [next] | [standalone]
| From | grahamcooper7@gmail.com |
|---|---|
| Date | 2018-02-01 17:30 -0800 |
| Message-ID | <a0675c67-3a6d-466e-be69-bf468dce1f27@googlegroups.com> |
| In reply to | #171555 |
OUTRIGHT - FUKING - LIAR! > None of that matters because I just showed Ĥ ŵ ŵ2 is > Decidable > > http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/
[toc] | [prev] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2018-02-01 10:45 -0800 |
| Message-ID | <6ff177c8-be86-4857-b5f8-9a52f7504519@googlegroups.com> |
| In reply to | #171394 |
On Tuesday, January 30, 2018 at 8:25:18 PM UTC-5, peteolcott wrote: > Not being able to correctly answer an incorrect question > is not an actual limitation at all. But NO question of the form "does machine M halt on input i?" is incorrect if neither m nor i is "incorrect". The fact that you personally don't like some kind of question is not SUFFICIENT to make it "incorrect". There are plenty of non-well-founded sentences that are meaningful.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2018-01-27 21:16 +0000 |
| Message-ID | <87zi4zgfyf.fsf@bsb.me.uk> |
| In reply to | #171142 |
peteolcott <peterolcott2@gmail.com> writes: > On Friday, January 26, 2018 at 6:37:25 PM UTC-6, Ben Bacarisse wrote: >> peteolcott writes: >> >> > On Thursday, January 25, 2018 at 11:38:40 PM UTC-6, George Greene wrote: >> >> On Friday, January 26, 2018 at 12:29:23 AM UTC-5, peteolcott wrote: >> >> > I know what a TM is. >> >> >> >> No, dumbass, YOU REALLY don't. You don't even know whether it is software >> >> or hardware. >> >> >> > >> > You are the stupid one here George, everyone knows that a TM (as >> > originally envisioned by Alan Turing) was a man with a paper and >> > pencil. >> >> No. You can't have read Turing's 1936 paper because he's clear about >> what a-machines (the main subject of the paper) are. Don't you think it >> would have been worth a quick check before posting? >> >> And even if *you* are sure about this, how can you be so sure that >> "everyone knows" this false thing? >> >> By the way, you could do worse than actually read Turing's paper. You >> would see a form of TM that might surprise you, along with a different >> proof of the result that we know call the halting theorem. And as a >> bonus, the paper outlines a proof that the lambda calculus is >> computationally equivalent to (what we now call) Turning machines. > > Only untyped Lambda Calculus though. I spent a week studying it > from four different sources. Was one of them the paper? It seems unlikely given your claim about what everybody knows about Turing's original conception. If you did read it (and I think you should) did you find a flaw in the proof in that paper of what has come to be called the halting theorem? It's quite different to the one in Linz. Can I assume that you consider *that* theorem and *that* proof to be valid? > It apparently is the language of > semantic subatomic compositionality considering it is TM complete > with only four lines of BNF. Four lines is quite a lot! Combinators that use only function application and ()s are also Turing complete. <snip> > Yet you never bothered to actually trace through the steps of my new > insight so you essentially have nothing more than presumption that I > am incorrect. I have now. I did not need to before because George stepped in. By the way, presuming you are incorrect is a logically valid strategy because there is a theorem that says you are wrong. I don't presume you are wrong because you talk nonsense or because you seem to not know what you are taking about. I presume you are wrong because a well-studied (and simple) theorem says so. Also, no one is obliged to help you see the error, especially as everyone here will be well aware of the fact that such an attempt will fail and probably result in accusations of dishonesty. <text removed> -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | grahamcooper7@gmail.com |
|---|---|
| Date | 2018-01-27 13:56 -0800 |
| Message-ID | <f7a9433c-6b56-455d-a5ea-969040ef4d99@googlegroups.com> |
| In reply to | #171201 |
> By the way, presuming you are incorrect is a logically valid strategy > because there is a theorem that says you are wrong. I don't presume you > are wrong because you talk nonsense or because you seem to not know what > you are taking about. I presume you are wrong because a well-studied > (and simple) theorem says so. a well studied and simple theorem that RESULTS in some REAL NUMBERS EXISTING that NO COMPUTER CAN CALCULATE at all! C'Mon Ben... try a bit harder. if 10 GOTO 10 was a simple accepted program you'd keep coding right?
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2018-01-27 22:04 +0000 |
| Message-ID | <87inbngdrj.fsf@bsb.me.uk> |
| In reply to | #171203 |
grahamcooper7@gmail.com writes: >> By the way, presuming you are incorrect is a logically valid strategy >> because there is a theorem that says you are wrong. I don't presume you >> are wrong because you talk nonsense or because you seem to not know what >> you are taking about. I presume you are wrong because a well-studied >> (and simple) theorem says so. > > a well studied and simple theorem > > that RESULTS in some REAL NUMBERS EXISTING that NO COMPUTER CAN > CALCULATE at all! That result follows from an even simpler theorem which shows that there can be no bijection from Turing machines to R. That's in Turning's paper as well but just as an aside. His focus is on what numbers are not computable. > C'Mon Ben... try a bit harder. "C'Mon Ben" is not valid argument. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | grahamcooper7@gmail.com |
|---|---|
| Date | 2018-01-27 19:17 -0800 |
| Message-ID | <fba1d61b-c2a8-4050-b436-849820db9840@googlegroups.com> |
| In reply to | #171205 |
On Sunday, January 28, 2018 at 8:04:02 AM UTC+10, Ben Bacarisse wrote: > grahamcooper7@gmail.com writes: > > >> By the way, . I don't presume you > >> are wrong because you talk nonsense or because you seem to not know what > >> you are taking about. I presume you are wrong because a well-studied > >> (and simple) theorem says so. > > > > a well studied and simple theorem > > > > that RESULTS in some REAL NUMBERS EXISTING that NO COMPUTER CAN > > CALCULATE at all! > > That result follows from an even simpler theorem which shows that therepresuming you are incorrect is a logically valid strategy > >> because there is a theorem that says you are wrong > can be no bijection from Turing machines to R. That's in Turning's > paper as well but just as an aside. His focus is on what numbers are > not computable. > > > C'Mon Ben... try a bit harder. > > "C'Mon Ben" is not valid argument. Argument by authority is not a valid argument. BEN - "presuming you are incorrect is a logically valid strategy because there is a theorem that says you are wrong" You claim HALTING IS SIMPLE ENOUGH. there is a DIRECT COROLLERY of non-computable R Avoiding the topic is not a valid argument either.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2018-01-28 11:16 +0000 |
| Message-ID | <87bmhegrmw.fsf@bsb.me.uk> |
| In reply to | #171216 |
grahamcooper7@gmail.com writes: > On Sunday, January 28, 2018 at 8:04:02 AM UTC+10, Ben Bacarisse wrote: >> grahamcooper7@gmail.com writes: >> >> >> By the way, . I don't presume you >> >> are wrong because you talk nonsense or because you seem to not know what >> >> you are taking about. I presume you are wrong because a well-studied >> >> (and simple) theorem says so. >> > >> > a well studied and simple theorem >> > >> > that RESULTS in some REAL NUMBERS EXISTING that NO COMPUTER CAN >> > CALCULATE at all! >> >> That result follows from an even simpler theorem which shows that therepresuming you are incorrect is a logically valid strategy >> >> because there is a theorem that says you are wrong (Your quoting has got all messed up here) >> can be no bijection from Turing machines to R. That's in Turning's >> paper as well but just as an aside. His focus is on what numbers are >> not computable. >> >> > C'Mon Ben... try a bit harder. >> >> "C'Mon Ben" is not valid argument. > > Argument by authority is not a valid argument. No one has made such an argument. Citing a theorem is not an argument from authority but a pointer to where the mathematical argument can be found. It simply saves time. > BEN - "presuming you are incorrect is a logically valid strategy > because there is a theorem that says you are wrong" A theorem has a proof. That proof is a valid argument. It is perfectly reasonable to save time by not repeating it every time the subject comes up. That's what textbooks are for. > You claim HALTING IS SIMPLE ENOUGH. No, I am making no claims. I am pointing out facts about Turing machines and numbers along with sound proofs that establish those facts. It's true that I did not give you exact citations, but that's hardly necessary these days. Anyway, presumably you have at lest one good book on the subject? If it does have the sound arguments you seek, just as for a better reference. > there is a DIRECT COROLLERY of non-computable R Yes, though as I say, that follows from a much simpler theorem than the ones in Turing's paper. > Avoiding the topic is not a valid argument either. Curious. How is agreeing with you avoiding the topic? All you have said is there is are some facts about TMs and R that you find odd. I've agreed on those facts. I can't address the fact that you find these facts odd or baffling because you don't say why you do. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | grahamcooper7@gmail.com |
|---|---|
| Date | 2018-01-26 18:04 -0800 |
| Message-ID | <babc36f8-58d4-47fc-a37e-165e2dd483f0@googlegroups.com> |
| In reply to | #171073 |
On Friday, January 26, 2018 at 4:59:17 PM UTC+11, peteolcott wrote: > On Thursday, January 25, 2018 at 11:38:40 PM UTC-6, George Greene wrote: > > On Friday, January 26, 2018 at 12:29:23 AM UTC-5, peteolcott wrote: > > > I know what a TM is. > > > > No, dumbass, YOU REALLY don't. You don't even know whether it is software > > or hardware. > > > > You are the stupid one here George, everyone knows that a TM (as > originally envisioned by Alan Turing) was a man with a paper and > pencil. and 1000s and 1000s of VALVES! Turing helped break the GRMAN ENIGMA CODE WW-II
[toc] | [prev] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2018-01-25 21:48 -0800 |
| Message-ID | <7035341d-3e27-4723-9372-c8fbe3ead758@googlegroups.com> |
| In reply to | #171068 |
On Friday, January 26, 2018 at 12:29:23 AM UTC-5, peteolcott wrote: > Those less formal presentations lose key details. You are LYING. Those presentations are NOT less FORMAL! They ARE less detailed but that is because the formalism MATTERS and the deatils DON'T! > A TM does not actually ever return anything. > TM's not do function calls either. Damn, you're stupid. YOU WATCHED LINZ *SAY* that at some point, H^ continues by "behaving exactly as H' would" on its input. *THAT*CONSTITUTES* performing the relevant function call. IF YOU BELIEVE that H^ does in fact behave in that way THEN YOU ALREADY BELIEVE that H^ calls H'. The notion that running a TM is calling a function that returns something IS A CONVENTION. One certainly does not NEED to think of these things that way. But IN THE CONTEXT OF THE HALTING PROBLEM, one IS ALREADY COOMMITTED to thinking of things that way! The question IS ABOUT the existence of a TM THAT ALWAYS HALTS, and that can halt IN TWO DIFFERENT WAYS -- in one way if its M,I input-pair has M halting on I, and in the other way if M doesn't halt on I. *THIS* particular TM *IS*ALREADY*DEFINED* as being a boolean function that you can call! Except that it turns out that it doesn't exist, so maybe it isn't defined as anything. Put another way, this definition is A SPEC or a requirement-set for a TM and it turns out that the set of TMs that satisfies this set of requirements IS EMPTY. If we are using the functional convention then the finite string (up to some first "blank" or other special character) that is on the tape when the machine starts is the input-string for the TM and is the argument for the function that is being called when (whenEVER) the TM is invoked, and if the TM halts, then the value that the function returns for the argument is whatever string (output-string) is on the tape when the TM halts. If the TM doesn't halt then the function it represents is undefined for that input. THAT IS THE CONVENTION. ONE CAN choose to talk about TMs like that. Your claim that TMs "can't actually do that" IS JUST BULLSHIT -- THERE IS A SECTION OF LINZ, OF THE BOOK YOU QUOTED, very NEAR the explanation of the halting problem that you quoted, THAT EXPLAINS IN DETAIL how TMs CAN do all these OTHER (slightly) MORE COMPLICATED things -- that explains WHY IT IS LEGITIMATE to do these things that YOU WRONGLY think are somehow "dangerous" or might be skipping important details (they're not). > If you have the credentials that you claim then you should > be able to understand and agree that I summed up the essence > of Linz up to and including the YELLOW highlighted portion. You did NOT sum up ANYthing important. The Linz treatment itself IS EMBARRASSINGLY confusing and if you summed it up accurately then you took a high-resolution photo OF AN EYESORE. NOBODY GIVES A SHIT HOW WELL you may or may not have summarized Linz here because HE DIDN'T EXPLAIN IT WELL! > The following Link also has a link to the Linz pages: (318-320). > > http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/ > > 100% complete and total understanding of the above Linz summary > portion of the link is a mandatory prerequisite to any further elaboration. Then you have certainly disqualified yourself. I repeat, all the people arguing with you here UNDERSTND LINZ BETTER THAN YOU DO. YOU are THE ONLY person actively participating in this discussion WHO DOES *NOT* understand what is going on.
[toc] | [prev] | [next] | [standalone]
| From | grahamcooper7@gmail.com |
|---|---|
| Date | 2018-01-24 20:44 -0800 |
| Message-ID | <658f8503-31fb-43a0-afc1-fe4851fb6b66@googlegroups.com> |
| In reply to | #170936 |
On Thursday, peteolcott wrote:
> The second-order sentence ∀P∀x(x ∈ P ∨ x ∉ P) says that for every unary relation (or set) P of individuals, and every individual x, either x is in P or it is not (this is the principle of bivalence).
>
> Everything either is or is not a member of some specific set.
Yes but tuples (predicate parameters / functions) arent individuals.
X = term
OR
X = predicate
What AXIOMS reduce { X | {a,b}eX & f(a,b) } C { Y | {x,y}eY & g(x,y) }
{X | f(X)} C {Y |g(Y)}
works on INDIVIDUALS
but ORDERED_PAIR C ORDERED_PAIR
is more complex Set Theory doing Quantified Logic
[toc] | [prev] | [next] | [standalone]
| From | Pete Olcott <Pete@NoEmail.address> |
|---|---|
| Date | 2018-01-20 10:14 -0600 |
| Message-ID | <zOudneZ2VOR89_7HnZ2dnUU7-SPNnZ2d@giganews.com> |
| In reply to | #170625 |
On 1/20/2018 9:18 AM, bursejan@gmail.com wrote: > Well take an UT (universal turing machine), with two > tapes input, one tape is the code of another turing > machine x, and the other tape is the input y to the > > other turing machine, so we might have and easily show > > R_UT*(<x,y>,<z,_>) <=> R_x*(y,z) > > by a simple induction. And then by a diagonal argument > for R_UT* we can very quickly show that it will > not always halt: > > ~forall t H_UT(t) http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/ The error of the HP proof is that the evaluation by H of the TM description of H specifies an infinite evaluation sequence that never resolves to True of False. Saying that computation is limited by the HP proof is analogous to saying that humans have a fundamental limitation in their process of reasoning because they cannot correctly answer this question: What is the correct answer to this question? (referring to itself) In the same way that the above question is erroneous, the liar paradox and the halting problem proof are erroneous: Pathological self-reference. Copyright 2004, 2016, 2017, 2018 Pete Olcott
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2018-01-20 17:09 +0000 |
| Message-ID | <87zi58xxrh.fsf@bsb.me.uk> |
| In reply to | #170630 |
Pete Olcott <Pete@NoEmail.address> writes: > On 1/20/2018 9:18 AM, bursejan@gmail.com wrote: >> Well take an UT (universal turing machine), with two >> tapes input, one tape is the code of another turing >> machine x, and the other tape is the input y to the >> >> other turing machine, so we might have and easily show >> >> R_UT*(<x,y>,<z,_>) <=> R_x*(y,z) >> >> by a simple induction. And then by a diagonal argument >> for R_UT* we can very quickly show that it will >> not always halt: >> >> ~forall t H_UT(t) > The error of the HP proof is that the evaluation by H of the TM > description of H specifies an infinite evaluation sequence that never > resolves to True of False. What is H? Nothing in the material you quote has a machine called H. Have you got to the stage where you just post random things you'd like to be true? Presumably you have nothing to counter that argument you quoted. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2018-01-24 13:11 -0800 |
| Message-ID | <a91a9dd5-6e50-440f-95d2-a2307eaec017@googlegroups.com> |
| In reply to | #170637 |
On Saturday, January 20, 2018 at 12:44:48 PM UTC-5, Pete Olcott wrote: > Well take an UT (universal turing machine), with two > tapes input, one tape is the code of another turing > machine x, and the other tape is the input y to the > > other turing machine, so we might have and easily show > > R_UT*(<x,y>,<z,_>) <=> R_x*(y,z) > > by a simple induction. And then by a diagonal argument > for R_UT* we can very quickly show that it will > not always halt: > > ~forall t H_UT(t) You are not educating anybody by telling us that the universal tm doesn't always halt. DUH. Every time it emulates a non-halting computation, it fails to halt. If M doesn't halt on I then U(M,I) obviously DOES NOT HALT. That happens HALF THE TIME and it goes WITHOUT saying. SO WHAT are you saying?? Your doing this with 2 tapes is stupid, too. That's ALLOWED but it's ONLY allowed BECAUSE it's provably equivalent to doing it with ONE tape. TMs with one tape are already maximally powerful. Adding more tapes DOESN'T DO anything. The kinds of things that DO do (more) things (that actually increase the machine's power) are things that are practically/physically NOT doABLE, like oracles and non-determinism. The Linz book you have been citing HAS a next section on extra things&capabilities that don't actually make a difference,i.e., that can already be emulated by the vanilla TM architecture. They DO make a difference in convenience OF WRITING stuff about these programs, though -- a difference you have seemed not to understand throughout the discussion.
[toc] | [prev] | [next] | [standalone]
| From | "Renee Keller" <rkeller@aol.com> |
|---|---|
| Date | 2018-01-24 10:25 -0500 |
| Message-ID | <p4a8i3$gph$1@gioia.aioe.org> |
| In reply to | #170630 |
> Saying that computation is limited by the HP proof is analogous to saying > that > humans have a fundamental limitation in their process of reasoning because > they > cannot correctly answer this question: > > What is the correct answer to this question? (referring to itself) > The correct answer is 42.
[toc] | [prev] | [next] | [standalone]
| From | Pete Olcott <Pete@NoEmail.address> |
|---|---|
| Date | 2018-01-20 09:19 -0600 |
| Message-ID | <KKSdnfZ4TeqGw_7HnZ2dnUU7-KXNnZ2d@giganews.com> |
| In reply to | #170305 |
On 1/16/2018 3:02 PM, Newberry wrote: > This result is the same as the solution of the Liar Paradox > “This sentence is not true” is not true > The sentence in double quotes is ~T & ~F, in fact it is meaningless. The outer sentence is true. http://liarparadox.org/index.php/2017/12/08/concise-formalization-of-the-liar-paradox/ I find it quite annoying how everyone uses the term meaningless incorrectly: This is much closer to meaningless: "sfgkp wreio xkswero iojpsewretio" The Liar Paradox is not meaningless it simply never resolves to True or False. https://en.wikipedia.org/wiki/Colorless_green_ideas_sleep_furiously Meaningless (bereft of all meaning) and nonsensical (lacks coherent unified meaning) are two entirely different things. If you spend thousands of hours on these things the significance of these subtleties is understood. -- *Γ ⊢_FS A ≡ ∃Γ ⊆ FS Provable(Γ, A)* // MTT notational conventions *∀X True(X) ≡ ∃Γ ⊆ MTT ∧ Axioms(Γ) Provable(Γ, X) * // MTT Truth Predicate
[toc] | [prev] | [next] | [standalone]
Page 15 of 16 — ← Prev page 1 … 13 14 [15] 16 Next page →
Back to top | Article view | sci.logic
csiph-web