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 3 of 16 — ← Prev page 1 2 [3] 4 5 … 16  Next page →


#170437

FromGeorge Greene <greeneg@email.unc.edu>
Date2018-01-18 09:41 -0800
Message-ID<66e1ef71-4a4f-49b9-a249-659ce2ef227e@googlegroups.com>
In reply to#170423
On Thursday, January 18, 2018 at 5:09:24 AM UTC-5, Ben Bacarisse wrote:
> But if you think that any amount of telling PO the truth will make the
> slightest difference, then you don't understand what's going on here.

You may be right. I thought there was hope for him when he started
actually working through the Linz example -- most cranks can't be bothered --
but he couldn't hold on.  I was really shocked to learn that he had experience
as a programmer.  The only think he is stumbling over now is that TMs "should" be thought of as algorithms rather than hardware.  If he actually has experience in the field to know the difference then that should be easy to clarify.
But I am having no luck.

> Peter's objection is religious, and religious beliefs trump all forms of
> logic and explanation.  If you are posting to "cure" (your word) PO then
> you too are wasting as much time as he is.  Post to correct the record
> or to leave a clear explanation of the issues (you often do that very
> well, though I find the SHOUTING unhelpful).  Post if you simply enjoy
> countering silly or confused arguments, but it's not reasonable to post
> with the hope of changing his beliefs.

I'm locked into belief-changing mode generally.  I live in a state that
went narrowly for Trump.  I am in this mode all the time.  Most of the time
I know not to waste my effort on cranks -- I told people for a decade just
NOT to engage with Nam Nguyen PERIOD -- but here I thought PO was making some
progress since he was using a real textbook and was actually trying to understand it.  We RARELY get THAT far with these case.


> > the thread keeps splitting and I keep
> > getting dissed as bad-cop.
> 
> I don't know why you think that.


Well I feel much better now.
But once vs. Nam you quoted some people who had lost patience with him
and cussed him out and pointed out that you yourself had never been *that*
vitriolic or personally insulting.  Sometimes I get frustrated when I have focused something onto a good point or issue and the crank decides to engage other LESS-pointed questioners *instead*.



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


#170613

Frombursejan@gmail.com
Date2018-01-20 06:41 -0800
Message-ID<ab122e04-c919-4233-b5f4-fe114954ef72@googlegroups.com>
In reply to#170305
If you define states S and a transition relation R,
then you can define the transitive closure:

   R : S x S

   R*(x,y) :<=> exists z1,..,zn (R(x,z1) /\ ... /\ R(zn,y))

Now if you define some end states E, then it is relatively
easy to define halt as follows:

   E : S

   H(x) :<=> exists y (R*(x,y) /\ E(y))

Thats the usual way to go in program semantics. S is
the program state, and R is some step semantics.

You can also apply it to turing machines...

Am Dienstag, 16. Januar 2018 22:03:21 UTC+1 schrieb Newberry:
> Just what does the “halt()” predicate mean? Well, I think it is pretty 
> clear. Everybody knows what it means for a program [or a Turing Machine 
> etc.] to halt. We can execute any program in an emulator B(p, q). When 
> program p halts on input q we say it halts. When B(p, q) halts we can 
> consider it a verification of the fact that p(q) halts and say that it 
> is TRUE that p halts on q. But observe that when B() does not halt it 
> SAYS NOTHING. In particular it does NOT say that p does not halt. A 
> program can say something only when it halts. If it does not halt it has 
> been effectively GAGGED.
> 
> What does it mean though that a program does NOT halt? Well, it is the 
> opposite of halting, right? But if a program has not halted yet how do 
> we know that it never will? Now it is getting more problematic! But 
> there are some possibilities. We can assume without a loss  of 
> generality that every program operates on natural numbers, and perhaps 
> we can transform every program into the following canonical form:
> program(q) {
>      while(true) {
>          do stuff
>          if (condition == 1) then exit
>      }
> }
> 
> We have transformed the halting problem into a question of arithmetic! 
> If we can prove that condition is never equal to 1 then we know that 
> program(q) does not halt. How clever! So assume that we have a program 
> A(p, q) that does just that, and halts when p(q) does not. We can 
> consider it as a verification of the fact that p(q) does NOT halt, and 
> say that it is FALSE that p(q) halts.
> 
> But as you were about to remind me there is a problem. How about A(A, 
> A)? The same thing we said about B() applies to A(); when A() does not 
> halt it says NOTHING. So, in particular, it cannot say that it does NOT 
> halt on its own input!! Oh, well.
> 
> So now what? Suppose that A(B, A) halts, and says that B(A) does not 
> halt. Again, if B(A) does not halt it says nothing, and in particular it 
> does NOT say that A() does not halt. Our B() has been gagged! Since we 
> interpreted B(A) *halting* as it is *true* that A() halts we can 
> interpret B(A) *not halting* as it is NOT TRUE that A() halts. Nothing 
> prevents us from constructing a program A() that proves the equivalent 
> of ~(Ex)Px whenever PA does so PLUS decides that B(A) does not halt. Of 
> course, if our logic were bivalent we would have ~T() = F(), and a 
> contradiction would rapidly follow. But if our logic is NOT bivalent, if 
> ~T() # F(), that is, if ~T is a wider concept than F the contradiction 
> vanishes.
> 
> This result is the same as the solution of the Liar Paradox
>      “This sentence is not true” is not true
> The sentence in double quotes is ~T & ~F, in fact it is meaningless. The 
> outer sentence is true.

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


#170616

Frombursejan@gmail.com
Date2018-01-20 06:43 -0800
Message-ID<6a84d9ee-fe48-4f2e-ad42-d4db9b70c875@googlegroups.com>
In reply to#170613
The below definition of the transitive closure
is kind of informally, but it can be done more
formally. Typical it is done inductive. Some
approaches also use co-induction. All approaches

use circularity, in then sense that some recursion
is involved. But its typically monotonic aka positive,
so there is no danger that this circularity already
defines some inconsistency when we define R.

Am Samstag, 20. Januar 2018 15:41:03 UTC+1 schrieb burs...@gmail.com:
> If you define states S and a transition relation R,
> then you can define the transitive closure:
> 
>    R : S x S
> 
>    R*(x,y) :<=> exists z1,..,zn (R(x,z1) /\ ... /\ R(zn,y))
> 
> Now if you define some end states E, then it is relatively
> easy to define halt as follows:
> 
>    E : S
> 
>    H(x) :<=> exists y (R*(x,y) /\ E(y))
> 
> Thats the usual way to go in program semantics. S is
> the program state, and R is some step semantics.
> 
> You can also apply it to turing machines...
> 
> Am Dienstag, 16. Januar 2018 22:03:21 UTC+1 schrieb Newberry:
> > Just what does the “halt()” predicate mean? Well, I think it is pretty 
> > clear. Everybody knows what it means for a program [or a Turing Machine 
> > etc.] to halt. We can execute any program in an emulator B(p, q). When 
> > program p halts on input q we say it halts. When B(p, q) halts we can 
> > consider it a verification of the fact that p(q) halts and say that it 
> > is TRUE that p halts on q. But observe that when B() does not halt it 
> > SAYS NOTHING. In particular it does NOT say that p does not halt. A 
> > program can say something only when it halts. If it does not halt it has 
> > been effectively GAGGED.
> > 
> > What does it mean though that a program does NOT halt? Well, it is the 
> > opposite of halting, right? But if a program has not halted yet how do 
> > we know that it never will? Now it is getting more problematic! But 
> > there are some possibilities. We can assume without a loss  of 
> > generality that every program operates on natural numbers, and perhaps 
> > we can transform every program into the following canonical form:
> > program(q) {
> >      while(true) {
> >          do stuff
> >          if (condition == 1) then exit
> >      }
> > }
> > 
> > We have transformed the halting problem into a question of arithmetic! 
> > If we can prove that condition is never equal to 1 then we know that 
> > program(q) does not halt. How clever! So assume that we have a program 
> > A(p, q) that does just that, and halts when p(q) does not. We can 
> > consider it as a verification of the fact that p(q) does NOT halt, and 
> > say that it is FALSE that p(q) halts.
> > 
> > But as you were about to remind me there is a problem. How about A(A, 
> > A)? The same thing we said about B() applies to A(); when A() does not 
> > halt it says NOTHING. So, in particular, it cannot say that it does NOT 
> > halt on its own input!! Oh, well.
> > 
> > So now what? Suppose that A(B, A) halts, and says that B(A) does not 
> > halt. Again, if B(A) does not halt it says nothing, and in particular it 
> > does NOT say that A() does not halt. Our B() has been gagged! Since we 
> > interpreted B(A) *halting* as it is *true* that A() halts we can 
> > interpret B(A) *not halting* as it is NOT TRUE that A() halts. Nothing 
> > prevents us from constructing a program A() that proves the equivalent 
> > of ~(Ex)Px whenever PA does so PLUS decides that B(A) does not halt. Of 
> > course, if our logic were bivalent we would have ~T() = F(), and a 
> > contradiction would rapidly follow. But if our logic is NOT bivalent, if 
> > ~T() # F(), that is, if ~T is a wider concept than F the contradiction 
> > vanishes.
> > 
> > This result is the same as the solution of the Liar Paradox
> >      “This sentence is not true” is not true
> > The sentence in double quotes is ~T & ~F, in fact it is meaningless. The 
> > outer sentence is true.

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


#170618

Frombursejan@gmail.com
Date2018-01-20 06:50 -0800
Message-ID<51e78a5a-bf40-48ed-b494-ed5c5d6f7b8c@googlegroups.com>
In reply to#170616
In DC Proof one could easily do these things,
if it had term structures and term induction.
For example Peano could be defined as a term 
structure, and the corresponding term induction, 

is the usual Peano induction. Here is a Haskell 
notation for the terms involved in Peano:

data Peano = Zero
           | Succ Peano.

The derived induction would be:

    P(Zero) /\ forall x:Peano (P(x) -> P(Succ x)) 
          -> forall x:Peano P(x)

Maybe term structures can be also modelled
in set theory, the foundation of DC proof.
We could define, here is an informal sketch,
the Peano term structure as follows recursively:

   Peano = <0>
         | <1,Peano>

Where <...> is a n-tupel in set theory. The
automatically derived induction axiom would
then be as follows:

   P(<0>) /\ forall x:Peano (P(x) -> P(<1,x>)) 
          -> forall x:Peano P(x)$

There could be some more general principles
in place, that drive all this. Like justifying
the derived induction axioms itself. As candidate
for a general principle could be:

   Inductive = Universal

Am Samstag, 20. Januar 2018 15:44:01 UTC+1 schrieb burs...@gmail.com:
> The below definition of the transitive closure
> is kind of informally, but it can be done more
> formally. Typical it is done inductive. Some
> approaches also use co-induction. All approaches
> 
> use circularity, in then sense that some recursion
> is involved. But its typically monotonic aka positive,
> so there is no danger that this circularity already
> defines some inconsistency when we define R.
> 
> Am Samstag, 20. Januar 2018 15:41:03 UTC+1 schrieb burs...@gmail.com:
> > If you define states S and a transition relation R,
> > then you can define the transitive closure:
> > 
> >    R : S x S
> > 
> >    R*(x,y) :<=> exists z1,..,zn (R(x,z1) /\ ... /\ R(zn,y))
> > 
> > Now if you define some end states E, then it is relatively
> > easy to define halt as follows:
> > 
> >    E : S
> > 
> >    H(x) :<=> exists y (R*(x,y) /\ E(y))
> > 
> > Thats the usual way to go in program semantics. S is
> > the program state, and R is some step semantics.
> > 
> > You can also apply it to turing machines...
> > 
> > Am Dienstag, 16. Januar 2018 22:03:21 UTC+1 schrieb Newberry:
> > > Just what does the “halt()” predicate mean? Well, I think it is pretty 
> > > clear. Everybody knows what it means for a program [or a Turing Machine 
> > > etc.] to halt. We can execute any program in an emulator B(p, q). When 
> > > program p halts on input q we say it halts. When B(p, q) halts we can 
> > > consider it a verification of the fact that p(q) halts and say that it 
> > > is TRUE that p halts on q. But observe that when B() does not halt it 
> > > SAYS NOTHING. In particular it does NOT say that p does not halt. A 
> > > program can say something only when it halts. If it does not halt it has 
> > > been effectively GAGGED.
> > > 
> > > What does it mean though that a program does NOT halt? Well, it is the 
> > > opposite of halting, right? But if a program has not halted yet how do 
> > > we know that it never will? Now it is getting more problematic! But 
> > > there are some possibilities. We can assume without a loss  of 
> > > generality that every program operates on natural numbers, and perhaps 
> > > we can transform every program into the following canonical form:
> > > program(q) {
> > >      while(true) {
> > >          do stuff
> > >          if (condition == 1) then exit
> > >      }
> > > }
> > > 
> > > We have transformed the halting problem into a question of arithmetic! 
> > > If we can prove that condition is never equal to 1 then we know that 
> > > program(q) does not halt. How clever! So assume that we have a program 
> > > A(p, q) that does just that, and halts when p(q) does not. We can 
> > > consider it as a verification of the fact that p(q) does NOT halt, and 
> > > say that it is FALSE that p(q) halts.
> > > 
> > > But as you were about to remind me there is a problem. How about A(A, 
> > > A)? The same thing we said about B() applies to A(); when A() does not 
> > > halt it says NOTHING. So, in particular, it cannot say that it does NOT 
> > > halt on its own input!! Oh, well.
> > > 
> > > So now what? Suppose that A(B, A) halts, and says that B(A) does not 
> > > halt. Again, if B(A) does not halt it says nothing, and in particular it 
> > > does NOT say that A() does not halt. Our B() has been gagged! Since we 
> > > interpreted B(A) *halting* as it is *true* that A() halts we can 
> > > interpret B(A) *not halting* as it is NOT TRUE that A() halts. Nothing 
> > > prevents us from constructing a program A() that proves the equivalent 
> > > of ~(Ex)Px whenever PA does so PLUS decides that B(A) does not halt. Of 
> > > course, if our logic were bivalent we would have ~T() = F(), and a 
> > > contradiction would rapidly follow. But if our logic is NOT bivalent, if 
> > > ~T() # F(), that is, if ~T is a wider concept than F the contradiction 
> > > vanishes.
> > > 
> > > This result is the same as the solution of the Liar Paradox
> > >      “This sentence is not true” is not true
> > > The sentence in double quotes is ~T & ~F, in fact it is meaningless. The 
> > > outer sentence is true.

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


#170624

FromPete Olcott <Pete@NoEmail.address>
Date2018-01-20 09:12 -0600
Message-ID<Ztqdndulx9fmwf7HnZ2dnUU7-S3NnZ2d@giganews.com>
In reply to#170613
On 1/20/2018 8:41 AM, bursejan@gmail.com wrote:
> If you define states S and a transition relation R,
> then you can define the transitive closure:
> 
>     R : S x S
> 
>     R*(x,y) :<=> exists z1,..,zn (R(x,z1) /\ ... /\ R(zn,y))
> 
> Now if you define some end states E, then it is relatively
> easy to define halt as follows:
> 
>     E : S
> 
>     H(x) :<=> exists y (R*(x,y) /\ E(y))
> 
> Thats the usual way to go in program semantics. S is
> the program state, and R is some step semantics.
> 

Looks good to me.

> You can also apply it to turing machines...
> 
It might make sense to apply it to finite string Turing Machine Descriptions instead.

-- 
         *Γ ⊢_FS A ≡ ∃Γ ⊆ FS Provable(Γ, A)* // MTT notational conventions
*∀X True(X) ≡ ∃Γ ⊆ MTT ∧ Axioms(Γ) Provable(Γ, X) * // MTT Truth Predicate

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


#170625

Frombursejan@gmail.com
Date2018-01-20 07:18 -0800
Message-ID<e74889fb-d2f4-4931-a246-e23ccc06e13d@googlegroups.com>
In reply to#170624
Well take an UT (universal turing machine), with two
tapes input, one tape is the code of another turing
machine x, and the other tape is the input y to the 

other turing machine, so we might have and easily show

  R_UT*(<x,y>,<z,_>) <=> R_x*(y,z)

by a simple induction. And then by a diagonal argument 
for R_UT* we can very quickly show that it will 
not always halt:

   ~forall t H_UT(t)

Am Samstag, 20. Januar 2018 16:13:05 UTC+1 schrieb Pete Olcott:
> > You can also apply it to turing machines...
> > 
> It might make sense to apply it to finite string Turing Machine Descriptions instead.
> 
> -- 
>          *Γ ⊢_FS A ≡ ∃Γ ⊆ FS Provable(Γ, A)* // MTT notational conventions
> *∀X True(X) ≡ ∃Γ ⊆ MTT ∧ Axioms(Γ) Provable(Γ, X) * // MTT Truth Predicate

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


#170627

Frombursejan@gmail.com
Date2018-01-20 07:20 -0800
Message-ID<169debe1-c669-4661-a401-30da588d3fa5@googlegroups.com>
In reply to#170625
Well maybe the correctness statement is 
a little bit more complicated than only:

   R_UT*(<x,y>,<z,_>) <=> R_x*(y,z)

We might want to skip a few steps of the 
R_UT to see a step of R_x, but I guess 

this can be managed in a formal proof.

Am Samstag, 20. Januar 2018 16:18:43 UTC+1 schrieb burs...@gmail.com:
> Well take an UT (universal turing machine), with two
> tapes input, one tape is the code of another turing
> machine x, and the other tape is the input y to the 
> 
> other turing machine, so we might have and easily show
> 
>   R_UT*(<x,y>,<z,_>) <=> R_x*(y,z)
> 
> by a simple induction. And then by a diagonal argument 
> for R_UT* we can very quickly show that it will 
> not always halt:
> 
>    ~forall t H_UT(t)
> 
> Am Samstag, 20. Januar 2018 16:13:05 UTC+1 schrieb Pete Olcott:
> > > You can also apply it to turing machines...
> > > 
> > It might make sense to apply it to finite string Turing Machine Descriptions instead.
> > 
> > -- 
> >          *Γ ⊢_FS A ≡ ∃Γ ⊆ FS Provable(Γ, A)* // MTT notational conventions
> > *∀X True(X) ≡ ∃Γ ⊆ MTT ∧ Axioms(Γ) Provable(Γ, X) * // MTT Truth Predicate

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


#170628

Frombursejan@gmail.com
Date2018-01-20 07:23 -0800
Message-ID<89e1418b-7f84-436f-abd4-7e8799699a53@googlegroups.com>
In reply to#170627
I guess you can transform each n-tape turing machine
into a 1-tape turing machine. Anyway here is a 1-tape UT:

https://en.wikipedia.org/wiki/Universal_Turing_machine#Introduction

Am Samstag, 20. Januar 2018 16:20:22 UTC+1 schrieb burs...@gmail.com:
> Well maybe the correctness statement is 
> a little bit more complicated than only:
> 
>    R_UT*(<x,y>,<z,_>) <=> R_x*(y,z)
> 
> We might want to skip a few steps of the 
> R_UT to see a step of R_x, but I guess 
> 
> this can be managed in a formal proof.
> 
> Am Samstag, 20. Januar 2018 16:18:43 UTC+1 schrieb burs...@gmail.com:
> > Well take an UT (universal turing machine), with two
> > tapes input, one tape is the code of another turing
> > machine x, and the other tape is the input y to the 
> > 
> > other turing machine, so we might have and easily show
> > 
> >   R_UT*(<x,y>,<z,_>) <=> R_x*(y,z)
> > 
> > by a simple induction. And then by a diagonal argument 
> > for R_UT* we can very quickly show that it will 
> > not always halt:
> > 
> >    ~forall t H_UT(t)
> > 
> > Am Samstag, 20. Januar 2018 16:13:05 UTC+1 schrieb Pete Olcott:
> > > > You can also apply it to turing machines...
> > > > 
> > > It might make sense to apply it to finite string Turing Machine Descriptions instead.
> > > 
> > > -- 
> > >          *Γ ⊢_FS A ≡ ∃Γ ⊆ FS Provable(Γ, A)* // MTT notational conventions
> > > *∀X True(X) ≡ ∃Γ ⊆ MTT ∧ Axioms(Γ) Provable(Γ, X) * // MTT Truth Predicate

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


#170631

FromPete Olcott <Pete@NoEmail.address>
Date2018-01-20 10:22 -0600
Message-ID<QuCdnVK1w4Yv8f7HnZ2dnUU7-aPNnZ2d@giganews.com>
In reply to#170628
On 1/20/2018 9:23 AM, bursejan@gmail.com wrote:
> I guess you can transform each n-tape turing machine
> into a 1-tape turing machine. Anyway here is a 1-tape UT:
> 
> https://en.wikipedia.org/wiki/Universal_Turing_machine#Introduction
> 

It is simplest to transform the entire halting problem proof into higher
order logic with self-reference semantics, expressed as a (David Hilbert,
thus finite string) mathematical formalism.

H <assign alias operator> Halts(H)
    is equivalent to
Liar_Paradox <assign alias operator> ~True(Liar_Paradox)
    is equivalent to
G <assign alias operator> ~Provable(G)

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

http://liarparadox.org/index.php/2017/12/08/concise-formalization-of-the-liar-paradox/

Copyright 2004, 2016, 2017, 2018 Pete Olcott

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


#170928

FromGeorge Greene <greeneg@email.unc.edu>
Date2018-01-24 13:12 -0800
Message-ID<01220a44-a13b-4816-9fe6-e6fd07fad5bc@googlegroups.com>
In reply to#170631
On Saturday, January 20, 2018 at 11:22:17 AM UTC-5, Pete Olcott wrote:
> On 1/20/2018 9:23 AM, bursejan@gmail.com wrote:
> > I guess you can transform each n-tape turing machine
> > into a 1-tape turing machine. Anyway here is a 1-tape UT:
> > 
> > https://en.wikipedia.org/wiki/Universal_Turing_machine#Introduction
> > 
> 
> It is simplest to transform the entire halting problem proof into higher
> order logic 
It IS NOT, dumbass.
The whole thing IS first-order, INHERENTLY.
Going to higher order can't possibly make ANYthing simpler.
Higher-order logic doesn't even have a definable consequence relation!
There is THEREFORE philosophical ANGST over whether 2nd-order logic
EVEN QUALIFIES AS "logic" AT ALL!

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


#170936

Frompeteolcott <peterolcott2@gmail.com>
Date2018-01-24 16:31 -0800
Message-ID<8f672eb6-34c8-4f73-ad85-d436d6e82805@googlegroups.com>
In reply to#170928
On Wednesday, January 24, 2018 at 3:12:51 PM UTC-6, George Greene wrote:
> On Saturday, January 20, 2018 at 11:22:17 AM UTC-5, Pete Olcott wrote:
> > On 1/20/2018 9:23 AM, wrote:
> > > I guess you can transform each n-tape turing machine
> > > into a 1-tape turing machine. Anyway here is a 1-tape UT:
> > > 
> > > https://en.wikipedia.org/wiki/Universal_Turing_machine#Introduction
> > > 
> > 
> > It is simplest to transform the entire halting problem proof into higher
> > order logic 
> It IS NOT, dumbass.
> The whole thing IS first-order, INHERENTLY.
> Going to higher order can't possibly make ANYthing simpler.

It gets rid of 46 definitions that Jim refers to that are required
by the incompleteness proof to simulate a consequence relation 
in arithmetic. 

> Higher-order logic doesn't even have a definable consequence relation!

OK fine then I will only work in my own HOL with self-reference
semantics and ignore these arbitrary limitations of exiting 
conventions. 

> There is THEREFORE philosophical ANGST over whether 2nd-order logic
> EVEN QUALIFIES AS "logic" AT ALL!

The second-order sentence ∀P∀x(x ∈ P ∨ x ∉ P) says that for every unary relation (or set) P of individuals, and every individual x, either x is in P or it is not (this is the principle of bivalence).

Everything either is or is not a member of some specific set. 

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


#170964

FromGeorge Greene <greeneg@email.unc.edu>
Date2018-01-24 19:57 -0800
Message-ID<7ee2c029-0d06-47d3-95ce-46b977405722@googlegroups.com>
In reply to#170936
On Wednesday, January 24, 2018 at 7:32:01 PM UTC-5, peteolcott wrote:
> On Wednesday, January 24, 2018 at 3:12:51 PM UTC-6, George Greene wrote:
> > The whole thing IS first-order, INHERENTLY.
> > Going to higher order can't possibly make ANYthing simpler.
> 
> It gets rid of 46 definitions that Jim refers to that are required
> by the incompleteness proof to simulate a consequence relation 

To simulate A FIRST-order consequence relation!
At the cost OF NOT having A SECOND-order consequence relation!!

> in arithmetic. 

That is oversimplified.  "true" arithmetic IS INHERENTLY second-order --
EVEN FIRST-order "true" arithmetic is inherently second-order -- first-
order logic ISN'T POWERFUL ENOUGH to do "true" first-order arithmetic.
It approximates it and winds up with non-standard models in addition
to the true/standard/intended one.
WE AREN'T TALKING ABOUT "true" arithmetic, at first or any other order.

WE ARE TALKING ABOUT LOGIC AND TURING MACHINES.
There is a very real sense in which these CAN'T DO "true" arithemtic or
higher-order logic, NOT EVEN in higher-order programming languages --
the consequence relation is too complicated.

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


#170967

Frompeteolcott <peterolcott2@gmail.com>
Date2018-01-24 20:15 -0800
Message-ID<56b7bfd8-113c-47d0-983c-a9bac99785bc@googlegroups.com>
In reply to#170964
On Wednesday, January 24, 2018 at 9:57:07 PM UTC-6, George Greene wrote:
> On Wednesday, January 24, 2018 at 7:32:01 PM UTC-5, peteolcott wrote:
> > On Wednesday, January 24, 2018 at 3:12:51 PM UTC-6, George Greene wrote:
> > > The whole thing IS first-order, INHERENTLY.
> > > Going to higher order can't possibly make ANYthing simpler.
> > 
> > It gets rid of 46 definitions that Jim refers to that are required
> > by the incompleteness proof to simulate a consequence relation 
> 
> To simulate A FIRST-order consequence relation!
> At the cost OF NOT having A SECOND-order consequence relation!!
> 
> > in arithmetic. 
> 
> That is oversimplified.  "true" arithmetic IS INHERENTLY second-order --
> EVEN FIRST-order "true" arithmetic is inherently second-order -- first-
> order logic ISN'T POWERFUL ENOUGH to do "true" first-order arithmetic.
> It approximates it and winds up with non-standard models in addition
> to the true/standard/intended one.
> WE AREN'T TALKING ABOUT "true" arithmetic, at first or any other order.
> 
> WE ARE TALKING ABOUT LOGIC AND TURING MACHINES.
> There is a very real sense in which these CAN'T DO "true" arithemtic or
> higher-order logic, NOT EVEN in higher-order programming languages --
> the consequence relation is too complicated.

What are your credentials George? 
I have a BS in computer science,
two software engineering patents
and 30 years as a software engineer. 

I am not singling you out I am going to ask 
every respondent this same question. 

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


#171062

FromGeorge Greene <greeneg@email.unc.edu>
Date2018-01-25 20:21 -0800
Message-ID<a535f018-e241-4947-947f-988ba6441393@googlegroups.com>
In reply to#170967
On Wednesday, January 24, 2018 at 11:15:16 PM UTC-5, peteolcott wrote:
> What are your credentials George? 
> I have a BS in computer science,

My GOD, it DOES NOT SHOW.

Seriously, how can we have been disagreeing about what a TM is if you have
a BS in Computer Science and you have experience as a software engineer?
YOU FUCKING *KNOW* what a PROCEDURE is!  You know what A SUBROUTINE is!
YOU KNOW that you can write a program that calls a subroutine, and that
that subroutine can be written as calling another subroutine!
YOU KNOW the DIFFERENCE between software and hardware!  So what THE FUCK
were we arguing about??

Where IN THE HELL did you GET a B.S. in Computer Science FROM withOUT
learning what a Turing Machine was??  How in THE HELL could you read Linz
without comprehending it?  Why didn't you just REMEMBER the treatment of
TMs FROM YOUR UNDERGRADUATE COURSE??

My B.A. is in Philosophy.  It was an AI-related program in the
philosophy of logic and formal systems.  Shortly after I got it,
it was re-accredited as a B.S. in Symbolic Systems.  That was basically
Stanford's undergraduate Comp.Sci. degree, for a while -- it didn't
have an official B.S. in Comp.Sci. while I was there.

I got an M.S.C.S from UNC in 1995 but failed to finish the doctoral program
there.  Somehow I don't see you being so open with places and dates.

Seriously, why are you always trying to talk about semantics and type theory
and things YOU DON'T have credentials in??  If you had just stuck to a
CS perspective, YOU COULD HAVE SAVED YOURSELF A LOT OF PUBLIC HUMILIATION!
Seriously,
as it stands,
you come off stupid.

> two software engineering patents
> and 30 years as a software engineer.

Again, for you to actually BE a software engineer
AND NOT be able to tell that

H(m,i): If m halts on i then return true else return false
H'(m,i): If H(m,i) then loop else return true
H^(s): If H'(s,s) then return true
Let w^=the code-string of H^ (wherefore w^ SHOULD have been called h^)
H^(h^) is paradoxical

was what WAS HAPPENING ON P.154 OF LINZ
is just beyond comprehensible.
Forest?
Trees?
WHAT WERE YOU STUDYING when and MORE IMPORTANTLY WHERE
ever you studied it??


The whole notion of patenting software says more about how little those
people know about the field than it does about the merit of anything
patented.  The people who were actually good at this basically knew better.
Maybe you should google RMS person.

> I am not singling you out I am going to ask 
> every respondent this same question.

It's not relevant.  It's sad that you think it might be.
I mean, unless you think we are all (not just you and me)
suffering from wild mis-estimates of people's basic skills
when they confront paradigms that are new&strange to them.
But again, how is TM supposed to be strange to somebody WITH a
B.S. in Comp.Sci.?  How is the notion that one program CAN BE PART OF
another, or can call another, supposed to be strange?
W
T
F
IS WRONG WITH
YOU???


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


#171068

Frompeteolcott <peterolcott2@gmail.com>
Date2018-01-25 21:29 -0800
Message-ID<c6eef96c-1099-4626-8593-361aa705b734@googlegroups.com>
In reply to#171062
On Thursday, January 25, 2018 at 10:21:23 PM UTC-6, George Greene wrote:
> On Wednesday, January 24, 2018 at 11:15:16 PM UTC-5, peteolcott wrote:
> > What are your credentials George? 
> > I have a BS in computer science,
> 
> My GOD, it DOES NOT SHOW.
> 
> Seriously, how can we have been disagreeing about what a TM is if you have
> a BS in Computer Science and you have experience as a software engineer?
> YOU FUCKING *KNOW* what a PROCEDURE is!  You know what A SUBROUTINE is!
> YOU KNOW that you can write a program that calls a subroutine, and that
> that subroutine can be written as calling another subroutine!
> YOU KNOW the DIFFERENCE between software and hardware!  So what THE FUCK
> were we arguing about??
> 
> Where IN THE HELL did you GET a B.S. in Computer Science FROM withOUT
> learning what a Turing Machine was??  How in THE HELL could you read Linz
> without comprehending it?  Why didn't you just REMEMBER the treatment of
> TMs FROM YOUR UNDERGRADUATE COURSE??
> 

I know what a TM is. That you think TM's can do function calls
and return values does not necessarily mean that you do not know
what they are. You could just be talking a a higher level of
abstraction. I found that talking at a higher level of abstraction
hides key details so I quit doing it. 

> My B.A. is in Philosophy.  It was an AI-related program in the
> philosophy of logic and formal systems.  Shortly after I got it,
> it was re-accredited as a B.S. in Symbolic Systems.  That was basically
> Stanford's undergraduate Comp.Sci. degree, for a while -- it didn't
> have an official B.S. in Comp.Sci. while I was there.
> 
> I got an M.S.C.S from UNC in 1995 but failed to finish the doctoral program
> there.  Somehow I don't see you being so open with places and dates.
> 

1986 UNO Omaha BSBA and all the Computer Science courses required for a BSCS.

> Seriously, why are you always trying to talk about semantics and type theory
> and things YOU DON'T have credentials in??  If you had just stuck to a
> CS perspective, YOU COULD HAVE SAVED YOURSELF A LOT OF PUBLIC HUMILIATION!
> Seriously,
> as it stands,
> you come off stupid.
> 
> > two software engineering patents
> > and 30 years as a software engineer.
> 
> Again, for you to actually BE a software engineer
> AND NOT be able to tell that
> 
> H(m,i): If m halts on i then return true else return false
> H'(m,i): If H(m,i) then loop else return true
> H^(s): If H'(s,s) then return true
> Let w^=the code-string of H^ (wherefore w^ SHOULD have been called h^)
> H^(h^) is paradoxical
> 

Those less formal presentations lose key details. A TM does not
actually ever return anything. TM's not do function calls either. 

If you have the credentials that you claim then you should
be able to understand and agree that I summed up the essence
of Linz up to and including the YELLOW highlighted portion. 
The following Link also has a link to the Linz pages: (318-320). 

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

100% complete and total understanding of the above Linz summary 
portion of the link is a mandatory prerequisite to any further elaboration. 

There are no function calls, return values, and there is only
a single TM named Ĥ. I won't say that Ben directly lied about 
this he was simply trying to speak at your higher level abstraction.

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


#171069

FromGeorge Greene <greeneg@email.unc.edu>
Date2018-01-25 21:38 -0800
Message-ID<d7ce091d-1758-4de3-9c7e-4d15872351dc@googlegroups.com>
In reply to#171068
On Friday, January 26, 2018 at 12:29:23 AM UTC-5, peteolcott wrote:
> I know what a TM is.

No, dumbass, YOU REALLY don't.  You don't even know whether it is software
or hardware.

> That you think TM's can do function calls
> and return values does not necessarily mean that you do not know
> what they are.

NOTHING can mean that *I* don't know what they are.
It is really sad that you still have not figured out who is talking up
or down to WHOM here yet.

> You could just be talking a a higher level of abstraction.

Not exactly.  That is respectable, though, so we are making progress.

> I found that talking at a higher level of abstraction
> hides key details so I quit doing it. 

That is not what is happening here.  You are having the exact opposite
problem.  The implementation detail of TMs IS NOT relevant. There are
MANY OTHER paradigms THAT ARE EQUIVALENT (lambda-calculus, semi-Thue systems, Post canonical systems, 3RD-GENERATION PROGRAMMING LANGUAGES, AD NAUSEAM).

The way in which people actually talk about TMs and use them REQUIRES them to
be identified WITH THEIR PRORGAMS, with THEIR SOFTWARE -- the "Delta",
the transition-matrix, IS THE ONLY thing happening.  EVERYthing else is
ancillary or subordinate, INCLUDING THE HARDWARE -- ESPECIALLY including
the actual "machine".  NOBODY EVER talks about the scenario where one and
the same Turing "Machine" starts out being programmed with ONE delta/program
and later somehow gets that one erased and gets re-loaded with another --
if it's another PROGRAM then it's another TM.  The "machine" IS IDENTIFIED
with the prorgam.  IT IS possible for one TM to run/behave-like/emulate
one program in one case and another in another, but that is NOT because this
one TM can have 2 different programs -- it IS because this 1 TM's ONE program
IS AN EMULATOR that parses its input and DECIDES what OTHER progrm to emulate ON THE BASIS of its input.


> 
> > My B.A. is in Philosophy.  It was an AI-related program in the
> > philosophy of logic and formal systems.  Shortly after I got it,
> > it was re-accredited as a B.S. in Symbolic Systems.  That was basically
> > Stanford's undergraduate Comp.Sci. degree, for a while -- it didn't
> > have an official B.S. in Comp.Sci. while I was there.
> > 
> > I got an M.S.C.S from UNC in 1995 but failed to finish the doctoral program
> > there.  Somehow I don't see you being so open with places and dates.
> > 
> 
> 1986 UNO Omaha BSBA and all the Computer Science courses required for a BSCS.
> 
> > Seriously, why are you always trying to talk about semantics and type theory
> > and things YOU DON'T have credentials in??  If you had just stuck to a
> > CS perspective, YOU COULD HAVE SAVED YOURSELF A LOT OF PUBLIC HUMILIATION!
> > Seriously,
> > as it stands,
> > you come off stupid.
> > 
> > > two software engineering patents
> > > and 30 years as a software engineer.
> > 
> > Again, for you to actually BE a software engineer
> > AND NOT be able to tell that
> > 
> > H(m,i): If m halts on i then return true else return false
> > H'(m,i): If H(m,i) then loop else return true
> > H^(s): If H'(s,s) then return true
> > Let w^=the code-string of H^ (wherefore w^ SHOULD have been called h^)
> > H^(h^) is paradoxical
> > 
> 
> Those less formal presentations lose key details. A TM does not
> actually ever return anything. TM's not do function calls either. 
> 
> If you have the credentials that you claim then you should
> be able to understand and agree that I summed up the essence
> of Linz up to and including the YELLOW highlighted portion. 
> The following Link also has a link to the Linz pages: (318-320). 
> 
> http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/ 
> 
> 100% complete and total understanding of the above Linz summary 
> portion of the link is a mandatory prerequisite to any further elaboration. 
> 
> There are no function calls, return values, and there is only
> a single TM named Ĥ. I won't say that Ben directly lied about 
> this he was simply trying to speak at your higher level abstraction.

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


#171073

Frompeteolcott <peterolcott2@gmail.com>
Date2018-01-25 21:59 -0800
Message-ID<2ebd6be2-9a46-457c-86f1-70dad86c2ab9@googlegroups.com>
In reply to#171069
On Thursday, January 25, 2018 at 11:38:40 PM UTC-6, George Greene wrote:
> On Friday, January 26, 2018 at 12:29:23 AM UTC-5, peteolcott wrote:
> > I know what a TM is.
> 
> No, dumbass, YOU REALLY don't.  You don't even know whether it is software
> or hardware.
> 

You are the stupid one here George, everyone knows that a TM (as 
originally envisioned by Alan Turing) was a man with a paper and
pencil.

> > That you think TM's can do function calls
> > and return values does not necessarily mean that you do not know
> > what they are.
> 
> NOTHING can mean that *I* don't know what they are.
> It is really sad that you still have not figured out who is talking up
> or down to WHOM here yet.
> 
> > You could just be talking a a higher level of abstraction.
> 
> Not exactly.  That is respectable, though, so we are making progress.
> 
> > I found that talking at a higher level of abstraction
> > hides key details so I quit doing it. 
> 
> That is not what is happening here.  You are having the exact opposite
> problem.  The implementation detail of TMs IS NOT relevant. There are
> MANY OTHER paradigms THAT ARE EQUIVALENT (lambda-calculus, semi-Thue systems, Post canonical systems, 3RD-GENERATION PROGRAMMING LANGUAGES, AD NAUSEAM).

I am not talking about an implementation detail. I am talking  about 
the required process for becoming logically justifiably 100% certain 
that reasoning does not have even a single microscopic gap. 

Would you bet your soul that the Halting Problem proof is correct? 

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


#171130

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-01-27 00:37 +0000
Message-ID<871sicnnlp.fsf@bsb.me.uk>
In reply to#171073
peteolcott <peterolcott2@gmail.com> writes:

> On Thursday, January 25, 2018 at 11:38:40 PM UTC-6, George Greene wrote:
>> On Friday, January 26, 2018 at 12:29:23 AM UTC-5, peteolcott wrote:
>> > I know what a TM is.
>> 
>> No, dumbass, YOU REALLY don't.  You don't even know whether it is software
>> or hardware.
>> 
>
> You are the stupid one here George, everyone knows that a TM (as 
> originally envisioned by Alan Turing) was a man with a paper and
> pencil.

No.  You can't have read Turing's 1936 paper because he's clear about
what a-machines (the main subject of the paper) are.  Don't you think it
would have been worth a quick check before posting?

And even if *you* are sure about this, how can you be so sure that
"everyone knows" this false thing?

By the way, you could do worse than actually read Turing's paper.  You
would see a form of TM that might surprise you, along with a different
proof of the result that we know call the halting theorem.  And as a
bonus, the paper outlines a proof that the lambda calculus is
computationally equivalent to (what we now call) Turning machines.

<snip>
> Would you bet your soul that the Halting Problem proof is correct?

There are few theorems about which I am more certain.  It has been
extensively studied, verified, and proved in a variety of different ways
(for example, Turing's original proof is rarely seen these days).
What's more, the result dovetails with a body on knowledge that I don't
think you are aware of.  Finally, it's one of the simplest theorems,
with one of the simplest proofs.  It can usually be covered in just one
lecture with another set aside for the inevitable "can't a machine just
detect the fact that it's being 'tricked'" objection.  Yes, every year
someone would come up with a version of your "pathological
self-reference" (the kind from a decade ago -- I'm not sure what you
mean by that phrase nowadays).

-- 
Ben.

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


#171142

Frompeteolcott <peterolcott2@gmail.com>
Date2018-01-26 20:21 -0800
Message-ID<b2209cc8-8a16-475f-a3ad-d021310b3163@googlegroups.com>
In reply to#171130
On Friday, January 26, 2018 at 6:37:25 PM UTC-6, Ben Bacarisse wrote:
> peteolcott writes:
> 
> > On Thursday, January 25, 2018 at 11:38:40 PM UTC-6, George Greene wrote:
> >> On Friday, January 26, 2018 at 12:29:23 AM UTC-5, peteolcott wrote:
> >> > I know what a TM is.
> >> 
> >> No, dumbass, YOU REALLY don't.  You don't even know whether it is software
> >> or hardware.
> >> 
> >
> > You are the stupid one here George, everyone knows that a TM (as 
> > originally envisioned by Alan Turing) was a man with a paper and
> > pencil.
> 
> No.  You can't have read Turing's 1936 paper because he's clear about
> what a-machines (the main subject of the paper) are.  Don't you think it
> would have been worth a quick check before posting?
> 
> And even if *you* are sure about this, how can you be so sure that
> "everyone knows" this false thing?
> 
> By the way, you could do worse than actually read Turing's paper.  You
> would see a form of TM that might surprise you, along with a different
> proof of the result that we know call the halting theorem.  And as a
> bonus, the paper outlines a proof that the lambda calculus is
> computationally equivalent to (what we now call) Turning machines.
> 

Only untyped Lambda Calculus though. I spent a week studying it
from four different sources. It apparently is the language of 
semantic subatomic compositionality considering it is TM complete 
with only four lines of BNF. 

> <snip>
> > Would you bet your soul that the Halting Problem proof is correct?
> 
> There are few theorems about which I am more certain.  It has been
> extensively studied, verified, and proved in a variety of different ways
> (for example, Turing's original proof is rarely seen these days).
> What's more, the result dovetails with a body on knowledge that I don't
> think you are aware of.  Finally, it's one of the simplest theorems,
> with one of the simplest proofs.  It can usually be covered in just one
> lecture with another set aside for the inevitable "can't a machine just
> detect the fact that it's being 'tricked'" objection.  Yes, every year
> someone would come up with a version of your "pathological
> self-reference" (the kind from a decade ago -- I'm not sure what you
> mean by that phrase nowadays).
> 
> -- 
> Ben.

Yet you never bothered to actually trace through the steps of my new 
insight so you essentially have nothing more than presumption that I
am incorrect. I spent 3000 hours on this since 2004 and just noticed 
the infinitely recursive essence the first time on August 2016. On
my post back then I simply thought it was a mistake by Linz. 

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

The trace of the evaluation sequence gets stuck in infinite recursion 
after state (qx), thus never makes it to state of (qy) or ((qn)). 
An evaluation sequence is not the same as an execution trace. 

If we go straight out David Hilbert on this: 
    "statements of mathematics and logic can be 
    considered to be statements about the consequences 
    of certain string manipulation rules." 

Then we have this Math version of the Halting Problem 
∃x ∈ Turing_Machine_Descriptions 
∀y ∈ Turing_Machine_Descriptions 
If we go straight out David Hilbert on this: 
    "statements of mathematics and logic can be 
    considered to be statements about the consequences 
    of certain string manipulation rules." 

Then we have this Math version of the Halting Problem 
∃x ∈ Turing_Machine_Descriptions 
∀y ∈ Turing_Machine_Descriptions 
∀z ∈ Finite_Strings Halts(x, y, z) 

What are you credentials Ben?
George says that he has a MSCS. 

I have 30 years as a software engineer, two software patents
a BSBA degree and all of the computer science courses for a CS degree. 
I graduated from UNO Omaha in 1986. I took one graduate course in CS. 
My GPA on graduation was 3.51 on a 4.0 scale. 

https://patents.google.com/patent/US7046848B1/en?oq=7046848 
https://patents.google.com/patent/US9171207B1/en?oq=9171207++

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


#171145

Fromgrahamcooper7@gmail.com
Date2018-01-26 20:38 -0800
Message-ID<b51ee3ea-cb04-4cd0-8d1e-57d812e5cc66@googlegroups.com>
In reply to#171142
On Saturday, January 27, 2018 at 3:21:34 PM UTC+11, peteolcott wrote:
> On Friday, January 26, 2018 at 6:37:25 PM UTC-6, Ben Bacarisse wrote:
> > peteolcott writes:
> > 
> > > On Thursday, January 25, 2018 at 11:38:40 PM UTC-6, George Greene wrote:
> > >> On Friday, January 26, 2018 at 12:29:23 AM UTC-5, peteolcott wrote:
> > >> > I know what a TM is.
> > >> 
> > >> No, dumbass, YOU REALLY don't.  You don't even know whether it is software
> > >> or hardware.
> > >> 
> > >
> > > You are the stupid one here George, everyone knows that a TM (as 
> > > originally envisioned by Alan Turing) was a man with a paper and
> > > pencil.
> > 
> > No.  You can't have read Turing's 1936 paper because he's clear about
> > what a-machines (the main subject of the paper) are.  Don't you think it
> > would have been worth a quick check before posting?
> > 
> > And even if *you* are sure about this, how can you be so sure that
> > "everyone knows" this false thing?
> > 
> > By the way, you could do worse than actually read Turing's paper.  You
> > would see a form of TM that might surprise you, along with a different
> > proof of the result that we know call the halting theorem.  And as a
> > bonus, the paper outlines a proof that the lambda calculus is
> > computationally equivalent to (what we now call) Turning machines.
> > 
> 
> Only untyped Lambda Calculus though. I spent a week studying it
> from four different sources. It apparently is the language of 
> semantic subatomic compositionality considering it is TM complete 
> with only four lines of BNF. 
> 
> > <snip>
> > > Would you bet your soul that the Halting Problem proof is correct?
> > 
> > There are few theorems about which I am more certain.  It has been
> > extensively studied, verified, and proved in a variety of different ways
> > (for example, Turing's original proof is rarely seen these days).
> > What's more, the result dovetails with a body on knowledge that I don't
> > think you are aware of.  Finally, it's one of the simplest theorems,
> > with one of the simplest proofs.  It can usually be covered in just one
> > lecture with another set aside for the inevitable "can't a machine just
> > detect the fact that it's being 'tricked'" objection.  Yes, every year
> > someone would come up with a version of your "pathological
> > self-reference" (the kind from a decade ago -- I'm not sure what you
> > mean by that phrase nowadays).
> > 
> > -- 
> > Ben.
> 
> Yet you never bothered to actually trace through the steps of my new 
> insight so you essentially have nothing more than presumption that I
> am incorrect. I spent 3000 hours on this since 2004 and just noticed 
> the infinitely recursive essence the first time on August 2016. On
> my post back then I simply thought it was a mistake by Linz. 
> 
> http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/
> 
> The trace of the evaluation sequence gets stuck in infinite recursion 
> after state (qx), thus never makes it to state of (qy) or ((qn)). 
> An evaluation sequence is not the same as an execution trace. 
> 
> If we go straight out David Hilbert on this: 
>     "statements of mathematics and logic can be 
>     considered to be statements about the consequences 
>     of certain string manipulation rules." 



that diagram just shows that H' CAN_BE_CONSTRUCTED


The fact it goes into a LOOP (or gets the wrong answer) means H is impossible

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


Page 3 of 16 — ← Prev page 1 2 [3] 4 5 … 16  Next page →

Back to top | Article view | sci.logic


csiph-web