Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > sci.logic > #170305 > unrolled thread

The Semantics of Halting

Started byNewberry <newberryxy@gmail.com>
First post2018-01-16 13:02 -0800
Last post2018-02-14 00:44 -0600
Articles 20 on this page of 310 — 14 participants

Back to article view | Back to sci.logic


Contents

  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 10 of 16 — ← Prev page 1 … 8 9 [10] 11 12 … 16  Next page →


#171573

Fromgrahamcooper7@gmail.com
Date2018-01-31 22:28 -0800
Message-ID<c61674a7-68e6-4e6e-a9c0-72545550370c@googlegroups.com>
In reply to#171570
On Thursday, February 1, 2018 at 3:13:22 PM UTC+10, Pete Olcott wrote:
>
> 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 


w^2 is a NUMBER on the LINK


----input w----(q0)-----w w------>(qx)





Now (qx) is the [START] of HALT

(with w w on the TAPE)


[toc] | [prev] | [next] | [standalone]


#171584

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-01 11:25 +0000
Message-ID<878tcd9cjs.fsf@bsb.me.uk>
In reply to#171570
Pete Olcott <Pete@NoEmail.address> writes:
<snip>
> The HP proof counter-examples

There are no counter-examples involved.

> 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

You don't know what this notation means as you have again shown because
you appear to think that dropping the middle part has made a difference.
Both pairs of lines unequivocally say that H^ *always* transitions to
either qy or qn in a finite number of steps.

I thought your labelling these lines a definition was just another
sloppy use of language, but it's clear you really think that that is
what this definition achieves.  I must revise my expectation about what
you are capable of misunderstanding.

> The counter-example does not show that a halting decider cannot exist.

There is no counter-example here.  Look up what a counter example is in
some elementary textbook on mathematics.

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#171602

Fromgrahamcooper7@gmail.com
Date2018-02-01 08:33 -0800
Message-ID<09acc0d0-bf4a-4891-ac67-4115a26b9908@googlegroups.com>
In reply to#171584
On Thursday, February 1, 2018 at 9:26:00 PM UTC+10, Ben Bacarisse wrote:
> Pete Olcott <Pete@NoEmail.address> writes:
> <snip>
> > The HP proof counter-examples
> 
> There are no counter-examples involved.


Now we know who the Culprit is spouting idiocy to draw out discussions just for the sake of it



[toc] | [prev] | [next] | [standalone]


#171613

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-01 17:45 +0000
Message-ID<87bmh87ge7.fsf@bsb.me.uk>
In reply to#171602
grahamcooper7@gmail.com writes:

> On Thursday, February 1, 2018 at 9:26:00 PM UTC+10, Ben Bacarisse wrote:
>> Pete Olcott <Pete@NoEmail.address> writes:
>> <snip>
>> > The HP proof counter-examples
>> 
>> There are no counter-examples involved.
>
> Now we know who the Culprit is spouting idiocy to draw out discussions
> just for the sake of it

A counter-example is a case or instance that actually exists.  A
counter-example is echibited to show that some universal claim is false.
The proof of the halting theorem that is giving Peter Olcott so much
trouble is a proof by contradiction.  There are no halting deciders so
there can be no H, no H' not H^ and no invocation of H^ on [H^].

The proof by contradiction assumes a counter-example -- that there is a
halting decider -- but that is not the counter-example that PO is
talking about.  Even so, the end result is to show that there is no
counter-example to the claim that every Turing machine is not a halt
decider.

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#171605

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-01 10:43 -0600
Message-ID<xaidnbLXKLs43u7HnZ2dnUU7-KGdnZ2d@giganews.com>
In reply to#171584
On 2/1/2018 5:25 AM, Ben Bacarisse wrote:
> Pete Olcott <Pete@NoEmail.address> writes:
> <snip>
>> The HP proof counter-examples
> 
> There are no counter-examples involved.
> 
>> 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
> 
> You don't know what this notation means as you have again shown because
> you appear to think that dropping the middle part has made a difference.

You are hardly paying any attention at all not even noticing that I did not
drop the middle part.

You are acting like a USENET Troll only glancing at a couple of words
before forming your rebuttal. I know that you can do better than that.

More significantly the part that I did drop made Ĥ ŵ ŵ2 decidable:

- 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]


#171641

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-01 22:28 +0000
Message-ID<87efm45oqm.fsf@bsb.me.uk>
In reply to#171605
Pete Olcott <Pete@NoEmail.address> writes:

> On 2/1/2018 5:25 AM, Ben Bacarisse wrote:
>> Pete Olcott <Pete@NoEmail.address> writes:
>> <snip>
>>> The HP proof counter-examples
>>
>> There are no counter-examples involved.
>>
>>> 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

This states that there is no looping of the sort you describe.  It says
that H^ always transitions from state qx to wither state qy or qn in a
finite number of steps.

That this notation means what I say will remain true no matter how many
times you say something else in words.  You can, by simply referring to
the book is comes from, learn what these lines you keep writing mean.

>>> Eliminating the infinite recursion from Ĥ we have:
>>> q0 ŵ ŵ2 ⊢* Ĥ qy ∞
>>> q0 ŵ ŵ2 ⊢* Ĥ qn
>>
>> You don't know what this notation means as you have again shown because
>> you appear to think that dropping the middle part has made a difference.
>
> You are hardly paying any attention at all not even noticing that I did not
> drop the middle part.

You are correct -- I was too generous and thought you had written
something that makes sense.  The second pair are total nonsense because,
as you yourself have pointed out, H^ is never in state q0 with that tape
configuration.

I had no idea you were so confused by the notation.

> You are acting like a USENET Troll only glancing at a couple of words
> before forming your rebuttal. I know that you can do better than that.

I will read more carefully to make sure I pick up on all the nonsense.

> More significantly the part that I did drop made Ĥ ŵ ŵ2 decidable:
>
> - Eliminating the infinite recursion from Ĥ we have:
> - q0 ŵ ŵ2 ⊢* Ĥ qy ∞
> - q0 ŵ ŵ2 ⊢* Ĥ qn

No, H^ is never in this configuration.  (It could start in that
configuration by presenting H^ with w^ w^2 as its input, but that's not
what the proof does, so you would be talking about some other
computation altogether and nothing you said about it would apply to the
proof you are discussing).

> - ŵ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.

You've asked me to be more careful so I shall point out errors that I've
just let slide by before.

(a) It's silly to write w2^ as it is the same string as w^.
(a) w2^ can not transition.  It is a string of symbols.
(b) Ditto w^.
(c) For the same reason, "halting for w^ w2^" is meaningless.

You did want me to take care with the details of what you write, yes?

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#171600

FromNewberry <newberryxy@gmail.com>
Date2018-02-01 08:05 -0800
Message-ID<p4vdt5$bjj$1@dont-email.me>
In reply to#171570
Pete Olcott wrote:
> On 1/31/2018 11:53 AM, Newberry wrote:
>> Pete Olcott wrote:
>>> On 1/31/2018 12:12 AM, Newberry wrote:
>>>> 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".
>>>>>
>>>>> 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?
>>>>>
>>>>> Its evaluation sequence gets stuck in infinite recursion,
>>>>
>>>> Right! So it cannot give you an answer in this particular case.
>>>
>>> In the same sort of way that the question: What time is it (yes or no)?
>>> cannot be correctly answered because the question itself is incorrect.
>>>
>>> "This sentence is not true" is a semantically ill-formed proposition.
>>
>> You yourself have said that the "counter-example" will endlessly
>> oscillate between two states.
>
> I never said that. I said that was a common misunderstanding.
> 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

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.

> 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
>
>
>
>
>
>> In your opinion does it halt?
>>
>> The Halting Theorem says that there is no universal decider. Let us
>> say that you somehow refuted the counter-example argument. So do you
>> claim that a universal decider does exist, or what?
>>
>
> The counter-example does not show that a halting decider cannot exist.

Again, you said yourself that the decider gets stuck in an infinite 
recursion, does not reach either yes or no. It means it will not decide. 
Therefore it is not a universal decider. I think it could not be simpler 
and clearer. What am I missing?

[toc] | [prev] | [next] | [standalone]


#171651

Fromgrahamcooper7@gmail.com
Date2018-02-01 15:21 -0800
Message-ID<3ea40592-4a87-453c-9486-badc1b548058@googlegroups.com>
In reply to#171600
[PO]

 
     Removing
           the infinite recursion that is encoded directly into Ĥ 
     
 
     makes
         Ĥ
             ŵ ŵ2 decidable
 



nice try!


START WITH H
CHANGE IT TO H'
CHANGE IT TO H^
CHANGE IT TO H^

ALL FIXED!

     

[toc] | [prev] | [next] | [standalone]


#171669

FromNewberry <newberryxy@gmail.com>
Date2018-02-01 17:08 -0800
Message-ID<876bba74-a1f2-4639-94e7-94d2e08b1456@googlegroups.com>
In reply to#171600
On Thursday, February 1, 2018 at 1:07:06 PM UTC-8, Pete Olcott wrote:
> On 2/1/2018 10:05 AM, Newberry wrote:
> 
>     
>     Pete
>       Olcott wrote:
>       
> 
>       On 1/31/2018 11:53 AM, Newberry wrote:
>         
> 
>         Pete Olcott wrote:
>           
> 
>           On 1/31/2018 12:12 AM, Newberry wrote:
>             
> 
>             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".
>                 
> 
>                 
> 
>                 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?
>                 
> 
>                 
> 
>                 Its evaluation sequence gets stuck in infinite
>                 recursion,
>                 
> 
>               
>               
> 
>               Right! So it cannot give you an answer in this particular
>               case.
>               
> 
>             
>             
> 
>             In the same sort of way that the question: What time is it
>             (yes or no)?
>             
> 
>             cannot be correctly answered because the question itself is
>             incorrect.
>             
> 
>             
> 
>             "This sentence is not true" is a semantically ill-formed
>             proposition.
>             
> 
>           
>           
> 
>           You yourself have said that the "counter-example" will
>           endlessly
>           
> 
>           oscillate between two states.
>           
> 
>         
>         
> 
>         I never said that. I said that was a common misunderstanding.
>         
> 
> 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
>         
> 
>       
>       
> 
>       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.
>       
> 
>       
> 
>       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
>         
> 
>         
> 
>         
> 
>         
> 
>         
> 
>         
> 
>         In your opinion does it halt?
>           
> 
>           
> 
>           The Halting Theorem says that there is no universal decider.
>           Let us
>           
> 
>           say that you somehow refuted the counter-example argument. So
>           do you
>           
> 
>           claim that a universal decider does exist, or what?
>           
> 
>           
> 
>         
>         
> 
>         The counter-example does not show that a halting decider cannot
>         exist.
>         
> 
>       
>       
> 
>       Again, you said yourself that the decider gets stuck in an
>       infinite recursion, does not reach either yes or no. It means it
>       will not decide. Therefore it is not a universal decider. I think
>       it could not be simpler and clearer. What am I missing?
>       
> 
>       
> 
>     
>     
> 
>       If you specifically encode an infinite loop into a TM it is going
>       to have an infinite loop. 

The proof exhibits a scenario the postulated decider cannot decide. Linz probably did not even bother to consider the infinite recursion case. The proof postulates a total decider, and derives a contradiction. If the decider loops in some cases then it is obviously not a total decider to begin with, and there is nothing further to prove. Your idea that the infinite recursion invalidates the proof is wrong. Your logic does not make sense.

> 
>     You have to go back and read what I
>       said again more carefully or I will think that you
> 
>     are intentionally being
>         disingenuous as Trollish behavior. 
> 
>     
> 
>     Removing
>           the infinite recursion that is encoded directly into Ĥ 
>     
> 
>     makes
>         Ĥ
>             ŵ ŵ2 decidable
 
Let us focus on the case before the removal for now.     
 
>     >> 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]


#171698

Fromgrahamcooper7@gmail.com
Date2018-02-01 22:33 -0800
Message-ID<f4c39fa2-2cef-456d-bb77-b71808711954@googlegroups.com>
In reply to#171669
On Friday, February 2, 2018 at 4:02:55 PM UTC+10, Pete Olcott wrote:
> On 2/1/2018 7:08 PM, Newberry wrote:
> 
>     
>     
>       On Thursday, February 1, 2018 at 1:07:06 PM UTC-8, Pete Olcott wrote:
> 
>       
>         On 2/1/2018 10:05 AM, Newberry wrote:
> 
>     
>     Pete
>       Olcott wrote:
>       
> 
>       On 1/31/2018 11:53 AM, Newberry wrote:
>         
> 
>         Pete Olcott wrote:
>           
> 
>           On 1/31/2018 12:12 AM, Newberry wrote:
>             
> 
>             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".
>                 
> 
>                 
> 
>                 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?
>                 
> 
>                 
> 
>                 Its evaluation sequence gets stuck in infinite
>                 recursion,
>                 
> 
>               
>               
> 
>               Right! So it cannot give you an answer in this particular
>               case.
>               
> 
>             
>             
> 
>             In the same sort of way that the question: What time is it
>             (yes or no)?
>             
> 
>             cannot be correctly answered because the question itself is
>             incorrect.
>             
> 
>             
> 
>             "This sentence is not true" is a semantically ill-formed
>             proposition.
>             
> 
>           
>           
> 
>           You yourself have said that the "counter-example" will
>           endlessly
>           
> 
>           oscillate between two states.
>           
> 
>         
>         
> 
>         I never said that. I said that was a common misunderstanding.
>         
> 
> 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
>         
> 
>       
>       
> 
>       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.
>       
> 
>       
> 
>       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
>         
> 
>         
> 
>         
> 
>         
> 
>         
> 
>         
> 
>         In your opinion does it halt?
>           
> 
>           
> 
>           The Halting Theorem says that there is no universal decider.
>           Let us
>           
> 
>           say that you somehow refuted the counter-example argument. So
>           do you
>           
> 
>           claim that a universal decider does exist, or what?
>           
> 
>           
> 
>         
>         
> 
>         The counter-example does not show that a halting decider cannot
>         exist.
>         
> 
>       
>       
> 
>       Again, you said yourself that the decider gets stuck in an
>       infinite recursion, does not reach either yes or no. It means it
>       will not decide. Therefore it is not a universal decider. I think
>       it could not be simpler and clearer. What am I missing?
>       
> 
>       
> 
>     
>     
> 
>       If you specifically encode an infinite loop into a TM it is going
>       to have an infinite loop. 
> 
>       
>       The proof exhibits a scenario the postulated decider cannot decide. Linz probably did not even bother to consider the infinite recursion case. The proof postulates a total decider, and derives a contradiction. If the decider loops in some cases then it is obviously not a total decider to begin with, and there is nothing further to prove. Your idea that the infinite recursion invalidates the proof is wrong. Your logic does not make sense.
> 
>     
>     
> 
> http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/
> 
>     
> 
>     Linz did not notice that his example and every other HP proof
>     counter-example
> 
>     all encode infinite recursion into the definition of their problem
>     specification. 
> 
>     If you define a TM to have infinite recursion it will have infinite
>     recursion. 
> 
>     
> 
>         Please
>         think this through (very carefully) before spouting off that I
>         am
>         wrong
>     
> 
>     Since the actual question is whether or not a TM can decide halting
>     for any
> 
>     possible TM / Input pair, not whether or not an otherwise correct
>     halt decider 
> 
>     can be broken by changing it we must actually assume that H (not Ĥ)
>     is the 
> 
>     potential halt decider and Ĥ Ĥ is its input (because H requires two
>     inputs). 
> 
>     
> 
>     Would H transition to ((qy)) or ((qn)) on input Ĥ Ĥ ? 
> 
>     This question can only be answered on the basis of
> 
>     Would Ĥ transition to (qy) or ((qn)) on input Ĥ? 
> 
>     
> 
>     Definition of Turing Machine Ĥ (state transition sequence)
> 
>     q0 ŵ ⊢* Ĥ qx ŵ ŵ ⊢* Ĥ qy ∞ 
> 
>         q0 ŵ ⊢* Ĥ qx ŵ ŵ ⊢* Ĥ qn
> 
>     
> 
>     H would not have to guess about whether or not Ĥ gets stuck in
>     infinite 
> 
>     recursion because H would see all of the unspecified state
>     transition sequences. 
> 
>     
> 
>     If Ĥ would gets stuck in infinite recursion, then H simply
>     transitions to ((qn)) correctly deciding not halting. 
> 
>     If Ĥ would transition to ((qy)) then H simply transitions to ((qn))
>     correctly deciding not halting. 
> 
>     If Ĥ would transition to ((qn)) then H simply transitions to ((qy))
>     correctly deciding halting.



Nope!


INSIDE the TM H^ sits the original bona-fide HALT!


The only change is BEFORE and AFTER HALT!

[toc] | [prev] | [next] | [standalone]


#171718

FromNewberry <newberryxy@gmail.com>
Date2018-02-02 09:38 -0800
Message-ID<d76a0e66-d4e1-492e-8145-f747965c16bb@googlegroups.com>
In reply to#171669
On Friday, February 2, 2018 at 8:12:59 AM UTC-8, Pete Olcott wrote:
> On 2/2/2018 12:02 AM, Pete Olcott
>       wrote:
> 
>     
>     
>       
>       
> On 2/1/2018 7:08 PM, Newberry wrote:
> 
>       
>       
> 
>         
>                 If you specifically encode an infinite loop into a TM it is going
>       to have an infinite loop. 
> 
>         
>         The proof exhibits a scenario the postulated decider cannot decide. Linz probably did not even bother to consider the infinite recursion case. The proof postulates a total decider, and derives a contradiction. If the decider loops in some cases then it is obviously not a total decider to begin with, and there is nothing further to prove. Your idea that the infinite recursion invalidates the proof is wrong. Your logic does not make sense.
> 
>       
>       
> 
>       http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/
> 
>       
> 
>       Linz did not notice that his example and every other HP proof
>       counter-example

Even if it were true - and you have to understand this - it does not invalidate the proof. Linz considered the worst case scenario when H does halt.
 
>       all encode infinite recursion into the definition of their problem
>       specification. 
> 
>       If you define a TM to have infinite recursion it will have
>       infinite recursion. 

If H is to be consistent then it must be defined this way.
 
>           Please think this through (very carefully) before spouting off
>           that I am wrong 
> 
>       Since the actual question is whether or not a TM can decide
>       halting for any
> 
>       possible TM / Input pair, not whether or not an otherwise correct
>       halt decider 
> 
>       can be broken by changing it we must actually assume that H (not
>       Ĥ) is the 
> 
>       potential halt decider and Ĥ Ĥ is its input (because H requires
>       two inputs). 
> 
>       
> 
>       Would H transition to ((qy)) or ((qn)) on input Ĥ Ĥ ? 
> 
>       This question can only be answered on the basis of
> 
>       Would Ĥ transition to (qy) or ((qn)) on input Ĥ? 
> 
>       
> 
>       Definition of Turing Machine Ĥ (state transition sequence)
> 
>       q0 ŵ ⊢* Ĥ qx ŵ ŵ ⊢* Ĥ qy ∞ 
> 
>           q0 ŵ ⊢* Ĥ qx ŵ ŵ ⊢* Ĥ qn
> 
>       
> 
>       H would not have to guess about whether or not Ĥ gets stuck in
>       infinite 
> 
>       recursion because H would see all of the unspecified state
>       transition sequences. 
>
>       
> 
>       If Ĥ would gets stuck in infinite recursion, then H simply
>       transitions to ((qn)) correctly deciding not halting.

If H got stuck in an infinite loop then Ĥ would do likewise. 
 
> 
>       If Ĥ would transition to ((qy)) then H simply transitions to
>       ((qn)) correctly deciding not halting. 

If H did this then Ĥ would halt. 
 
>       If Ĥ would transition to ((qn)) then H simply transitions to
>       ((qy)) correctly deciding halting. 
 
If H did this then Ĥ would go to infinite loop.       
 
This is how Ĥ is defined. You can substitute your own Ĥ', but that does not invalidate the proof because the proof uses Ĥ.
          
> I has to trim the content because this page would not print
>       correctly. 
> 
>     
>     
> -- 
> 
>       
>       
>             ∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X)

[toc] | [prev] | [next] | [standalone]


#171809

Frompeteolcott <peterolcott2@gmail.com>
Date2018-02-03 14:41 -0800
Message-ID<e4cdab2a-442b-49d8-ac62-bf9e80b5bcba@googlegroups.com>
In reply to#171718
On Friday, February 2, 2018 at 11:38:23 AM UTC-6, Newberry wrote:
> On Friday, February 2, 2018 at 8:12:59 AM UTC-8, Pete Olcott wrote:
> > On 2/2/2018 12:02 AM, Pete Olcott
> >       wrote:
> > 
> >     
> >     
> >       
> >       
> > On 2/1/2018 7:08 PM, Newberry wrote:
> > 
> >       
> >       
> > 
> >         
> >                 If you specifically encode an infinite loop into a TM it is going
> >       to have an infinite loop. 
> > 
> >         
> >         The proof exhibits a scenario the postulated decider cannot decide. Linz probably did not even bother to consider the infinite recursion case. The proof postulates a total decider, and derives a contradiction. If the decider loops in some cases then it is obviously not a total decider to begin with, and there is nothing further to prove. Your idea that the infinite recursion invalidates the proof is wrong. Your logic does not make sense.
> > 
> >       
> >       
> > 
> >       http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/
> > 
> >       
> > 
> >       Linz did not notice that his example and every other HP proof
> >       counter-example
> 
> Even if it were true - and you have to understand this - it does not invalidate the proof. Linz considered the worst case scenario when H does halt.

Recently updated. 
http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/

I realized that to refute the Linz version we must evaluate 
the effect of what the original Figure 12.1 H would do on
clarified, simplified and corrected Figure 12.3 of Ĥ. 



>  
> >       all encode infinite recursion into the definition of their problem
> >       specification. 
> > 
> >       If you define a TM to have infinite recursion it will have
> >       infinite recursion. 
> 
> If H is to be consistent then it must be defined this way.
>  
> >           Please think this through (very carefully) before spouting off
> >           that I am wrong 
> > 
> >       Since the actual question is whether or not a TM can decide
> >       halting for any
> > 
> >       possible TM / Input pair, not whether or not an otherwise correct
> >       halt decider 
> > 
> >       can be broken by changing it we must actually assume that H (not
> >       Ĥ) is the 
> > 
> >       potential halt decider and Ĥ Ĥ is its input (because H requires
> >       two inputs). 
> > 
> >       
> > 
> >       Would H transition to ((qy)) or ((qn)) on input Ĥ Ĥ ? 
> > 
> >       This question can only be answered on the basis of
> > 
> >       Would Ĥ transition to (qy) or ((qn)) on input Ĥ? 
> > 
> >       
> > 
> >       Definition of Turing Machine Ĥ (state transition sequence)
> > 
> >       q0 ŵ ⊢* Ĥ qx ŵ ŵ ⊢* Ĥ qy ∞ 
> > 
> >           q0 ŵ ⊢* Ĥ qx ŵ ŵ ⊢* Ĥ qn
> > 
> >       
> > 
> >       H would not have to guess about whether or not Ĥ gets stuck in
> >       infinite 
> > 
> >       recursion because H would see all of the unspecified state
> >       transition sequences. 
> >
> >       
> > 
> >       If Ĥ would gets stuck in infinite recursion, then H simply
> >       transitions to ((qn)) correctly deciding not halting.
> 
> If H got stuck in an infinite loop then Ĥ would do likewise. 

The case is actually that [Ĥ] gets stuck in infinite recursion 
and H does not because Ĥ is encoded differently than H. 

>  
> > 
> >       If Ĥ would transition to ((qy)) then H simply transitions to
> >       ((qn)) correctly deciding not halting. 
> 
> If H did this then Ĥ would halt. 

If Figure 12.1 H is applied to Figure 12.2 H' then

H [H'] [H'] would be analyzed. renaming for clarity: H [H'] [H'2]

H'2 --> ((qn)) based on NULL input
H'  --> (qy) ∞ based on above ((qn))
H   --> ((qn)) based on above (qy) ∞

The difference in the behavior of H and H' is that H has 
two inputs and H' only has one. The way that H' is defined
it always toggles the result of the last H' that was executed. 


>  
> >       If Ĥ would transition to ((qn)) then H simply transitions to
> >       ((qy)) correctly deciding halting. 
>  
> If H did this then Ĥ would go to infinite loop.       

If Ĥ transitions to its final state ((qn)) then Ĥ does not go into an 
infinite loop. The behavior of the outermost element of the inference 
chain H is determined by the behavior of the innermost element Ĥ(n). 

>  
> This is how Ĥ is defined. You can substitute your own Ĥ', but that does not invalidate the proof because the proof uses Ĥ.

Yes I realized this so I am now evaluating 
H [Ĥ] [Ĥ] from Figures 12.1 and 12.3 

>           
> > I has to trim the content because this page would not print
> >       correctly. 
> > 
> >     
> >     
> > -- 
> > 
> >       
> >       
> >             ∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X)

[toc] | [prev] | [next] | [standalone]


#171816

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-04 00:08 +0000
Message-ID<878tc9zkei.fsf@bsb.me.uk>
In reply to#171809
peteolcott <peterolcott2@gmail.com> writes:
<snip>
> Recently updated. 
> http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/

Ah.  I thought so.  Do you still have the old one available?  It would
be good to be able to see what you though was wrong about it.

<snip>
> The case is actually that [Ĥ] gets stuck in infinite recursion 
> and H does not because Ĥ is encoded differently than H.

[H^] is a string.  It can not get stuck.  If you mean it gets stuck
because some other machine is running it like a UTM would do, then you
are making an unwarranted assumption.

<snip>
> If Figure 12.1 H is applied to Figure 12.2 H' then
>
> H [H'] [H'] would be analyzed. renaming for clarity: H [H'] [H'2]
>
> H'2 --> ((qn)) based on NULL input
> H'  --> (qy) ∞ based on above ((qn))
> H   --> ((qn)) based on above (qy) ∞
>
> The difference in the behavior of H and H' is that H has 
> two inputs and H' only has one.

TMs have only one input.  Always.  And there are more category errors.
That list uses the same notation (one that suggest state transitions)
but one of the three lines refers to a string, not a machine.

<snip>
-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#171817

Frompeteolcott <peterolcott2@gmail.com>
Date2018-02-03 16:31 -0800
Message-ID<6b0e04de-5f6f-430c-aaf2-39b5c16e09ad@googlegroups.com>
In reply to#171816
On Saturday, February 3, 2018 at 6:08:24 PM UTC-6, Ben Bacarisse wrote:
> peteolcott <peterolcott> writes:
> <snip>
> > Recently updated. 
> > http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/
> 
> Ah.  I thought so.  Do you still have the old one available?  It would
> be good to be able to see what you though was wrong about it.
> 
> <snip>
> > The case is actually that [Ĥ] gets stuck in infinite recursion 
> > and H does not because Ĥ is encoded differently than H.
> 
> [H^] is a string.  It can not get stuck.  If you mean it gets stuck
> because some other machine is running it like a UTM would do, then you
> are making an unwarranted assumption.
> 
> <snip>
> > If Figure 12.1 H is applied to Figure 12.2 H' then
> >
> > H [H'] [H'] would be analyzed. renaming for clarity: H [H'] [H'2]
> >
> > H'2 --> ((qn)) based on NULL input
> > H'  --> (qy) ∞ based on above ((qn))
> > H   --> ((qn)) based on above (qy) ∞
> >
> > The difference in the behavior of H and H' is that H has 
> > two inputs and H' only has one.
> 
> TMs have only one input.  Always.  And there are more category errors.
> That list uses the same notation (one that suggest state transitions)
> but one of the three lines refers to a string, not a machine.
> 
> <snip>
> -- 
> Ben.

Technically TMs never have any input they only have a single tape.
Linz shows H of Figure 12.1 with two inputs. 

He slams wM and w together as wMw so it looks like one input. 
But the body text is clear that there are two inputs. 

So how are going to disagree with the unequivocal fact that even a 
hypothetical halt decider must determine the halting behavior of its 
input TMD entirely on the basis of the execution trace of this TMD? 

Maybe finite strings representing TMDs do not have the property of
an execution trace? (not even as a David Hilbert formalism?)

So the real reason that a halt decider cannot exist is there is
no such thing as a formal language of Turing Machine Descriptions
such that a higher order predicate could evaluate expressions of
this language. 

Of course if there is no such thing as a formal language of Turing 
Machine Descriptions, then the is no such thing as a Turing Machine
(not even hypothetically).

[toc] | [prev] | [next] | [standalone]


#171825

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-04 01:19 +0000
Message-ID<87wozty2jg.fsf@bsb.me.uk>
In reply to#171817
peteolcott <peterolcott2@gmail.com> writes:

> On Saturday, February 3, 2018 at 6:08:24 PM UTC-6, Ben Bacarisse wrote:
>> peteolcott <peterolcott> writes:
>> <snip>
>> > Recently updated. 
>> > http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/
>> 
>> Ah.  I thought so.  Do you still have the old one available?  It would
>> be good to be able to see what you though was wrong about it.
>> 
>> <snip>
>> > The case is actually that [Ĥ] gets stuck in infinite recursion 
>> > and H does not because Ĥ is encoded differently than H.
>> 
>> [H^] is a string.  It can not get stuck.  If you mean it gets stuck
>> because some other machine is running it like a UTM would do, then you
>> are making an unwarranted assumption.
>> 
>> <snip>
>> > If Figure 12.1 H is applied to Figure 12.2 H' then
>> >
>> > H [H'] [H'] would be analyzed. renaming for clarity: H [H'] [H'2]
>> >
>> > H'2 --> ((qn)) based on NULL input
>> > H'  --> (qy) ∞ based on above ((qn))
>> > H   --> ((qn)) based on above (qy) ∞
>> >
>> > The difference in the behavior of H and H' is that H has 
>> > two inputs and H' only has one.
>> 
>> TMs have only one input.  Always.  And there are more category errors.
>> That list uses the same notation (one that suggest state transitions)
>> but one of the three lines refers to a string, not a machine.
>> 
>> <snip>
>> -- 
>> Ben.
>
> Technically TMs never have any input they only have a single tape.

Why did you not say that then?  I thought your were striving for a very
high level of technical accuracy.  I am very happy to be lax about these
things when the meaning is not unclear.  Shall we go back to be casual
about this sort of detail?

> Linz shows H of Figure 12.1 with two inputs. 
>
> He slams wM and w together as wMw so it looks like one input. 
> But the body text is clear that there are two inputs. 
>
> So how are going to disagree with the unequivocal fact that even a 
> hypothetical halt decider must determine the halting behavior of its 
> input TMD entirely on the basis of the execution trace of this TMD?

That is not an unequivocal fact.  The meaning is vague enough for
equivocation.  If you mean that a decider must examine the trace, and
all of the trace, you are clearly wrong.  If you simply mean that a
decider must decide based on whether a TMD halts or not, then you are
clearly correct -- but the reference to the trace is then mysterious a
distraction.  Why reference the trace at all?

> Maybe finite strings representing TMDs do not have the property of
> an execution trace? (not even as a David Hilbert formalism?)

Of course they do.  If the trace is finite, the computation halts.  If
it is not finite the computation does not halt.  This is why a decider
can't use the actual trace (and only the trace) to determine halting.
It must do something else.

What if some arithmetic operation on the TDM and the encoded input
(interpreted as numbers) were enough?  What if the computation halts if
and only if the remainder of dividing one by the other is 13?  Unlikely,
you say.  But can you be sure?  Can you be sure there is no more complex
set of arithmetic operations that give the answer without examining the
trace?  This is why the proof makes not assumptions about the trace
other than what can know by the simple fact the H is decider.  Any
reference to the trace itself makes me think you are making too narrow
an argument.

> So the real reason that a halt decider cannot exist is there is
> no such thing as a formal language of Turing Machine Descriptions
> such that a higher order predicate could evaluate expressions of
> this language.
>
> Of course if there is no such thing as a formal language of Turing 
> Machine Descriptions, then the is no such thing as a Turing Machine
> (not even hypothetically).

No need to worry about that.

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#171837

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-03 22:28 -0600
Message-ID<bvOdnWp317ppFuvHnZ2dnUU7-Y3NnZ2d@giganews.com>
In reply to#171825
On 2/3/2018 7:19 PM, Ben Bacarisse wrote:
> peteolcott <peterolcott2@gmail.com> writes:
> 
>> On Saturday, February 3, 2018 at 6:08:24 PM UTC-6, Ben Bacarisse wrote:
>>> peteolcott <peterolcott> writes:
>>> <snip>
>>>> Recently updated.
>>>> http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/
>>>
>>> Ah.  I thought so.  Do you still have the old one available?  It would
>>> be good to be able to see what you though was wrong about it.
>>>
>>> <snip>
>>>> The case is actually that [Ĥ] gets stuck in infinite recursion
>>>> and H does not because Ĥ is encoded differently than H.
>>>
>>> [H^] is a string.  It can not get stuck.  If you mean it gets stuck
>>> because some other machine is running it like a UTM would do, then you
>>> are making an unwarranted assumption.
>>>
>>> <snip>
>>>> If Figure 12.1 H is applied to Figure 12.2 H' then
>>>>
>>>> H [H'] [H'] would be analyzed. renaming for clarity: H [H'] [H'2]
>>>>
>>>> H'2 --> ((qn)) based on NULL input
>>>> H'  --> (qy) ∞ based on above ((qn))
>>>> H   --> ((qn)) based on above (qy) ∞
>>>>
>>>> The difference in the behavior of H and H' is that H has
>>>> two inputs and H' only has one.
>>>
>>> TMs have only one input.  Always.  And there are more category errors.
>>> That list uses the same notation (one that suggest state transitions)
>>> but one of the three lines refers to a string, not a machine.
>>>
>>> <snip>
>>> -- 
>>> Ben.
>>
>> Technically TMs never have any input they only have a single tape.
> 
> Why did you not say that then?  I thought your were striving for a very
> high level of technical accuracy.  I am very happy to be lax about these
> things when the meaning is not unclear.  Shall we go back to be casual
> about this sort of detail?
> 

A TM can (for all practical purposes) have zero to N inputs.

>> Linz shows H of Figure 12.1 with two inputs.
>>
>> He slams wM and w together as wMw so it looks like one input.
>> But the body text is clear that there are two inputs.
>>
>> So how are going to disagree with the unequivocal fact that even a
>> hypothetical halt decider must determine the halting behavior of its
>> input TMD entirely on the basis of the execution trace of this TMD?
> 
> That is not an unequivocal fact.  The meaning is vague enough for
> equivocation.  If you mean that a decider must examine the trace, and
> all of the trace, you are clearly wrong.  If you simply mean that a
> decider must decide based on whether a TMD halts or not, then you are
> clearly correct -- but the reference to the trace is then mysterious a
> distraction.  Why reference the trace at all?
> 

Because there are details that you are ignoring. (see below)

>> Maybe finite strings representing TMDs do not have the property of
>> an execution trace? (not even as a David Hilbert formalism?)
> 
> Of course they do.  If the trace is finite, the computation halts.  If
> it is not finite the computation does not halt.  This is why a decider
> can't use the actual trace (and only the trace) to determine halting.
> It must do something else.
> 

It can and must use the actual trace in terms of exactly which state
transitions occur and the sequence that they occur up to the point that
it detects an infinite loop or infinite recursion.

[toc] | [prev] | [next] | [standalone]


#171843

Fromgrahamcooper7@gmail.com
Date2018-02-04 02:24 -0800
Message-ID<ee57bad5-b837-416e-9af0-9bf944b223d9@googlegroups.com>
In reply to#171837
On Sunday, February 4, 2018 at 2:28:43 PM UTC+10, Pete Olcott wrote:
> On 2/3/2018 7:19 PM, Ben Bacarisse wrote:
> > peteolcott <peterolcott2@gmail.com> writes:
> > 
> >> On Saturday, February 3, 2018 at 6:08:24 PM UTC-6, Ben Bacarisse wrote:
> >>> peteolcott <peterolcott> writes:
> >>> <snip>
> >>>> Recently updated.
> >>>> http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/
> >>>
> >>> Ah.  I thought so.  Do you still have the old one available?  It would
> >>> be good to be able to see what you though was wrong about it.
> >>>
> >>> <snip>
> >>>> The case is actually that [Ĥ] gets stuck in infinite recursion
> >>>> and H does not because Ĥ is encoded differently than H.
> >>>
> >>> [H^] is a string.  It can not get stuck.  If you mean it gets stuck
> >>> because some other machine is running it like a UTM would do, then you
> >>> are making an unwarranted assumption.
> >>>
> >>> <snip>
> >>>> If Figure 12.1 H is applied to Figure 12.2 H' then
> >>>>
> >>>> H [H'] [H'] would be analyzed. renaming for clarity: H [H'] [H'2]
> >>>>
> >>>> H'2 --> ((qn)) based on NULL input
> >>>> H'  --> (qy) ∞ based on above ((qn))
> >>>> H   --> ((qn)) based on above (qy) ∞
> >>>>
> >>>> The difference in the behavior of H and H' is that H has
> >>>> two inputs and H' only has one.
> >>>
> >>> TMs have only one input.  Always.  And there are more category errors.
> >>> That list uses the same notation (one that suggest state transitions)
> >>> but one of the three lines refers to a string, not a machine.
> >>>
> >>> <snip>
> >>> -- 
> >>> Ben.
> >>
> >> Technically TMs never have any input they only have a single tape.
> > 
> > Why did you not say that then?  I thought your were striving for a very
> > high level of technical accuracy.  I am very happy to be lax about these
> > things when the meaning is not unclear.  Shall we go back to be casual
> > about this sort of detail?
> > 
> 
> A TM can (for all practical purposes) have zero to N inputs.
> 
> >> Linz shows H of Figure 12.1 with two inputs.
> >>
> >> He slams wM and w together as wMw so it looks like one input.
> >> But the body text is clear that there are two inputs.
> >>
> >> So how are going to disagree with the unequivocal fact that even a
> >> hypothetical halt decider must determine the halting behavior of its
> >> input TMD entirely on the basis of the execution trace of this TMD?
> > 
> > That is not an unequivocal fact.  The meaning is vague enough for
> > equivocation.  If you mean that a decider must examine the trace, and
> > all of the trace, you are clearly wrong.  If you simply mean that a
> > decider must decide based on whether a TMD halts or not, then you are
> > clearly correct -- but the reference to the trace is then mysterious a
> > distraction.  Why reference the trace at all?
> > 
> 
> Because there are details that you are ignoring. (see below)
> 
> >> Maybe finite strings representing TMDs do not have the property of
> >> an execution trace? (not even as a David Hilbert formalism?)
> > 
> > Of course they do.  If the trace is finite, the computation halts.  If
> > it is not finite the computation does not halt.  This is why a decider
> > can't use the actual trace (and only the trace) to determine halting.
> > It must do something else.
> > 
> 
> It can and must use the actual trace in terms of exactly which state
> transitions occur and the sequence that they occur up to the point that
> it detects an infinite loop or infinite recursion.


(qx) doesnt go straight to (qYes) or (qNo)


More like


(qx)--->[BUNCH OF TURING STATES] ---> qY
                         |
                         |
                         v
                        qN



[toc] | [prev] | [next] | [standalone]


#171870

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-04 21:24 +0000
Message-ID<87wozswirw.fsf@bsb.me.uk>
In reply to#171837
Pete Olcott <Pete@NoEmail.address> writes:

> On 2/3/2018 7:19 PM, Ben Bacarisse wrote:
>> peteolcott <peterolcott2@gmail.com> writes:
>>> On Saturday, February 3, 2018 at 6:08:24 PM UTC-6, Ben Bacarisse wrote:
>>>> peteolcott <peterolcott> writes:
<snip>
>>>>> The difference in the behavior of H and H' is that H has
>>>>> two inputs and H' only has one.
>>>>
>>>> TMs have only one input.  Always.  And there are more category errors.
>>>> That list uses the same notation (one that suggest state transitions)
>>>> but one of the three lines refers to a string, not a machine.
>>>
>>> Technically TMs never have any input they only have a single tape.
>>
>> Why did you not say that then?  I thought your were striving for a very
>> high level of technical accuracy.  I am very happy to be lax about these
>> things when the meaning is not unclear.  Shall we go back to be casual
>> about this sort of detail?
>
> A TM can (for all practical purposes) have zero to N inputs.

Does this mean you'd like to go back to being casual?  You chided me for
be lax before so I'd like to know.

But most important of all, you have not addressed the single most
important question.  This sub-thread is a side issue in comparison.  Do
you agree that H^ (as defined by you and others) must always transition
into state qy or state qn regardless of the input tape?  I can't imagine
why you would not want to clear this up right away.  It is central to
the proof and appears to be central to what you are saying.  Please
answer this question.

<snip>
>>> Maybe finite strings representing TMDs do not have the property of
>>> an execution trace? (not even as a David Hilbert formalism?)
>>
>> Of course they do.  If the trace is finite, the computation halts.  If
>> it is not finite the computation does not halt.  This is why a decider
>> can't use the actual trace (and only the trace) to determine halting.
>> It must do something else.
>
> It can and must use the actual trace in terms of exactly which state
> transitions occur and the sequence that they occur up to the point that
> it detects an infinite loop or infinite recursion.

It can't "use the trace" in the sense of simulating the machine.  A
decider can "use the trace" as much as it likes provided it never gets
stuck.  This means that for inputs that describe looping computations, a
decider (of anything -- not just a halt decider) must, at some point,
stop using the trace and accept or reject based on some other criterion
(possibly in addition to data gathered from the partial trace).

Note that I would not care what you mean by the details here if you were
to agree to the big issue repeated above.  That would mean that you know
that a decider that "use[s]the actual trace in terms of exactly which
state transitions occur and the sequence that they occur up to the point
that it detects an infinite loop or infinite recursion" can not do so
indefinitely.

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#171968

Frompeteolcott <peterolcott2@gmail.com>
Date2018-02-05 17:19 -0800
Message-ID<ff93d02a-963c-4750-946b-959242126d83@googlegroups.com>
In reply to#171870
On Sunday, February 4, 2018 at 3:24:06 PM UTC-6, Ben Bacarisse wrote:
> Pete Olcott <> writes:
> 
> > On 2/3/2018 7:19 PM, Ben Bacarisse wrote:
> >> peteolcott <peterolcott> writes:
> >>> On Saturday, February 3, 2018 at 6:08:24 PM UTC-6, Ben Bacarisse wrote:
> >>>> peteolcott <peterolcott> writes:
> <snip>
> >>>>> The difference in the behavior of H and H' is that H has
> >>>>> two inputs and H' only has one.
> >>>>
> >>>> TMs have only one input.  Always.  And there are more category errors.
> >>>> That list uses the same notation (one that suggest state transitions)
> >>>> but one of the three lines refers to a string, not a machine.
> >>>
> >>> Technically TMs never have any input they only have a single tape.
> >>
> >> Why did you not say that then?  I thought your were striving for a very
> >> high level of technical accuracy.  I am very happy to be lax about these
> >> things when the meaning is not unclear.  Shall we go back to be casual
> >> about this sort of detail?
> >
> > A TM can (for all practical purposes) have zero to N inputs.
> 
> Does this mean you'd like to go back to being casual?  You chided me for
> be lax before so I'd like to know.
> 
> But most important of all, you have not addressed the single most
> important question.  This sub-thread is a side issue in comparison.  Do
> you agree that H^ (as defined by you and others) must always transition
> into state qy or state qn regardless of the input tape?  I can't imagine
> why you would not want to clear this up right away.  It is central to
> the proof and appears to be central to what you are saying.  Please
> answer this question.
> 

You incorrectly said that the steps required to answer this question
cannot possibly be evaluated. Unless we know what kinds of things 
happen after state qx, we cannot know if qy or qn is ever reached. 
You incorrectly said that we cannot know this.

> <snip>
> >>> Maybe finite strings representing TMDs do not have the property of
> >>> an execution trace? (not even as a David Hilbert formalism?)
> >>
> >> Of course they do.  If the trace is finite, the computation halts.  If
> >> it is not finite the computation does not halt.  This is why a decider
> >> can't use the actual trace (and only the trace) to determine halting.
> >> It must do something else.
> >
> > It can and must use the actual trace in terms of exactly which state
> > transitions occur and the sequence that they occur up to the point that
> > it detects an infinite loop or infinite recursion.
> 
> It can't "use the trace" in the sense of simulating the machine. 

Did I say that we simulate the machine? Any genius knows that we
cannot simulate the machine, this is totally obvious. 

> A
> decider can "use the trace" as much as it likes provided it never gets
> stuck.  

Not quite but very close. A decider must use this trace and make 
sure that it does not get stuck. Using the trace is not optional. 
It must know the exact state transition sequence of the input TMD. 

> This means that for inputs that describe looping computations, a
> decider (of anything -- not just a halt decider) must, at some point,
> stop using the trace 

Only if it detects an infinite loop, otherwise it must continue the 
trace until either an infinite loop or a transition to a final state
is detected. 

> and accept or reject based on some other criterion
> (possibly in addition to data gathered from the partial trace).
> 
> Note that I would not care what you mean by the details here if you were
> to agree to the big issue repeated above.  That would mean that you know
> that a decider that "use[s]the actual trace in terms of exactly which
> state transitions occur and the sequence that they occur up to the point
> that it detects an infinite loop or infinite recursion" can not do so
> indefinitely.
> 
> -- 
> Ben.

Yes. It cannot do so indefinitely unless doing it indefinitely is
somehow mandated as a requirement. 

Copyright 2018, Pete Olcott

[toc] | [prev] | [next] | [standalone]


#171975

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-06 02:40 +0000
Message-ID<87o9l2n8mt.fsf@bsb.me.uk>
In reply to#171968
peteolcott <peterolcott2@gmail.com> writes:

> On Sunday, February 4, 2018 at 3:24:06 PM UTC-6, Ben Bacarisse wrote:
<snip>
>> But most important of all, you have not addressed the single most
>> important question.  This sub-thread is a side issue in comparison.  Do
>> you agree that H^ (as defined by you and others) must always transition
>> into state qy or state qn regardless of the input tape?  I can't imagine
>> why you would not want to clear this up right away.  It is central to
>> the proof and appears to be central to what you are saying.  Please
>> answer this question.
>
> You incorrectly said that the steps required to answer this question
> cannot possibly be evaluated. Unless we know what kinds of things 
> happen after state qx, we cannot know if qy or qn is ever reached.

Ah, that sounds like your answer is no, you do *not* agree that H^ (not
matter what H it is derived from) will *always* transition from state qx
to either state qy or state qn (regardless of the content of the tape).

We can know that either qy or qn is reached because H (from which H^ is
derived) is a decider.

Anyway, if you want it, here is a simple statement of why your argument
is wrong: you are allowing the possibility of something that goes
against the assumption of the proof.  The argument starts by assuming
that H is a decider.  From state qx, H^ behaves like H' and thus like H
right up until state qy or qn.

Unless you accept that, by definition, H^ will always get to into either
state qy or state qn, everything else you say is doomed to be
irrelevant.  And once you do accept it, the end of the proof follows
almost immediately.

I don't see how I can help any further.  It's a basic error of reasoning.

<snip>
>> This means that for inputs that describe looping computations, a
>> decider (of anything -- not just a halt decider) must, at some point,
>> stop using the trace 
>
> Only if it detects an infinite loop, otherwise it must continue the 
> trace until either an infinite loop or a transition to a final state
> is detected.

Even if you can't think of any other way a TM might try to decide
halting, it must do this work in a finite number of steps.

<snip>
-- 
Ben.

[toc] | [prev] | [next] | [standalone]


Page 10 of 16 — ← Prev page 1 … 8 9 [10] 11 12 … 16  Next page →

Back to top | Article view | sci.logic


csiph-web