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


#172215

Fromgrahamcooper7@gmail.com
Date2018-02-08 23:22 -0800
Message-ID<89335cd8-e643-4eee-b2c2-6353e76bba19@googlegroups.com>
In reply to#172211
On Friday, February 9, 2018 at 4:53:40 PM UTC+10, Pete Olcott wrote:
> On 2/9/2018 12:38 AM,
>       graham...@gmail.com wrote:
> 
>     
>     
>       
>       
>             This issue was what does H do if its
>       input is an English poem?
> 
>     
> 
>     Yes The English poem is a TM that would
>       halt on its input. 
> 
>     No the English poem is a TM that would
>       not halt on its input. 
> 
>     There is no answer that the input is
>       not a TM. 
> 
>     
> 
>     So Ben said that the actual question is
>       this:
> 
>     Is this input a TM that would halt on
>       its input?
> 
>     Yes (same as above).
> 
>     No includes not a TM. 
> 
> 
>       
>       
>  If this machine U is supplied with the tape on the beginning of which is written the string of quintuples separated by semicolons of some computing machine M, then U will compute the same sequence as M.
> 
> 
> 
> 
> 
> 
> 
>       
>             
> 
>     The extremely subtle thing that I
>       noticed and none of the greatest
> 
>     minds in the world ever noticed is what
>       happens if the input is
> 
>     a syntactically correct TM yet not a
>       semantically correct TM? 
> 
>       
> 
>     The
>             case that I found is where the decider itself would 
> 
>     get into
>         infinite
>             recursion unless it rejected the input as 
> 
>             semantically
>         incorrect
>             before making any halting evaluation. 
> 
> 
>       
>       
> OF COURSE!   GREAT!   JOIN THE CLUB OF 100s OF COMPUTER SCIENTISTS WHO SUGGESTED 
> 
> HALT(X,Y) --> YES/NO/CYCLIC
> 
> 
> 
> So you just ADMITTED no HALT(X,Y) --> YES/NO  Exists Right ?
> 
> 
> 
>     
>     Read this again and again until you understand that this is
>     different than 
> 
>     anything anyone else every said.
> 
>     
> 
>             The
>             case that I found is where the decider itself would 
> 
>     get into
>         infinite
>             recursion unless it rejected the input as 
> 
>             semantically
>         incorrect
>           before
>               making any halting evaluation. 
> 



I asked you to QUALIFY if you meant


HALT(X,Y) --> yes/no/other




X is a NUMBER which HALT uses to BUILD a TABLE of STATE TRANSITIONS (a TM)

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


#172262

FromNewberry <newberryxy@gmail.com>
Date2018-02-09 09:28 -0800
Message-ID<50e7f1e4-bdc9-4dce-b5fe-711e3881949f@googlegroups.com>
In reply to#172211
On Thursday, February 8, 2018 at 10:53:40 PM UTC-8, Pete Olcott wrote:
> On 2/9/2018 12:38 AM,
>       graham...@gmail.com wrote:
> 
>     
>     
>       
>       
>             This issue was what does H do if its
>       input is an English poem?
> 
>     
> 
>     Yes The English poem is a TM that would
>       halt on its input. 
> 
>     No the English poem is a TM that would
>       not halt on its input. 
> 
>     There is no answer that the input is
>       not a TM. 
> 
>     
> 
>     So Ben said that the actual question is
>       this:
> 
>     Is this input a TM that would halt on
>       its input?
> 
>     Yes (same as above).
> 
>     No includes not a TM. 
> 
> 
>       
>       
>  If this machine U is supplied with the tape on the beginning of which is written the string of quintuples separated by semicolons of some computing machine M, then U will compute the same sequence as M.
> 
> 
> 
> 
> 
> 
> 
>       
>             
> 
>     The extremely subtle thing that I
>       noticed and none of the greatest
> 
>     minds in the world ever noticed is what
>       happens if the input is
> 
>     a syntactically correct TM yet not a
>       semantically correct TM? 
> 
>       
> 
>     The
>             case that I found is where the decider itself would 
> 
>     get into
>         infinite
>             recursion unless it rejected the input as 
> 
>             semantically
>         incorrect
>             before making any halting evaluation. 
> 
> 
>       
>       
> OF COURSE!   GREAT!   JOIN THE CLUB OF 100s OF COMPUTER SCIENTISTS WHO SUGGESTED 
> 
> HALT(X,Y) --> YES/NO/CYCLIC
> 
> 
> 
> So you just ADMITTED no HALT(X,Y) --> YES/NO  Exists Right ?
> 
> 
> 
>     
>     Read this again and again until you understand that this is
>     different than 
> 
>     anything anyone else every said.
> 
>     
> 
>             The
>             case that I found is where the decider itself would 
> 
>     get into
>         infinite
>             recursion unless it rejected the input as 
> 
>             semantically
>         incorrect
>           before
>               making any halting evaluation. 
 
You will not get out of the Liar Paradox this way. The decision GOOD INPUT/BAD INPUT is still a decision. In order to make the decision somebody has to halt. And it is a legitimate question to ask if he has halted.

In your particular case both the postulated decider H and the "counter-example" will halt, but H does not know about it. The halt is real, and it is not an ill-formed question to ask if it has occcured.       
 
>     I did not understand this until after spend 3000 hours on the Liar
>     Paradox in
> 
>     the last 18 months inventing a whole branch of mathematics in the
>     process. 
> 
>     I am on the verge of ignoring all of your posts as I am with George.
>     
> 
>     
> 
>     
>     
> -- 
> 
>       
>       
>             ∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X)

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


#172398

FromNewberry <newberryxy@gmail.com>
Date2018-02-10 22:17 -0800
Message-ID<9600e167-910f-4051-9574-9de138467798@googlegroups.com>
In reply to#172262
On Friday, February 9, 2018 at 9:23:49 PM UTC-8, Pete Olcott wrote:
> On 2/9/2018 11:28 AM, Newberry wrote:
> 
>     
>     
>       On Thursday, February 8, 2018 at 10:53:40 PM UTC-8, Pete Olcott wrote:
> 
>       
>         On 2/9/2018 12:38 AM,
>       graham...@gmail.com wrote:
> 
>     
>     
>       
>       
>             This issue was what does H do if its
>       input is an English poem?
> 
>     
> 
>     Yes The English poem is a TM that would
>       halt on its input. 
> 
>     No the English poem is a TM that would
>       not halt on its input. 
> 
>     There is no answer that the input is
>       not a TM. 
> 
>     
> 
>     So Ben said that the actual question is
>       this:
> 
>     Is this input a TM that would halt on
>       its input?
> 
>     Yes (same as above).
> 
>     No includes not a TM. 
> 
> 
>       
>       
>  If this machine U is supplied with the tape on the beginning of which is written the string of quintuples separated by semicolons of some computing machine M, then U will compute the same sequence as M.
> 
> 
> 
> 
> 
> 
> 
>       
>             
> 
>     The extremely subtle thing that I
>       noticed and none of the greatest
> 
>     minds in the world ever noticed is what
>       happens if the input is
> 
>     a syntactically correct TM yet not a
>       semantically correct TM? 
> 
>       
> 
>     The
>             case that I found is where the decider itself would 
> 
>     get into
>         infinite
>             recursion unless it rejected the input as 
> 
>             semantically
>         incorrect
>             before making any halting evaluation. 
> 
> 
>       
>       
> OF COURSE!   GREAT!   JOIN THE CLUB OF 100s OF COMPUTER SCIENTISTS WHO SUGGESTED 
> 
> HALT(X,Y) --> YES/NO/CYCLIC
> 
> 
> 
> So you just ADMITTED no HALT(X,Y) --> YES/NO  Exists Right ?
> 
> 
> 
>     
>     Read this again and again until you understand that this is
>     different than 
> 
>     anything anyone else every said.
> 
>     
> 
>             The
>             case that I found is where the decider itself would 
> 
>     get into
>         infinite
>             recursion unless it rejected the input as 
> 
>             semantically
>         incorrect
>           before
>               making any halting evaluation. 
> 
>       
>        
> You will not get out of the Liar Paradox this way. The decision GOOD INPUT/BAD INPUT is still a decision. In order to make the decision somebody has to halt. And it is a legitimate question to ask if he has halted.
> 
> In your particular case both the postulated decider H and the "counter-example" will halt, but H does not know about it. The halt is real, and it is not an ill-formed question to ask if it has occcured.       
>  
>     
>     
> 
>     The key thing is that in this case it is incorrect for the halt
>     decider to even 
> 
>     begin to evaluate the halt behavior the input TMD. The only correct
>     decision is
> 
>     to reject the input as incorrect and not perform any halt
>     evaluation. 
 
But the decider will halt, and so will the "counter-example" built around it. The halt is there for everybody to see.     
 
>     Decidability
>         of the Halting Problem as a David Hilbert formalism
> 
>     ∃a ∈ Turing_Machines_Descriptions
> 
>     ∀b ∈ Finite_Strings  // some of these specify Turing Machine
>     Descriptions
> 
>     ∀c ∈ Finite_Strings
> 
>     Halts(a, b, c) ∨ ~Halts(a, b, c)
> 
>     
> 
>     Halt Decider
>       definition
> 
>     A Halt Decider (HD) determines whether or not a finite string
>     represents a 
> 
>     correct Turing Machine Description that would halt on its input. It
>     does 
> 
>     this by performing a mathematical proof on a pair of finite strings
>     as a 
> 
>     David Hilbert formalism in the language of Turing Machine
>     Descriptions.
> 
>     
> 
>     The
>         syntactic logical consequence of this proof is two finite
>         strings:
> 
>     (1) “Y”  input pair (b,c) is a correct TMD that would halt on its
>     input.
> 
>     (2) “N” indicating the else branch of (1).
> 
>     
> 
>     "N" indicates
> 
>     (1) Input is not a TMD
> 
>     (2) Input is an incorrect TMD
> 
>     (3) Input is a correct TMD that does not halt
> 
>     
> 
>     Copyright 2017, 2018 Pete Olcott

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


#172401

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-11 00:49 -0600
Message-ID<Eqmdnddq85z6euLHnZ2dnUU7-avNnZ2d@giganews.com>
In reply to#172398
On 2/11/2018 12:17 AM, Newberry wrote:
> On Friday, February 9, 2018 at 9:23:49 PM UTC-8, Pete Olcott wrote:
>> On 2/9/2018 11:28 AM, Newberry wrote:
>>
>>      
>>      
>>        On Thursday, February 8, 2018 at 10:53:40 PM UTC-8, Pete Olcott wrote:
>>
>>        
>>          On 2/9/2018 12:38 AM,
>>        graham...@gmail.com wrote:
>>
>>      
>>      
>>        
>>        
>>              This issue was what does H do if its
>>        input is an English poem?
>>
>>      
>>
>>      Yes The English poem is a TM that would
>>        halt on its input.
>>
>>      No the English poem is a TM that would
>>        not halt on its input.
>>
>>      There is no answer that the input is
>>        not a TM.
>>
>>      
>>
>>      So Ben said that the actual question is
>>        this:
>>
>>      Is this input a TM that would halt on
>>        its input?
>>
>>      Yes (same as above).
>>
>>      No includes not a TM.
>>
>>
>>        
>>        
>>   If this machine U is supplied with the tape on the beginning of which is written the string of quintuples separated by semicolons of some computing machine M, then U will compute the same sequence as M.
>>
>>
>>
>>
>>
>>
>>
>>        
>>              
>>
>>      The extremely subtle thing that I
>>        noticed and none of the greatest
>>
>>      minds in the world ever noticed is what
>>        happens if the input is
>>
>>      a syntactically correct TM yet not a
>>        semantically correct TM?
>>
>>        
>>
>>      The
>>              case that I found is where the decider itself would
>>
>>      get into
>>          infinite
>>              recursion unless it rejected the input as
>>
>>              semantically
>>          incorrect
>>              before making any halting evaluation.
>>
>>
>>        
>>        
>> OF COURSE!   GREAT!   JOIN THE CLUB OF 100s OF COMPUTER SCIENTISTS WHO SUGGESTED
>>
>> HALT(X,Y) --> YES/NO/CYCLIC
>>
>>
>>
>> So you just ADMITTED no HALT(X,Y) --> YES/NO  Exists Right ?
>>
>>
>>
>>      
>>      Read this again and again until you understand that this is
>>      different than
>>
>>      anything anyone else every said.
>>
>>      
>>
>>              The
>>              case that I found is where the decider itself would
>>
>>      get into
>>          infinite
>>              recursion unless it rejected the input as
>>
>>              semantically
>>          incorrect
>>            before
>>                making any halting evaluation.
>>
>>        
>>         
>> You will not get out of the Liar Paradox this way. The decision GOOD INPUT/BAD INPUT is still a decision. In order to make the decision somebody has to halt. And it is a legitimate question to ask if he has halted.
>>
>> In your particular case both the postulated decider H and the "counter-example" will halt, but H does not know about it. The halt is real, and it is not an ill-formed question to ask if it has occcured.
>>   
>>      
>>      
>>
>>      The key thing is that in this case it is incorrect for the halt
>>      decider to even
>>
>>      begin to evaluate the halt behavior the input TMD. The only correct
>>      decision is
>>
>>      to reject the input as incorrect and not perform any halt
>>      evaluation.
>   
> But the decider will halt, and so will the "counter-example" built around it. The halt is there for everybody to see.

Definition of Turing Machine H
H.q0 Wm W ⊢* H.qy
H.q0 Wm W ⊢* H.qn

Definition of Turing Machine Ĥx
Ĥx.q0 Wm ⊢* Ĥx.qx Wm Wm ⊢* Ĥx.qy // NO LOOP
Ĥx.q0 Wm ⊢* Ĥx.qx Wm Wm ⊢* Ĥx.qn // NO LOOP HERE EITHER

H [Ĥx] [Ĥx]

Every machine specified by the above infinitely recursive
evaluation sequence would halt only because it rejects the
whole sequence as erroneous before any halting analysis ever begins.

Therefore H transitions to its final state of H.qn rejecting this whole sequence.

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

Copyright 2018 Pete Olcott

>   
>>      Decidability
>>          of the Halting Problem as a David Hilbert formalism
>>
>>      ∃a ∈ Turing_Machines_Descriptions
>>
>>      ∀b ∈ Finite_Strings  // some of these specify Turing Machine
>>      Descriptions
>>
>>      ∀c ∈ Finite_Strings
>>
>>      Halts(a, b, c) ∨ ~Halts(a, b, c)
>>
>>      
>>
>>      Halt Decider
>>        definition
>>
>>      A Halt Decider (HD) determines whether or not a finite string
>>      represents a
>>
>>      correct Turing Machine Description that would halt on its input. It
>>      does
>>
>>      this by performing a mathematical proof on a pair of finite strings
>>      as a
>>
>>      David Hilbert formalism in the language of Turing Machine
>>      Descriptions.
>>
>>      
>>
>>      The
>>          syntactic logical consequence of this proof is two finite
>>          strings:
>>
>>      (1) “Y”  input pair (b,c) is a correct TMD that would halt on its
>>      input.
>>
>>      (2) “N” indicating the else branch of (1).
>>
>>      
>>
>>      "N" indicates
>>
>>      (1) Input is not a TMD
>>
>>      (2) Input is an incorrect TMD
>>
>>      (3) Input is a correct TMD that does not halt
>>
>>      
>>
>>      Copyright 2017, 2018 Pete Olcott
> 


-- 
*∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *

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


#172408

Fromgrahamcooper7@gmail.com
Date2018-02-11 00:38 -0800
Message-ID<c5fb118b-7c50-4785-b656-a2e20b5e6745@googlegroups.com>
In reply to#172401
On Sunday, February 11, 2018 at 4:49:17 PM UTC+10, Pete Olcott wrote:
> On 2/11/2018 12:17 AM, Newberry wrote:
> > On Friday, February 9, 2018 at 9:23:49 PM UTC-8, Pete Olcott wrote:
> >> On 2/9/2018 11:28 AM, Newberry wrote:
> >>
> >>      
> >>      
> >>        On Thursday, February 8, 2018 at 10:53:40 PM UTC-8, Pete Olcott wrote:
> >>
> >>        
> >>          On 2/9/2018 12:38 AM,
> >>        graham...@gmail.com wrote:
> >>
> >>      
> >>      
> >>        
> >>        
> >>              This issue was what does H do if its
> >>        input is an English poem?
> >>
> >>      
> >>
> >>      Yes The English poem is a TM that would
> >>        halt on its input.
> >>
> >>      No the English poem is a TM that would
> >>        not halt on its input.
> >>
> >>      There is no answer that the input is
> >>        not a TM.
> >>
> >>      
> >>
> >>      So Ben said that the actual question is
> >>        this:
> >>
> >>      Is this input a TM that would halt on
> >>        its input?
> >>
> >>      Yes (same as above).
> >>
> >>      No includes not a TM.
> >>
> >>
> >>        
> >>        
> >>   If this machine U is supplied with the tape on the beginning of which is written the string of quintuples separated by semicolons of some computing machine M, then U will compute the same sequence as M.
> >>
> >>
> >>
> >>
> >>
> >>
> >>
> >>        
> >>              
> >>
> >>      The extremely subtle thing that I
> >>        noticed and none of the greatest
> >>
> >>      minds in the world ever noticed is what
> >>        happens if the input is
> >>
> >>      a syntactically correct TM yet not a
> >>        semantically correct TM?
> >>
> >>        
> >>
> >>      The
> >>              case that I found is where the decider itself would
> >>
> >>      get into
> >>          infinite
> >>              recursion unless it rejected the input as
> >>
> >>              semantically
> >>          incorrect
> >>              before making any halting evaluation.
> >>
> >>
> >>        
> >>        
> >> OF COURSE!   GREAT!   JOIN THE CLUB OF 100s OF COMPUTER SCIENTISTS WHO SUGGESTED
> >>
> >> HALT(X,Y) --> YES/NO/CYCLIC
> >>
> >>
> >>
> >> So you just ADMITTED no HALT(X,Y) --> YES/NO  Exists Right ?
> >>
> >>
> >>
> >>      
> >>      Read this again and again until you understand that this is
> >>      different than
> >>
> >>      anything anyone else every said.
> >>
> >>      
> >>
> >>              The
> >>              case that I found is where the decider itself would
> >>
> >>      get into
> >>          infinite
> >>              recursion unless it rejected the input as
> >>
> >>              semantically
> >>          incorrect
> >>            before
> >>                making any halting evaluation.
> >>
> >>        
> >>         
> >> You will not get out of the Liar Paradox this way. The decision GOOD INPUT/BAD INPUT is still a decision. In order to make the decision somebody has to halt. And it is a legitimate question to ask if he has halted.
> >>
> >> In your particular case both the postulated decider H and the "counter-example" will halt, but H does not know about it. The halt is real, and it is not an ill-formed question to ask if it has occcured.
> >>   
> >>      
> >>      
> >>
> >>      The key thing is that in this case it is incorrect for the halt
> >>      decider to even
> >>
> >>      begin to evaluate the halt behavior the input TMD. The only correct
> >>      decision is
> >>
> >>      to reject the input as incorrect and not perform any halt
> >>      evaluation.
> >   
> > But the decider will halt, and so will the "counter-example" built around it. The halt is there for everybody to see.
> 
> Definition of Turing Machine H
> H.q0 Wm W ⊢* H.qy
> H.q0 Wm W ⊢* H.qn
> 
> Definition of Turing Machine Ĥx
> Ĥx.q0 Wm ⊢* Ĥx.qx Wm Wm ⊢* Ĥx.qy // NO LOOP
> Ĥx.q0 Wm ⊢* Ĥx.qx Wm Wm ⊢* Ĥx.qn // NO LOOP HERE EITHER
> 
> H [Ĥx] [Ĥx]
> 
> Every machine specified by the above infinitely recursive
> evaluation sequence would halt only because it rejects the




the normal counter-example for Halt is


function LOOPS(x)

   if HALT(x,x) then LOOPS(X)






Peter seems to substitute his own counter-example


function PETES(x)

   if HALT(x,x) then EXIST




WHICH WORKS!!!

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


#172410

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-11 12:13 +0000
Message-ID<87fu67k9lf.fsf@bsb.me.uk>
In reply to#172401
Pete Olcott <Pete@NoEmail.address> writes:

> Definition of Turing Machine H
> H.q0 Wm W ⊢* H.qy
> H.q0 Wm W ⊢* H.qn

1. Not a definition.
2. Not even a complete specification of behaviour.
3. Many TM satisfy one or other of these lines.

> Definition of Turing Machine Ĥx
> Ĥx.q0 Wm ⊢* Ĥx.qx Wm Wm ⊢* Ĥx.qy // NO LOOP
> Ĥx.q0 Wm ⊢* Ĥx.qx Wm Wm ⊢* Ĥx.qn // NO LOOP HERE EITHER

1. Not a definition.
2. Not even a complete specification of behaviour.
3. Many TM satisfy one or other of these lines.

> H [Ĥx] [Ĥx]
>
> Every machine specified by the above infinitely recursive
> evaluation sequence would halt only because it rejects the
> whole sequence as erroneous before any halting analysis ever begins.
>
> Therefore H transitions to its final state of H.qn rejecting this
> whole sequence.

Yes, it may well do.  The trivial machine that rejects all inputs
satisfies your specification of H.  Likewise the trivial machine that
accepts all inputs.  On the other hand, a halting decider (which is what
you think you have specified) must accept [H^x] [H^x] because H^x halts
on all inputs.  Any H that rejects [H^x] [H^x] is not a halting decider.

-- 
Ben.

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


#172421

FromNewberry <newberryxy@gmail.com>
Date2018-02-11 07:14 -0800
Message-ID<f76c44f8-3320-4a99-99ab-40eb7e7fb1ac@googlegroups.com>
In reply to#172401
On Saturday, February 10, 2018 at 10:49:17 PM UTC-8, Pete Olcott wrote:
> On 2/11/2018 12:17 AM, Newberry wrote:
> > On Friday, February 9, 2018 at 9:23:49 PM UTC-8, Pete Olcott wrote:
> >> On 2/9/2018 11:28 AM, Newberry wrote:
> >>
> >>      
> >>      
> >>        On Thursday, February 8, 2018 at 10:53:40 PM UTC-8, Pete Olcott wrote:
> >>
> >>        
> >>          On 2/9/2018 12:38 AM,
> >>        graham...@gmail.com wrote:
> >>
> >>      
> >>      
> >>        
> >>        
> >>              This issue was what does H do if its
> >>        input is an English poem?
> >>
> >>      
> >>
> >>      Yes The English poem is a TM that would
> >>        halt on its input.
> >>
> >>      No the English poem is a TM that would
> >>        not halt on its input.
> >>
> >>      There is no answer that the input is
> >>        not a TM.
> >>
> >>      
> >>
> >>      So Ben said that the actual question is
> >>        this:
> >>
> >>      Is this input a TM that would halt on
> >>        its input?
> >>
> >>      Yes (same as above).
> >>
> >>      No includes not a TM.
> >>
> >>
> >>        
> >>        
> >>   If this machine U is supplied with the tape on the beginning of which is written the string of quintuples separated by semicolons of some computing machine M, then U will compute the same sequence as M.
> >>
> >>
> >>
> >>
> >>
> >>
> >>
> >>        
> >>              
> >>
> >>      The extremely subtle thing that I
> >>        noticed and none of the greatest
> >>
> >>      minds in the world ever noticed is what
> >>        happens if the input is
> >>
> >>      a syntactically correct TM yet not a
> >>        semantically correct TM?
> >>
> >>        
> >>
> >>      The
> >>              case that I found is where the decider itself would
> >>
> >>      get into
> >>          infinite
> >>              recursion unless it rejected the input as
> >>
> >>              semantically
> >>          incorrect
> >>              before making any halting evaluation.
> >>
> >>
> >>        
> >>        
> >> OF COURSE!   GREAT!   JOIN THE CLUB OF 100s OF COMPUTER SCIENTISTS WHO SUGGESTED
> >>
> >> HALT(X,Y) --> YES/NO/CYCLIC
> >>
> >>
> >>
> >> So you just ADMITTED no HALT(X,Y) --> YES/NO  Exists Right ?
> >>
> >>
> >>
> >>      
> >>      Read this again and again until you understand that this is
> >>      different than
> >>
> >>      anything anyone else every said.
> >>
> >>      
> >>
> >>              The
> >>              case that I found is where the decider itself would
> >>
> >>      get into
> >>          infinite
> >>              recursion unless it rejected the input as
> >>
> >>              semantically
> >>          incorrect
> >>            before
> >>                making any halting evaluation.
> >>
> >>        
> >>         
> >> You will not get out of the Liar Paradox this way. The decision GOOD INPUT/BAD INPUT is still a decision. In order to make the decision somebody has to halt. And it is a legitimate question to ask if he has halted.
> >>
> >> In your particular case both the postulated decider H and the "counter-example" will halt, but H does not know about it. The halt is real, and it is not an ill-formed question to ask if it has occcured.
> >>   
> >>      
> >>      
> >>
> >>      The key thing is that in this case it is incorrect for the halt
> >>      decider to even
> >>
> >>      begin to evaluate the halt behavior the input TMD. The only correct
> >>      decision is
> >>
> >>      to reject the input as incorrect and not perform any halt
> >>      evaluation.
> >   
> > But the decider will halt, and so will the "counter-example" built around it. The halt is there for everybody to see.
> 
> Definition of Turing Machine H
> H.q0 Wm W ⊢* H.qy
> H.q0 Wm W ⊢* H.qn
> 
> Definition of Turing Machine Ĥx
> Ĥx.q0 Wm ⊢* Ĥx.qx Wm Wm ⊢* Ĥx.qy // NO LOOP
> Ĥx.q0 Wm ⊢* Ĥx.qx Wm Wm ⊢* Ĥx.qn // NO LOOP HERE EITHER

Not too long ago you said that the question cannot even be asked. Now you are saying that there is no loop? You mean there is no loop, but you cannot ask if there is a loop?
 
> H [Ĥx] [Ĥx]
> 
> Every machine specified by the above infinitely recursive
> evaluation sequence would halt only because it rejects the
> whole sequence as erroneous before any halting analysis ever begins.
> 
> Therefore H transitions to its final state of H.qn rejecting this whole sequence.
> 
> Recently rewritten:
> http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/
> 
> Copyright 2018 Pete Olcott
> 
> >   
> >>      Decidability
> >>          of the Halting Problem as a David Hilbert formalism
> >>
> >>      ∃a ∈ Turing_Machines_Descriptions
> >>
> >>      ∀b ∈ Finite_Strings  // some of these specify Turing Machine
> >>      Descriptions
> >>
> >>      ∀c ∈ Finite_Strings
> >>
> >>      Halts(a, b, c) ∨ ~Halts(a, b, c)
> >>
> >>      
> >>
> >>      Halt Decider
> >>        definition
> >>
> >>      A Halt Decider (HD) determines whether or not a finite string
> >>      represents a
> >>
> >>      correct Turing Machine Description that would halt on its input. It
> >>      does
> >>
> >>      this by performing a mathematical proof on a pair of finite strings
> >>      as a
> >>
> >>      David Hilbert formalism in the language of Turing Machine
> >>      Descriptions.
> >>
> >>      
> >>
> >>      The
> >>          syntactic logical consequence of this proof is two finite
> >>          strings:
> >>
> >>      (1) “Y”  input pair (b,c) is a correct TMD that would halt on its
> >>      input.
> >>
> >>      (2) “N” indicating the else branch of (1).
> >>
> >>      
> >>
> >>      "N" indicates
> >>
> >>      (1) Input is not a TMD
> >>
> >>      (2) Input is an incorrect TMD
> >>
> >>      (3) Input is a correct TMD that does not halt
> >>
> >>      
> >>
> >>      Copyright 2017, 2018 Pete Olcott
> > 
> 
> 
> -- 
> *∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *

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


#172532

Frompeteolcott <peterolcott2@gmail.com>
Date2018-02-12 18:05 -0800
Message-ID<56e22e70-6cf8-4a60-9b41-bfaea740a3ca@googlegroups.com>
In reply to#172421
On Sunday, February 11, 2018 at 9:14:41 AM UTC-6, Newberry wrote:
> On Saturday, February 10, 2018 at 10:49:17 PM UTC-8, Pete Olcott wrote:
> > On 2/11/2018 12:17 AM, Newberry wrote:
> > > On Friday, February 9, 2018 at 9:23:49 PM UTC-8, Pete Olcott wrote:
> > >> On 2/9/2018 11:28 AM, Newberry wrote:
> > >>
> > >>      
> > >>      
> > >>        On Thursday, February 8, 2018 at 10:53:40 PM UTC-8, Pete Olcott wrote:
> > >>
> > >>        
> > >>          On 2/9/2018 12:38 AM,
> > >>        graham...@gmail.com wrote:
> > >>
> > >>      
> > >>      
> > >>        
> > >>        
> > >>              This issue was what does H do if its
> > >>        input is an English poem?
> > >>
> > >>      
> > >>
> > >>      Yes The English poem is a TM that would
> > >>        halt on its input.
> > >>
> > >>      No the English poem is a TM that would
> > >>        not halt on its input.
> > >>
> > >>      There is no answer that the input is
> > >>        not a TM.
> > >>
> > >>      
> > >>
> > >>      So Ben said that the actual question is
> > >>        this:
> > >>
> > >>      Is this input a TM that would halt on
> > >>        its input?
> > >>
> > >>      Yes (same as above).
> > >>
> > >>      No includes not a TM.
> > >>
> > >>
> > >>        
> > >>        
> > >>   If this machine U is supplied with the tape on the beginning of which is written the string of quintuples separated by semicolons of some computing machine M, then U will compute the same sequence as M.
> > >>
> > >>
> > >>
> > >>
> > >>
> > >>
> > >>
> > >>        
> > >>              
> > >>
> > >>      The extremely subtle thing that I
> > >>        noticed and none of the greatest
> > >>
> > >>      minds in the world ever noticed is what
> > >>        happens if the input is
> > >>
> > >>      a syntactically correct TM yet not a
> > >>        semantically correct TM?
> > >>
> > >>        
> > >>
> > >>      The
> > >>              case that I found is where the decider itself would
> > >>
> > >>      get into
> > >>          infinite
> > >>              recursion unless it rejected the input as
> > >>
> > >>              semantically
> > >>          incorrect
> > >>              before making any halting evaluation.
> > >>
> > >>
> > >>        
> > >>        
> > >> OF COURSE!   GREAT!   JOIN THE CLUB OF 100s OF COMPUTER SCIENTISTS WHO SUGGESTED
> > >>
> > >> HALT(X,Y) --> YES/NO/CYCLIC
> > >>
> > >>
> > >>
> > >> So you just ADMITTED no HALT(X,Y) --> YES/NO  Exists Right ?
> > >>
> > >>
> > >>
> > >>      
> > >>      Read this again and again until you understand that this is
> > >>      different than
> > >>
> > >>      anything anyone else every said.
> > >>
> > >>      
> > >>
> > >>              The
> > >>              case that I found is where the decider itself would
> > >>
> > >>      get into
> > >>          infinite
> > >>              recursion unless it rejected the input as
> > >>
> > >>              semantically
> > >>          incorrect
> > >>            before
> > >>                making any halting evaluation.
> > >>
> > >>        
> > >>         
> > >> You will not get out of the Liar Paradox this way. The decision GOOD INPUT/BAD INPUT is still a decision. In order to make the decision somebody has to halt. And it is a legitimate question to ask if he has halted.
> > >>
> > >> In your particular case both the postulated decider H and the "counter-example" will halt, but H does not know about it. The halt is real, and it is not an ill-formed question to ask if it has occcured.
> > >>   
> > >>      
> > >>      
> > >>
> > >>      The key thing is that in this case it is incorrect for the halt
> > >>      decider to even
> > >>
> > >>      begin to evaluate the halt behavior the input TMD. The only correct
> > >>      decision is
> > >>
> > >>      to reject the input as incorrect and not perform any halt
> > >>      evaluation.
> > >   
> > > But the decider will halt, and so will the "counter-example" built around it. The halt is there for everybody to see.
> > 
> > Definition of Turing Machine H
> > H.q0 Wm W ⊢* H.qy
> > H.q0 Wm W ⊢* H.qn
> > 
> > Definition of Turing Machine Ĥx
> > Ĥx.q0 Wm ⊢* Ĥx.qx Wm Wm ⊢* Ĥx.qy // NO LOOP
> > Ĥx.q0 Wm ⊢* Ĥx.qx Wm Wm ⊢* Ĥx.qn // NO LOOP HERE EITHER
> 
> Not too long ago you said that the question cannot even be asked. Now you are saying that there is no loop? You mean there is no loop, but you cannot ask if there is a loop?
>  

Most people here glance at a couple of my words before providing
their rebuttal. It took me two weeks to get anyone here to notice
that I drastically altered the whole problem definition by 
changing Ĥ into Ĥx. It looks like you have still not noticed this
yet either. 

The Halting Problem proof is inherently infinitely recursive
even if no infinite loop is appended to any final halt state.
Maybe I need to tell you this thirty five more times before
you hear it once? 

Because every TMD needs its own TM / Input pair (As I said 
in March 11, 2017 @ 3:13 PM in comp.theory) every HP proof 
is inherently infinitely recursive.

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


#172536

Fromgrahamcooper7@gmail.com
Date2018-02-12 18:23 -0800
Message-ID<f206bdcd-2fb7-4554-9934-328a532e4050@googlegroups.com>
In reply to#172532
On Tuesday,  peteolcott wrote:

> Most people here glance at a couple of my words before providing
> their rebuttal. 


thats because you contradict yourself in the first few words




> It took me two weeks to get anyone here to notice
> that I drastically altered the whole problem definition by 
> changing Ĥ into Ĥx. It looks like you have still not noticed this
> yet either. 


I can count 20 POSTS telling you that H^ is a valid counter-example
for H and cannot be dismissed





> 
> The Halting Problem proof is inherently infinitely recursive
> even if no infinite loop is appended to any final halt state.
> Maybe I need to tell you this thirty five more times before
> you hear it once? 



OH STOP WHINING!

10 COMPUTER SCIENTISTS HAVE WRITTEN DETAILED NUMEROUS RESPONSES

NUMBERING 20,000 WORDS OF COMPUTER LOGIC DETAILS






function h-hat( W )
BEGIN
  if halt(W,W) then BEGIN
END


halt( h-hat, h-hat )

USES RECURSION


but TURING MACHINES dont use recursion




the EXACT HALT TM is fed a slightly modified tape input that is all!





> 
> Because every TMD needs its own TM / Input pair (As I said 
> in March 11, 2017 @ 3:13 PM in comp.theory) every HP proof 
> is inherently infinitely recursive.



High Order functions take FUNCTIONS as input.


---IF--- a high order function HALT

takes functions as input

then a CONTRADICTION EXISTS!



ERGO:  FUNCTION HALT DOES NOT EXIST QED.





20,000 WORDS DETAILED RESPONSES PETER!!!

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


#172544

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-12 21:00 -0600
Message-ID<Gq6dnds_941FyR_HnZ2dnUU7-T3NnZ2d@giganews.com>
In reply to#172536
On 2/12/2018 8:23 PM, grahamcooper7@gmail.com wrote:
> On Tuesday,  peteolcott wrote:
> 
>> Most people here glance at a couple of my words before providing
>> their rebuttal.
> 
> 
> thats because you contradict yourself in the first few words
> 
> 
> 
> 
>> It took me two weeks to get anyone here to notice
>> that I drastically altered the whole problem definition by
>> changing Ĥ into Ĥx. It looks like you have still not noticed this
>> yet either.
> 
> 
> I can count 20 POSTS telling you that H^ is a valid counter-example
> for H and cannot be dismissed
> 
> 
> 
> 
> 
>>
>> The Halting Problem proof is inherently infinitely recursive
>> even if no infinite loop is appended to any final halt state.
>> Maybe I need to tell you this thirty five more times before
>> you hear it once?
> 
> 
> 
> OH STOP WHINING!
> 
> 10 COMPUTER SCIENTISTS HAVE WRITTEN DETAILED NUMEROUS RESPONSES
> 
> NUMBERING 20,000 WORDS OF COMPUTER LOGIC DETAILS
> 
> 
> 
> 
> 
> 
> function h-hat( W )
> BEGIN
>    if halt(W,W) then BEGIN
> END
> 
> 
> halt( h-hat, h-hat )
> 
> USES RECURSION
> 
> 
> but TURING MACHINES dont use recursion
> 
> 
> 
> 
> the EXACT HALT TM is fed a slightly modified tape input that is all!
> 
> 
> 
> 
> 
>>
>> Because every TMD needs its own TM / Input pair (As I said
>> in March 11, 2017 @ 3:13 PM in comp.theory) every HP proof
>> is inherently infinitely recursive.
> 
> 
> 
> High Order functions take FUNCTIONS as input.
> 

I thought that you understood Prolog.

http://www.swi-prolog.org/pldoc/man?predicate=unify_with_occurs_check/2
That is how Prolog detects and rejects Pathological self-reference(Olcott 2004).

It is not that a function takes a function that is OK.
It is not that the input is recursive (like factorial) that is OK.

It is that the input is recursive and there is no recursion termination condition.
I think that you are bright enough to understand this last part.

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


#172559

FromNewberry <newberryxy@gmail.com>
Date2018-02-12 20:39 -0800
Message-ID<9e744791-e001-48d5-9a98-17a24f03ea95@googlegroups.com>
In reply to#172544
On Monday, February 12, 2018 at 7:00:47 PM UTC-8, Pete Olcott wrote:
> On 2/12/2018 8:23 PM, grahamcooper7@gmail.com wrote:
> > On Tuesday,  peteolcott wrote:
> > 
> >> Most people here glance at a couple of my words before providing
> >> their rebuttal.
> > 
> > 
> > thats because you contradict yourself in the first few words
> > 
> > 
> > 
> > 
> >> It took me two weeks to get anyone here to notice
> >> that I drastically altered the whole problem definition by
> >> changing Ĥ into Ĥx. It looks like you have still not noticed this
> >> yet either.
> > 
> > 
> > I can count 20 POSTS telling you that H^ is a valid counter-example
> > for H and cannot be dismissed
> > 
> > 
> > 
> > 
> > 
> >>
> >> The Halting Problem proof is inherently infinitely recursive
> >> even if no infinite loop is appended to any final halt state.
> >> Maybe I need to tell you this thirty five more times before
> >> you hear it once?
> > 
> > 
> > 
> > OH STOP WHINING!
> > 
> > 10 COMPUTER SCIENTISTS HAVE WRITTEN DETAILED NUMEROUS RESPONSES
> > 
> > NUMBERING 20,000 WORDS OF COMPUTER LOGIC DETAILS
> > 
> > 
> > 
> > 
> > 
> > 
> > function h-hat( W )
> > BEGIN
> >    if halt(W,W) then BEGIN
> > END
> > 
> > 
> > halt( h-hat, h-hat )
> > 
> > USES RECURSION
> > 
> > 
> > but TURING MACHINES dont use recursion
> > 
> > 
> > 
> > 
> > the EXACT HALT TM is fed a slightly modified tape input that is all!
> > 
> > 
> > 
> > 
> > 
> >>
> >> Because every TMD needs its own TM / Input pair (As I said
> >> in March 11, 2017 @ 3:13 PM in comp.theory) every HP proof
> >> is inherently infinitely recursive.
> > 
> > 
> > 
> > High Order functions take FUNCTIONS as input.
> > 
> 
> I thought that you understood Prolog.
> 
> http://www.swi-prolog.org/pldoc/man?predicate=unify_with_occurs_check/2
> That is how Prolog detects and rejects Pathological self-reference(Olcott 2004).
> 
> It is not that a function takes a function that is OK.
> It is not that the input is recursive (like factorial) that is OK.
> 
> It is that the input is recursive and there is no recursion termination condition.

If there is NO recursion termination condition whatsoever then it is indeed easy to to conclude that it will never end. But if there is

    if (condition == 1) then stop recursing or exit loop

then it gets more complicated.

> I think that you are bright enough to understand this last part.

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


#172562

Fromgrahamcooper7@gmail.com
Date2018-02-12 21:26 -0800
Message-ID<b0c73618-d13d-4b4e-9527-09dc774e53b1@googlegroups.com>
In reply to#172559
On Tuesday, February 13, 2018 at 2:39:42 PM UTC+10, Newberry wrote:
> On Monday, February 12, 2018 at 7:00:47 PM UTC-8, Pete Olcott wrote:
> > On 2/12/2018 8:23 PM, grahamcooper7@gmail.com wrote:
> > > On Tuesday,  peteolcott wrote:
> > > 
> > >> Most people here glance at a couple of my words before providing
> > >> their rebuttal.
> > > 
> > > 
> > > thats because you contradict yourself in the first few words
> > > 
> > > 
> > > 
> > > 
> > >> It took me two weeks to get anyone here to notice
> > >> that I drastically altered the whole problem definition by
> > >> changing Ĥ into Ĥx. It looks like you have still not noticed this
> > >> yet either.
> > > 
> > > 
> > > I can count 20 POSTS telling you that H^ is a valid counter-example
> > > for H and cannot be dismissed
> > > 
> > > 
> > > 
> > > 
> > > 
> > >>
> > >> The Halting Problem proof is inherently infinitely recursive
> > >> even if no infinite loop is appended to any final halt state.
> > >> Maybe I need to tell you this thirty five more times before
> > >> you hear it once?
> > > 
> > > 
> > > 
> > > OH STOP WHINING!
> > > 
> > > 10 COMPUTER SCIENTISTS HAVE WRITTEN DETAILED NUMEROUS RESPONSES
> > > 
> > > NUMBERING 20,000 WORDS OF COMPUTER LOGIC DETAILS
> > > 
> > > 
> > > 
> > > 
> > > 
> > > 
> > > function h-hat( W )
> > > BEGIN
> > >    if halt(W,W) then BEGIN
> > > END
> > > 
> > > 
> > > halt( h-hat, h-hat )
> > > 
> > > USES RECURSION
> > > 
> > > 
> > > but TURING MACHINES dont use recursion
> > > 
> > > 
> > > 
> > > 
> > > the EXACT HALT TM is fed a slightly modified tape input that is all!
> > > 
> > > 
> > > 
> > > 
> > > 
> > >>
> > >> Because every TMD needs its own TM / Input pair (As I said
> > >> in March 11, 2017 @ 3:13 PM in comp.theory) every HP proof
> > >> is inherently infinitely recursive.
> > > 
> > > 
> > > 
> > > High Order functions take FUNCTIONS as input.
> > > 
> > 
> > I thought that you understood Prolog.
> > 
> > http://www.swi-prolog.org/pldoc/man?predicate=unify_with_occurs_check/2
> > That is how Prolog detects and rejects Pathological self-reference(Olcott 2004).
> > 
> > It is not that a function takes a function that is OK.
> > It is not that the input is recursive (like factorial) that is OK.
> > 
> > It is that the input is recursive and there is no recursion termination condition.
> 
> If there is NO recursion termination condition whatsoever then it is indeed easy to to conclude that it will never end. But if there is
> 
>     if (condition == 1) then stop recursing or exit loop
> 
> then it gets more complicated.



RIGHT!


function H^ (W)
BEGIN
   if **** HALT(W,W) **** then BEGIN
END



All the PETE PHILOSOPHY is not about recursing functions at all!

It all happens inside the 1 function call HALT(W,W) ... 

which just finishes with TRUE or FALSE



IN FACT

HALT( H^x , H^x ) = YES



Petes ALL NEW H^x merely HALTS



> 
> > I think that you are bright enough to understand this last part.


I've told you 10 times....


occurs_check(   foo(X) , X  )


is NOT PURE PROLOG




its a C+ add on function.

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


#172553

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-13 04:21 +0000
Message-ID<87mv0dh63w.fsf@bsb.me.uk>
In reply to#172532
peteolcott <peterolcott2@gmail.com> writes:
<snip>
> Most people here glance at a couple of my words before providing their
> rebuttal. It took me two weeks to get anyone here to notice that I
> drastically altered the whole problem definition by changing Ĥ into
> Ĥx.

When did you first post about H^x?

And H^x does not alter the problem definition at all.  It remains the
problem of determining if a computation halts or not.  Nor does it alter
the theorem at all -- it's still a theorem not matter what other
machines you hypothesise.

<snip>
> Because every TMD needs its own TM / Input pair (As I said 
> in March 11, 2017 @ 3:13 PM in comp.theory) every HP proof 
> is inherently infinitely recursive.

You don't know what every HP proof does.  Have you, for example, read
Turing's original proof?  Do you know Radó's proof via the busy beaver
function?  What about Chaitin's proof?  Did you even read theorem 11.3 in
Linz?  The existence of a halting decider would contradict it.

There is (for most people) an easy way to see why what you say is
nonsense.  Nothing in your "inherently infinitely recursive" argument
specifically applies to a halting decider.  There are lots of properties
of computations that /are/ decidable and from such a decider, D, (one
that really exists this time) we can make D' just like we construct H'
from a hypothetical halt decider, and from that we can make D^ like we
make H^.  Linz's HP proof then just asks what

  H^ [H^]

does, and we can do the same for any other decider, D.  I.e., we can ask
what

  D^ [D^]

does.  If the first is "inherently infinitely recursive", why isn't the
second?  But the corresponding existence question -- the existence of
such a decider -- would be answered by you (I hope) quite differently
because it could be explicitly written out.

-- 
Ben.

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


#172588

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-13 10:12 -0600
Message-ID<arednfaRxfsekx7HnZ2dnUU7-eXNnZ2d@giganews.com>
In reply to#172553
On 2/12/2018 10:21 PM, Ben Bacarisse wrote:
> peteolcott <peterolcott2@gmail.com> writes:
> <snip>
>> Most people here glance at a couple of my words before providing their
>> rebuttal. It took me two weeks to get anyone here to notice that I
>> drastically altered the whole problem definition by changing Ĥ into
>> Ĥx.
> 
> When did you first post about H^x?
> 
> And H^x does not alter the problem definition at all.  It remains the
> problem of determining if a computation halts or not.  Nor does it alter
> the theorem at all -- it's still a theorem not matter what other
> machines you hypothesise.
> 

It simply removes extraneous complexity making it more difficult for
people to follow my reasoning. It is only because I totally eliminate
every trace of Fred Brooks inessential complexity that it is possible
for me to correctly refute these otherwise enormously complex problems.


> <snip>
>> Because every TMD needs its own TM / Input pair (As I said
>> in March 11, 2017 @ 3:13 PM in comp.theory) every HP proof
>> is inherently infinitely recursive.
> 
> You don't know what every HP proof does.  Have you, for example, read
> Turing's original proof?  Do you know Radó's proof via the busy beaver
> function?  What about Chaitin's proof?  Did you even read theorem 11.3 in
> Linz?  The existence of a halting decider would contradict it.

I have to keep a single-minded focus that it 1000-fold more focused
than typical human beings have. I meant all of the conventional proofs.

> 
> There is (for most people) an easy way to see why what you say is
> nonsense.  Nothing in your "inherently infinitely recursive" argument
> specifically applies to a halting decider.  There are lots of properties
> of computations that /are/ decidable and from such a decider, D, (one
> that really exists this time) we can make D' just like we construct H'
> from a hypothetical halt decider, and from that we can make D^ like we
> make H^.  Linz's HP proof then just asks what
> 
>    H^ [H^]
> 
> does, and we can do the same for any other decider, D.  I.e., we can ask
> what

Yes and it does something that no one else in the world ever noticed that it does.

> 
>    D^ [D^]
> 
> does.  If the first is "inherently infinitely recursive", why isn't the
> second?  But the corresponding existence question -- the existence of
> such a decider -- would be answered by you (I hope) quite differently
> because it could be explicitly written out.
> 

I would have to see the TM definition of D^ before I have any idea what
you are talking about.

H [Ĥ] [Ĥ] every TMD in the infinitely recursive sequence specifies
an infinitely recursive sequence.

Likewise with Ĥ [Ĥ] [Ĥ]

Likewise with H [Ĥx] [Ĥx]



-- 
*∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *

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


#172611

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-13 20:03 +0000
Message-ID<87po58fyhu.fsf@bsb.me.uk>
In reply to#172588
Pete Olcott <Pete@NoEmail.address> writes:

> On 2/12/2018 10:21 PM, Ben Bacarisse wrote:
>> peteolcott <peterolcott2@gmail.com> writes:
>> <snip>
>>> Most people here glance at a couple of my words before providing their
>>> rebuttal. It took me two weeks to get anyone here to notice that I
>>> drastically altered the whole problem definition by changing Ĥ into
>>> Ĥx.
>>
>> When did you first post about H^x?

I'd appreciate an answer to this.

>> And H^x does not alter the problem definition at all.  It remains the
>> problem of determining if a computation halts or not.  Nor does it alter
>> the theorem at all -- it's still a theorem not matter what other
>> machines you hypothesise.
>
> It simply removes extraneous complexity making it more difficult for
> people to follow my reasoning. It is only because I totally eliminate
> every trace of Fred Brooks inessential complexity that it is possible
> for me to correctly refute these otherwise enormously complex
> problems.

No, it means you are no longer talking about the proof.  I'm pretty sure
now that this is because you can see the inevitable end.  You must talk
about something else now, and H^x is as good a anything.

>> <snip>
>>> Because every TMD needs its own TM / Input pair (As I said
>>> in March 11, 2017 @ 3:13 PM in comp.theory) every HP proof
>>> is inherently infinitely recursive.
>>
>> You don't know what every HP proof does.  Have you, for example, read
>> Turing's original proof?  Do you know Radó's proof via the busy beaver
>> function?  What about Chaitin's proof?  Did you even read theorem 11.3 in
>> Linz?  The existence of a halting decider would contradict it.
>
> I have to keep a single-minded focus that it 1000-fold more focused
> than typical human beings have. I meant all of the conventional
> proofs.

You don't know all of the conventional proofs either, do you?

>> There is (for most people) an easy way to see why what you say is
>> nonsense.  Nothing in your "inherently infinitely recursive" argument
>> specifically applies to a halting decider.  There are lots of properties
>> of computations that /are/ decidable and from such a decider, D, (one
>> that really exists this time) we can make D' just like we construct H'
>> from a hypothetical halt decider, and from that we can make D^ like we
>> make H^.  Linz's HP proof then just asks what
>>
>>    H^ [H^]
>>
>> does, and we can do the same for any other decider, D.  I.e., we can ask
>> what
>
> Yes and it does something that no one else in the world ever noticed
> that it does.

You used to claim that but you've stopped saying anything about what H^
does.  I suspect because you've seen what it does.  Anyway, by all means
go back to trying to say that H^ does what you recently claimed.

>>    D^ [D^]
>>
>> does.  If the first is "inherently infinitely recursive", why isn't the
>> second?  But the corresponding existence question -- the existence of
>> such a decider -- would be answered by you (I hope) quite differently
>> because it could be explicitly written out.
>>
>
> I would have to see the TM definition of D^ before I have any idea what
> you are talking about.

Yes, that's a shame.  I don't think all other readers would have that
problem.

> H [Ĥ] [Ĥ] every TMD in the infinitely recursive sequence specifies
> an infinitely recursive sequence.
>
> Likewise with Ĥ [Ĥ] [Ĥ]

Neither of these crop up in the proof.  Why have you written these
computations down?

> Likewise with H [Ĥx] [Ĥx]

Irrelevant.  You recently conceded that H^ (behaving like H') must
always finish in finite time (you called it "breaking out of debug mode"
because I don't think you can imagine any other mode of operation) and
that was a problem.  You saw that the result follows immediately from
the "trace equations" you've been writing unless you can find some
distraction.  That's what H^x is -- an irrelevant distraction.

A new distraction (see the other thread) is that you are not even
talking about the halting problem.

-- 
Ben.

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


#172643

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-13 19:24 -0600
Message-ID<wfadnWC8lMkmEh7HnZ2dnUU7-YHNnZ2d@giganews.com>
In reply to#172611
On 2/13/2018 2:03 PM, Ben Bacarisse wrote:
> Pete Olcott <Pete@NoEmail.address> writes:
> 
>> On 2/12/2018 10:21 PM, Ben Bacarisse wrote:
>>> peteolcott <peterolcott2@gmail.com> writes:
>>> <snip>
>>>> Most people here glance at a couple of my words before providing their
>>>> rebuttal. It took me two weeks to get anyone here to notice that I
>>>> drastically altered the whole problem definition by changing Ĥ into
>>>> Ĥx.
>>>
>>> When did you first post about H^x?
> 
> I'd appreciate an answer to this.
> 
>>> And H^x does not alter the problem definition at all.  It remains the
>>> problem of determining if a computation halts or not.  Nor does it alter
>>> the theorem at all -- it's still a theorem not matter what other
>>> machines you hypothesise.
>>
>> It simply removes extraneous complexity making it more difficult for
>> people to follow my reasoning. It is only because I totally eliminate
>> every trace of Fred Brooks inessential complexity that it is possible
>> for me to correctly refute these otherwise enormously complex
>> problems.
> 
> No, it means you are no longer talking about the proof.  I'm pretty sure
> now that this is because you can see the inevitable end.  You must talk
> about something else now, and H^x is as good a anything.
> 
>>> <snip>
>>>> Because every TMD needs its own TM / Input pair (As I said
>>>> in March 11, 2017 @ 3:13 PM in comp.theory) every HP proof
>>>> is inherently infinitely recursive.
>>>
>>> You don't know what every HP proof does.  Have you, for example, read
>>> Turing's original proof?  Do you know Radó's proof via the busy beaver
>>> function?  What about Chaitin's proof?  Did you even read theorem 11.3 in
>>> Linz?  The existence of a halting decider would contradict it.
>>
>> I have to keep a single-minded focus that it 1000-fold more focused
>> than typical human beings have. I meant all of the conventional
>> proofs.
> 
> You don't know all of the conventional proofs either, do you?
> 
>>> There is (for most people) an easy way to see why what you say is
>>> nonsense.  Nothing in your "inherently infinitely recursive" argument
>>> specifically applies to a halting decider.  There are lots of properties
>>> of computations that /are/ decidable and from such a decider, D, (one
>>> that really exists this time) we can make D' just like we construct H'
>>> from a hypothetical halt decider, and from that we can make D^ like we
>>> make H^.  Linz's HP proof then just asks what
>>>
>>>     H^ [H^]
>>>
>>> does, and we can do the same for any other decider, D.  I.e., we can ask
>>> what
>>
>> Yes and it does something that no one else in the world ever noticed
>> that it does.
> 
> You used to claim that but you've stopped saying anything about what H^
> does.  I suspect because you've seen what it does.  Anyway, by all means
> go back to trying to say that H^ does what you recently claimed.


I have to change my conversational style for people that must read my
words fifty times before they notice what I said. I stopped talking to
some of these people.

You know that every halt decider must have two inputs right?
Yes or no?

You also know that conventionally another machine is specified
that takes one input and copies it and then evaluates halting
for this pair as it input pair?
Yes or No?

You also know that every TMD requires it own input pair
Yes or No?

If you said Yes, Yes, Yes, then you should be able to see
that the input to any machine so defined is infinitely recursive.

I will keep a single minded focus on this one point with you until
you either understand and agree or prove that truth is not your goal.

> 
>>>     D^ [D^]
>>>
>>> does.  If the first is "inherently infinitely recursive", why isn't the
>>> second?  But the corresponding existence question -- the existence of
>>> such a decider -- would be answered by you (I hope) quite differently
>>> because it could be explicitly written out.
>>>
>>
>> I would have to see the TM definition of D^ before I have any idea what
>> you are talking about.
> 
> Yes, that's a shame.  I don't think all other readers would have that
> problem.
> 
>> H [Ĥ] [Ĥ] every TMD in the infinitely recursive sequence specifies
>> an infinitely recursive sequence.
>>
>> Likewise with Ĥ [Ĥ] [Ĥ]
> 
> Neither of these crop up in the proof.  Why have you written these
> computations down?
> 
>> Likewise with H [Ĥx] [Ĥx]
> 
> Irrelevant.  You recently conceded that H^ (behaving like H') must
> always finish in finite time (you called it "breaking out of debug mode"
> because I don't think you can imagine any other mode of operation) and
> that was a problem.  You saw that the result follows immediately from
> the "trace equations" you've been writing unless you can find some
> distraction.  That's what H^x is -- an irrelevant distraction.
> 
> A new distraction (see the other thread) is that you are not even
> talking about the halting problem.
> 


-- 
*∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *

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


#172656

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-14 02:41 +0000
Message-ID<87wozgcmyd.fsf@bsb.me.uk>
In reply to#172643
Pete Olcott <Pete@NoEmail.address> writes:
<snip>
> I have to change my conversational style for people that must read my
> words fifty times before they notice what I said. I stopped talking to
> some of these people.
>
> You know that every halt decider must have two inputs right?
> Yes or no?

No.

> You also know that conventionally another machine is specified
> that takes one input and copies it and then evaluates halting
> for this pair as it input pair?
> Yes or No?

No.

> You also know that every TMD requires it own input pair
> Yes or No?

No.

> If you said Yes, Yes, Yes, then you should be able to see
> that the input to any machine so defined is infinitely recursive.
>
> I will keep a single minded focus on this one point with you until
> you either understand and agree or prove that truth is not your goal.

Asking for yes/no answers can be a problem because you have to know
exactly what you are asking.  If you want to know why my answers are
correct, ask for more than one-word answers.

You ignored most of my questions.  Can you at least say which problem
you are talking about -- the halting problem or the PO-halting problem?
It really matters.

<snip>
-- 
Ben.

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


#172667

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-13 22:34 -0600
Message-ID<9fednZxACvbAIR7HnZ2dnUU7-LvNnZ2d@giganews.com>
In reply to#172656
On 2/13/2018 8:41 PM, Ben Bacarisse wrote:
> Pete Olcott <Pete@NoEmail.address> writes:
> <snip>
>> I have to change my conversational style for people that must read my
>> words fifty times before they notice what I said. I stopped talking to
>> some of these people.
>>
>> You know that every halt decider must have two inputs right?
>> Yes or no?
> 
> No.
> 
>> You also know that conventionally another machine is specified
>> that takes one input and copies it and then evaluates halting
>> for this pair as it input pair?
>> Yes or No?
> 
> No.
> 
>> You also know that every TMD requires it own input pair
>> Yes or No?
> 
> No.
> 
>> If you said Yes, Yes, Yes, then you should be able to see
>> that the input to any machine so defined is infinitely recursive.
>>
>> I will keep a single minded focus on this one point with you until
>> you either understand and agree or prove that truth is not your goal.
> 
> Asking for yes/no answers can be a problem because you have to know
> exactly what you are asking.  If you want to know why my answers are
> correct, ask for more than one-word answers.
> 
> You ignored most of my questions.  Can you at least say which problem
> you are talking about -- the halting problem or the PO-halting problem?
> It really matters.
> 
> <snip>
> 

I am talking about the actual halting problem not the published
misconception. Unless and until you justify your answers I
will have no basis to determine whether or not you are a Troll
or a Truth seeker.

-- 
*∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *

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


#172675

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-14 05:29 +0000
Message-ID<87mv0ccf6a.fsf@bsb.me.uk>
In reply to#172667
Pete Olcott <Pete@NoEmail.address> writes:

> On 2/13/2018 8:41 PM, Ben Bacarisse wrote:
>> Pete Olcott <Pete@NoEmail.address> writes:
>> <snip>
>>> I have to change my conversational style for people that must read my
>>> words fifty times before they notice what I said. I stopped talking to
>>> some of these people.
>>>
>>> You know that every halt decider must have two inputs right?
>>> Yes or no?
>>
>> No.

TM's take only one input -- a single string.

>>> You also know that conventionally another machine is specified
>>> that takes one input and copies it and then evaluates halting
>>> for this pair as it input pair?
>>> Yes or No?
>>
>> No.

The machine constructed in the proof you don't understand does not
evaluate anything.  I know this is probably a made-up term but the word
means something in the this context and I am fed up with tip-toeing
round you word-bombs.

Also, in a proper proof it does not just copy the input.  I won't write
out the details of a proper proof but you can find good ones in books
other than Linz.

>>> You also know that every TMD requires it own input pair
>>> Yes or No?
>>
>> No.

There is no "every" TMD and no TMD requires anything.  You don't know
what H^ does from state qx onwards.  Your objection is based on a
unwarranted assumption.

>>> If you said Yes, Yes, Yes, then you should be able to see
>>> that the input to any machine so defined is infinitely recursive.
>>>
>>> I will keep a single minded focus on this one point with you until
>>> you either understand and agree or prove that truth is not your goal.
>>
>> Asking for yes/no answers can be a problem because you have to know
>> exactly what you are asking.  If you want to know why my answers are
>> correct, ask for more than one-word answers.
>>
>> You ignored most of my questions.  Can you at least say which problem
>> you are talking about -- the halting problem or the PO-halting problem?
>> It really matters.
>>
>> <snip>
>
> I am talking about the actual halting problem not the published
> misconception.

So do you accept the proof as it relates to the published problem?  If
not, why not?

The PO-halting problem is neither interesting nor the actual halting
problem.  You don't get to redefine terms like this.  Doing so is almost
the hallmark of a crank.

> Unless and until you justify your answers I
> will have no basis to determine whether or not you are a Troll
> or a Truth seeker.

I have added explanations (you could have asked for them at the time).

Here is my yes/no question.  Please give a yes/no answer but do explain
if your answer is no.  Do you accept that every finite string has a
correct yes/no answer to the question: does the string encode a TM and
input pair such that the TM would halt when run with that input?

-- 
Ben.

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


#172683

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-14 00:22 -0600
Message-ID<eMudnReDQ_4wSB7HnZ2dnUU7-LvNnZ2d@giganews.com>
In reply to#172675
On 2/13/2018 11:29 PM, Ben Bacarisse wrote:
> Pete Olcott <Pete@NoEmail.address> writes:
> 
>> On 2/13/2018 8:41 PM, Ben Bacarisse wrote:
>>> Pete Olcott <Pete@NoEmail.address> writes:
>>> <snip>
>>>> I have to change my conversational style for people that must read my
>>>> words fifty times before they notice what I said. I stopped talking to
>>>> some of these people.
>>>>
>>>> You know that every halt decider must have two inputs right?
>>>> Yes or no?
>>>
>>> No.
> 
> TM's take only one input -- a single string.

If you want to get that literal they don't even take one
string, they only have a single tape with an initial configuration.

The abstraction of halt decider is defined to take two strings though
so you waffle on this as you have countlessly accused me of waffling.

> 
>>>> You also know that conventionally another machine is specified
>>>> that takes one input and copies it and then evaluates halting
>>>> for this pair as it input pair?
>>>> Yes or No?
>>>
>>> No.
> 
> The machine constructed in the proof you don't understand does not
> evaluate anything.  I know this is probably a made-up term but the word
> means something in the this context and I am fed up with tip-toeing
> round you word-bombs.
> 
This merely shows your lack of knowledge of math terms.
What computer science term would you use to define the
sequence of state transitions that it makes on the basis
of the specified state transitions that its TMD would make?

Deciding halting of its own tape interpreted to have the
semantic meaning of a TMD that would halt on its input?

> Also, in a proper proof it does not just copy the input.  I won't write
> out the details of a proper proof but you can find good ones in books
> other than Linz.

I would just say that you are wrong on this until you show otherwise.

> 
>>>> You also know that every TMD requires it own input pair
>>>> Yes or No?
>>>
>>> No.
> 
> There is no "every" TMD and no TMD requires anything.  You don't know
> what H^ does from state qx onwards.  Your objection is based on a
> unwarranted assumption.
If we assume that it is a halt decider then in necessarily
does a (David Hilbert formalist proof from its input to its
final states on the basis of interpreting its input as a
pair of finite strings such that the first one might possibly
specify a TMD) AKA it does a debug trace on its input.

> 
>>>> If you said Yes, Yes, Yes, then you should be able to see
>>>> that the input to any machine so defined is infinitely recursive.
>>>>
>>>> I will keep a single minded focus on this one point with you until
>>>> you either understand and agree or prove that truth is not your goal.
>>>
>>> Asking for yes/no answers can be a problem because you have to know
>>> exactly what you are asking.  If you want to know why my answers are
>>> correct, ask for more than one-word answers.
>>>
>>> You ignored most of my questions.  Can you at least say which problem
>>> you are talking about -- the halting problem or the PO-halting problem?
>>> It really matters.
>>>
>>> <snip>
>>
>> I am talking about the actual halting problem not the published
>> misconception.
> 
> So do you accept the proof as it relates to the published problem?  If
> not, why not?
> 

It does not even have a way to syntactically represent its own gap
in deductive logical inference, thus it is totally unaware of the
possibility that this gap could effect the semantic validity
of its proof. Thus is not not even bother to look for an error
that it is not aware is possible.

To put it in simpler words its reasoning is incorrect and it is
blind to the fact that its reasoning is incorrect.

> The PO-halting problem is neither interesting nor the actual halting
> problem.  You don't get to redefine terms like this.  Doing so is almost
> the hallmark of a crank.

So if a syntactic formalism has deductive logical inference gaps
in the reasoning that is specifies the fact that its reasoning
is incorrect should be ignored because it does not know any better?

> 
>> Unless and until you justify your answers I
>> will have no basis to determine whether or not you are a Troll
>> or a Truth seeker.
> 
> I have added explanations (you could have asked for them at the time).

I did not expect you to try so hard to waffle so much.
It seemed like you were starting to get reasonable.

> 
> Here is my yes/no question.  Please give a yes/no answer but do explain
> if your answer is no.  Do you accept that every finite string has a
> correct yes/no answer to the question: does the string encode a TM and
> input pair such that the TM would halt when run with that input?
> 

No.
Because that is exactly the same as asking me does every closed WFF
of formal language definitely evaluate to exactly one of: True or False.

The answer to that is No. There are numerous instances of
syntactically correct closed WFF that do not evaluate to
True or False because these WFF are semantically incorrect.

In fact we can formally define semantically incorrect closed WFF X
to be the case where X does not evaluate to exactly one of True or False.

Copyright Pete Olcott 2018

-- 
*∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *

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


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

Back to top | Article view | sci.logic


csiph-web