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


Groups > sci.math > #511927 > unrolled thread

Is the set { 1, 0 } equal to the set { 0, 1 } ?

Started byTimothy Golden <timbandtech@gmail.com>
First post2021-02-11 08:37 -0800
Last post2021-04-14 15:44 -0700
Articles 20 on this page of 176 — 24 participants

Back to article view | Back to sci.math


Contents

  Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-02-11 08:37 -0800
    Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-02-11 16:49 +0000
      Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-02-11 09:06 -0800
        Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-02-11 09:54 -0800
        Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Peter <peterxpercival@hotmail.com> - 2021-02-11 19:20 +0000
          Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Gus Gassmann <horand.gassmann@gmail.com> - 2021-02-11 12:37 -0800
            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-02-12 16:38 -0800
          Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Peter <peterxpercival@hotmail.com> - 2021-02-11 21:08 +0000
          Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-02-14 16:27 -0800
        Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-02-11 21:47 +0000
          Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-02-12 04:45 -0800
            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-02-12 05:05 -0800
              Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Peter <peterxpercival@hotmail.com> - 2021-02-12 20:21 +0000
                Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-02-12 16:01 -0800
                  Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Sergio <invalid@invalid.com> - 2021-02-12 21:30 -0600
                  Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Peter <peterxpercival@hotmail.com> - 2021-02-13 17:57 +0000
                    Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-02-14 16:09 -0800
                      Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Python <python@python.invalid> - 2021-02-15 01:25 +0100
                        Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-02-14 16:28 -0800
                          Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? FromTheRafters <erratic@nomail.afraid.org> - 2021-02-14 19:54 -0500
                          Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Peter <peterxpercival@hotmail.com> - 2021-02-15 16:52 +0000
            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-02-12 15:33 +0000
              Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-02-12 08:41 -0800
              Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-02-12 08:45 -0800
                Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-02-12 17:45 +0000
                  Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-02-14 16:07 -0800
              Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-02-14 15:03 -0800
            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Sergio <invalid@invalid.com> - 2021-02-12 21:28 -0600
              Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Wade Brewer <wadb@ultnatfs.ca> - 2021-02-13 07:35 +0000
                Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-02-13 05:11 -0800
                  Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Sergio <invalid@invalid.com> - 2021-02-14 13:14 -0600
                    Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-02-14 14:57 -0800
                      Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Sergio <invalid@invalid.com> - 2021-02-14 21:32 -0600
                        Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-02-15 04:21 -0800
                Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Sergio <invalid@invalid.com> - 2021-02-14 12:51 -0600
                  Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Burl Scheibe <bursc@ehwaac.mx> - 2021-02-16 16:29 +0000
                    Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-02-17 09:52 -0800
                      Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Eddy Scolaro <edsc2@nncasve.cl> - 2021-02-17 19:11 +0000
                        Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Sergio <invalid@invalid.com> - 2021-03-03 11:42 -0600
                          Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Hants Wiggins <hants2@yahoo.com> - 2021-03-03 18:09 +0000
                            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Sergio <invalid@invalid.com> - 2021-03-03 12:24 -0600
                              Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Hants Wiggins <hants2@yahoo.com> - 2021-03-03 19:30 +0000
                                Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Sergio <invalid@invalid.com> - 2021-03-03 14:39 -0600
                                Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-03-19 05:34 -0700
                                  Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Brice Leclaire <blaine42@yahoo.com> - 2021-03-19 13:05 +0000
    Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Peter <peterxpercival@hotmail.com> - 2021-02-11 19:02 +0000
    Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Jim Carrubba <jmic4@wlan2iot.co> - 2021-02-11 20:12 +0000
      Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-02-12 08:40 -0800
    Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? "mitchr...@gmail.com" <mitchrae3323@gmail.com> - 2021-02-11 12:37 -0800
    Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? FromTheRafters <erratic@nomail.afraid.org> - 2021-02-11 16:58 -0500
    Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-02-17 10:21 -0800
      Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Peter <peterxpercival@hotmail.com> - 2021-02-17 19:46 +0000
        Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-02-17 12:31 -0800
          Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Peter <peterxpercival@hotmail.com> - 2021-02-17 20:54 +0000
            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-02-18 05:14 -0800
            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-03-03 09:09 -0800
              Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Peter <peterxpercival@hotmail.com> - 2021-03-03 17:42 +0000
                Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-03-19 06:20 -0700
                  Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Sergio <invalid@invalid.com> - 2021-03-19 12:23 -0500
    Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-03-19 06:39 -0700
      Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-03-19 09:32 -0700
        Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Gus Gassmann <horand.gassmann@gmail.com> - 2021-03-19 10:28 -0700
          Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-03-19 16:30 -0700
            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? FromTheRafters <erratic@nomail.afraid.org> - 2021-03-20 04:54 -0400
              Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? "mitchr...@gmail.com" <mitchrae3323@gmail.com> - 2021-03-20 10:51 -0700
                Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-03-20 16:07 -0700
                  Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Sergio <invalid@invalid.com> - 2021-03-20 20:11 -0500
            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Gus Gassmann <horand.gassmann@gmail.com> - 2021-03-30 06:18 -0700
              Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? FromTheRafters <erratic@nomail.afraid.org> - 2021-03-30 10:23 -0400
              Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-03-30 10:03 -0700
                Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Gus Gassmann <horand.gassmann@gmail.com> - 2021-03-30 10:27 -0700
                  Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-03-30 16:56 -0700
                    Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Gus Gassmann <horand.gassmann@gmail.com> - 2021-03-31 05:21 -0700
                      Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-03-31 05:44 -0700
                        Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Gus Gassmann <horand.gassmann@gmail.com> - 2021-03-31 06:06 -0700
                      Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-02 04:47 -0700
                        Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? FromTheRafters <erratic@nomail.afraid.org> - 2021-04-02 10:02 -0400
                          Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-02 08:05 -0700
                            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Sergio <invalid@invalid.com> - 2021-04-02 10:32 -0500
                            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-04-05 21:57 -0700
                              Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-06 05:22 -0700
                                Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Peter <peterxpercival@hotmail.com> - 2021-04-06 14:36 +0100
                                  Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Peter <peterxpercival@hotmail.com> - 2021-04-06 15:16 +0100
                                    Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-07 06:08 -0700
                                      Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Peter <peterxpercival@hotmail.com> - 2021-04-07 14:46 +0100
                                Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-04-06 22:13 -0700
                                Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-04-07 22:19 -0700
                        Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Gus Gassmann <horand.gassmann@gmail.com> - 2021-04-02 09:07 -0700
                          Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-03 05:38 -0700
                            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? FromTheRafters <erratic@nomail.afraid.org> - 2021-04-03 09:15 -0400
                              Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-03 06:41 -0700
                                Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? FromTheRafters <erratic@nomail.afraid.org> - 2021-04-03 11:07 -0400
                                  Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-04 06:00 -0700
                                    Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? FromTheRafters <erratic@nomail.afraid.org> - 2021-04-04 09:58 -0400
                                      Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-04 07:16 -0700
                                        Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Sergio <invalid@invalid.com> - 2021-04-04 13:49 -0500
                                          Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-04 13:35 -0700
                                            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Sergio <invalid@invalid.com> - 2021-04-04 21:42 -0500
                                      Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-04 07:35 -0700
                                        Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Sergio <invalid@invalid.com> - 2021-04-04 13:50 -0500
                                          Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-04 13:41 -0700
                                            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Sergio <invalid@invalid.com> - 2021-04-04 21:29 -0500
                              Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-03 06:42 -0700
                            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Gus Gassmann <horand.gassmann@gmail.com> - 2021-04-04 08:08 -0700
                              Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-04 10:07 -0700
                                Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Peter <peterxpercival@hotmail.com> - 2021-04-05 00:24 +0100
                                  Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-04 21:22 -0700
                                    Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Peter <peterxpercival@hotmail.com> - 2021-04-05 12:46 +0100
                                      Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-05 10:42 -0700
                                        Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Sergio <invalid@invalid.com> - 2021-04-05 13:19 -0500
                                        Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Peter <peterxpercival@hotmail.com> - 2021-04-05 19:20 +0100
                                        Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Peter <peterxpercival@hotmail.com> - 2021-04-05 19:36 +0100
                                        Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Peter <peterxpercival@hotmail.com> - 2021-04-05 19:49 +0100
                                          Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-05 16:29 -0700
                                            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Sergio <invalid@invalid.com> - 2021-04-15 10:19 -0500
                                              Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Vittorio Santiago-Rodriguez <vitsa118@ucla2ancw.ca> - 2021-04-16 12:26 +0000
                                            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? FromTheRafters <erratic@nomail.afraid.org> - 2021-04-15 11:52 -0400
                                        Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? FromTheRafters <erratic@nomail.afraid.org> - 2021-04-05 14:51 -0400
                                          Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-05 16:02 -0700
                                            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? FromTheRafters <erratic@nomail.afraid.org> - 2021-04-06 14:24 -0400
                                        Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? FredJeffries <fredjeffries@gmail.com> - 2021-04-06 08:29 -0700
                                          Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-07 06:22 -0700
                                            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? FromTheRafters <erratic@nomail.afraid.org> - 2021-04-07 09:51 -0400
                                              Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Peter <peterxpercival@hotmail.com> - 2021-04-07 15:09 +0100
                                                Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? FromTheRafters <erratic@nomail.afraid.org> - 2021-04-07 10:21 -0400
                                                  Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Edkah Bearden <bdkah92@unirf4vs.cn> - 2021-04-07 14:30 +0000
                                                    Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? pyra tesonli <pyra.tesonli@gmail.com> - 2021-04-07 13:39 -0700
                                                      Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-07 14:30 -0700
                                                  Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Sergio <invalid@invalid.com> - 2021-04-07 17:29 -0500
                                              Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-07 15:18 -0700
                                                Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? FromTheRafters <erratic@nomail.afraid.org> - 2021-04-07 18:33 -0400
                                                  Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-08 05:48 -0700
                                                    Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? FromTheRafters <erratic@nomail.afraid.org> - 2021-04-08 09:06 -0400
                                                      Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-08 07:44 -0700
                                                        Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? FromTheRafters <erratic@nomail.afraid.org> - 2021-04-08 11:39 -0400
                                                          Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-08 13:59 -0700
                                                            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? FromTheRafters <erratic@nomail.afraid.org> - 2021-04-08 17:30 -0400
                                                            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Peter <peterxpercival@hotmail.com> - 2021-04-08 22:34 +0100
                                                              Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? FromTheRafters <erratic@nomail.afraid.org> - 2021-04-08 17:56 -0400
                                                          Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-09 07:59 -0700
                                                            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? FromTheRafters <erratic@nomail.afraid.org> - 2021-04-09 15:09 -0400
                                                              Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-10 05:38 -0700
                                                                Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? FromTheRafters <erratic@nomail.afraid.org> - 2021-04-10 09:22 -0400
                                                                  Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-11 04:50 -0700
                                                                    Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? FromTheRafters <erratic@nomail.afraid.org> - 2021-04-11 09:24 -0400
                                                                      Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? FromTheRafters <erratic@nomail.afraid.org> - 2021-04-11 09:34 -0400
                                                                      Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-11 07:33 -0700
                                                                        Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Peter <peterxpercival@hotmail.com> - 2021-04-11 16:14 +0100
                                                    Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-04-12 01:18 -0700
                                                      Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? michael Rodriguez <michael.michael.10302@gmail.com> - 2021-04-12 12:23 -0700
                                                        Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? michael Rodriguez <michael.michael.10302@gmail.com> - 2021-04-14 15:31 -0700
                                                          Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-16 14:09 -0700
                                                            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-04-18 21:53 -0700
                                          Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Sergio <invalid@invalid.com> - 2021-04-15 10:21 -0500
                                            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Vittorio Santiago-Rodriguez <vitsa118@ucla2ancw.ca> - 2021-04-16 12:01 +0000
                              Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-04 21:26 -0700
                            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-05 16:40 -0700
                Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-03-30 22:15 -0700
                  Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-03-31 05:39 -0700
                    Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-03-31 05:47 -0700
                    Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-04-05 21:54 -0700
        Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-03-21 23:26 -0700
          Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-03-24 03:57 -0700
            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-03-24 23:01 -0700
            Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Sergio <invalid@invalid.com> - 2021-03-29 08:55 -0500
              Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Jackie Pysczynski <jpy@iee2nc.cn> - 2021-03-29 16:03 +0000
                Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? michael Rodriguez <michael.michael.10302@gmail.com> - 2021-03-29 13:30 -0700
                  Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Sergio <invalid@invalid.com> - 2021-03-29 19:36 -0500
                  Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-03-30 05:46 -0700
    Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-03-28 16:48 -0700
      Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-03-28 22:36 -0700
      Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Jackie Pysczynski <jpy@iee2nc.cn> - 2021-03-29 10:57 +0000
    Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Man From a city with name Viljandi <ya12983@mail.com> - 2021-04-03 05:40 -0700
      Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Archie Thacker <arcth@uucwntsa.org> - 2021-04-03 16:44 +0000
        Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? Timothy Golden <timbandtech@gmail.com> - 2021-04-05 11:32 -0700
    Re: Is the set { 1, 0 } equal to the set { 0, 1 } ? "mitchr...@gmail.com" <mitchrae3323@gmail.com> - 2021-04-14 15:44 -0700

Page 8 of 9 — ← Prev page 1 2 3 4 5 6 7 [8] 9  Next page →


#517267

FromFromTheRafters <erratic@nomail.afraid.org>
Date2021-04-09 15:09 -0400
Message-ID<s4q8pv$1mqe$1@gioia.aioe.org>
In reply to#517251
Timothy Golden explained :
> On Thursday, April 8, 2021 at 11:39:27 AM UTC-4, FromTheRafters wrote:
>> Timothy Golden explained on 4/8/2021 :
>>> On Thursday, April 8, 2021 at 9:06:23 AM UTC-4, FromTheRafters wrote: 
>>>> Timothy Golden laid this down on his screen : 
>>>>> On Wednesday, April 7, 2021 at 6:33:39 PM UTC-4, FromTheRafters wrote: 
>>>>>> Timothy Golden used his or her keyboard to write : 
>>>>>>> On Wednesday, April 7, 2021 at 9:51:45 AM UTC-4, FromTheRafters wrote: 
>>>>>>>> Timothy Golden wrote : 
>>>>>>>>> On Tuesday, April 6, 2021 at 11:29:07 AM UTC-4, FredJeffries wrote: 
>>>>>>>>>>> I don't really see the point you are making. Especially where you 
>>>>>>>>>>> say  that { 0, 1 } 
>>>>>>>>>>> has no order. Clearly you passed the zero first, and the one 
>>>>>>>>>>> second.  The denial of order is in a different stance. It is 
>>>>>>>>>>> required that we  remove the order from this set in order for it to 
>>>>>>>>>>> become disordered.  Upon ensuring this disorderly conduct of the 
>>>>>>>>>>> set we will no longer be  able to provide reliable operations such 
>>>>>>>>>>> as union and intersection.  You see, to access the elements of your 
>>>>>>>>>>> set in a sensible fashion  you'd like a concept like Element 
>>>>>>>>>>> GetFirstElement() or even better  Element GetElement( int order ) 
>>>>>>>>>>> but these operations will not be  possible on a set which lacks 
>>>>>>>>>>> order. The best that you can have on  the disordered set is simply 
>>>>>>>>>>> Element GetElement()  and because the set is disordered you can get 
>>>>>>>>>>> the same element back  twice from this algorithm. There is no 
>>>>>>>>>>> looping through the element of  the set because by definition the 
>>>>>>>>>>> set lacks order. As far as I know,  the methods of generating the 
>>>>>>>>>>> disordered set access must be built  from an ordered set and not 
>>>>>>>>>>> the other way around. 
>>>>>>>>>> Tell us: When I scoop a cup of flour out of the bin in order to make 
>>>>>>>>>> some bread, which molecule of flour is the FIRST element of the set 
>>>>>>>>>> of  molecules in the measuring cup? 
>>>>>>>>> 
>>>>>>>>> No, Fred, I certainly am very concerned about this question of order 
>>>>>>>>> in  spacetime. However we are discussing simple set theory here where 
>>>>>>>>> we  define sets such as: S1 = { a, b, c, d } S2 = { a, c, d, e } 
>>>>>>>> Union commutes so you could think of this as S2 = A and S1 = B so A 
>>>>>>>> union B would be a set 
>>>>>>>> 
>>>>>>>> { } 
>>>>>>>> 
>>>>>>>> Containing the union of the two sets 
>>>>>>>> 
>>>>>>>> {{a,c,d,e}union{a,b,c,d}} 
>>>>>>>> 
>>>>>>>> Union is the elements of the elements, so lose the inner braces and 
>>>>>>>> the  union symbol. 
>>>>>>>> 
>>>>>>>> {a,c,d,e,a,b,c,d} is the result. Order doesn't matter and duplicates 
>>>>>>>> are ignored axiomatically so this set has a cardinality number 5. 
>>>>>>>> 
>>>>>>>> Not not computable, but I think they said computability is not needed, 
>>>>>>>> not that it is impossible. 
>>>>>>> 
>>>>>>> Well, maybe we have to focus on the intersection instead. If your 
>>>>>>> nonsense here does stand then the union is nearly a NOP. 
>>>>>> Union alone doesn't do what is expected, The 'result' has to be a set 
>>>>>> and as such must adhere to the axiomatic system which describes how 
>>>>>> sets work in relation to elements. The roster form's apparent order of 
>>>>>> listing elements is not to be taken as an order on the set and 
>>>>>> duplicates are ignored so that {a,c,b,d} and {b,c,a,d,c,d,d,a} are the 
>>>>>> same set. 
>>>>> 
>>>>> Then lets move on to the intersection, where computation will not take 
>>>>> the  argument of a NOP. 
>>>> NOPs are executed, set operations don't have to be. Fewer clock cycles 
>>>> are needed for union than for NOP. 
>>>> 
>>>> [...] 
>>> 
>>> Rafters you ordinarily are far more solid in your interpretation. You are 
>>> afraid to breach the intersection and are going to claim that the 
>>> intersection comes magically for free? No computation necessary? Please, 
>>> now,  when we ask a child to compute: { 0, 1, 2, 4 } Intersect { 0, 1, 5, 
>>> 6, 7,  8, 9 } are you going to tell me that the child gets their answer in 
>>> a way  that has no halting criteria? The halting problem is going to get 
>>> you, sir.
>> What, another strawman? Still, I'm only saying that "order" is not 
>> necessary in the idea of intersecting sets. I'm not saying computation 
>> is never necessary for obtaining desired results. 
>> 
>> https://en.wikipedia.org/wiki/Intersection_(set_theory)#/media/File:Venn_diagram_gr_la_ru.svg
>
> I do concede that the graphical representation is rather different than the 
> bracket notation. Yet as we see in the graphic it is as if the intersection 
> is pre-computed; not far away from your own interpretation. Next, lets put 
> these very alphabets in circles at random and find out what the probability 
> is of arriving at that intersection.

Again, the claim isn't that this particular intersection set lacks 
order. There are many possible orders. Rather, it is about sets written 
in roster form do not take the inherent 'order' of the listing as being 
an order on the set. It could be one possible ordering though if one 
wanted to have an ordered set.

Consider that (red, blue, green) and (red, green, blue) are two 
orderings of these elements. One by associated EM frequency, one by 
length of character string. They both come from the same set {blue, 
red, green} which has no order imposed. Notice the braces as opposed to 
the parentheses, we have a set and two ordered triplets.

Getting away from the abstraction and into the actual arithmetic needed 
to arrange things to do a more orderly sorting process is a good and 
worthy goal. Whether the given sets are precumputed using an order or 
computed  when the intersection is taken or not is not relevant to how 
the roster form works. The abstraction has to take in the idea that 
order is not implied in the roster form. The setbuilder form often uses 
order to describe a set (essentially generating them in a natural 
order) but the set itself is just the the elements in a container.

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


#517327

FromTimothy Golden <timbandtech@gmail.com>
Date2021-04-10 05:38 -0700
Message-ID<416ea8dc-9c10-4971-9821-af6c4989163en@googlegroups.com>
In reply to#517267
On Friday, April 9, 2021 at 3:10:04 PM UTC-4, FromTheRafters wrote:
> Timothy Golden explained :
> > On Thursday, April 8, 2021 at 11:39:27 AM UTC-4, FromTheRafters wrote: 
> >> Timothy Golden explained on 4/8/2021 : 
> >>> On Thursday, April 8, 2021 at 9:06:23 AM UTC-4, FromTheRafters wrote: 
> >>>> Timothy Golden laid this down on his screen : 
> >>>>> On Wednesday, April 7, 2021 at 6:33:39 PM UTC-4, FromTheRafters wrote: 
> >>>>>> Timothy Golden used his or her keyboard to write : 
> >>>>>>> On Wednesday, April 7, 2021 at 9:51:45 AM UTC-4, FromTheRafters wrote: 
> >>>>>>>> Timothy Golden wrote : 
> >>>>>>>>> On Tuesday, April 6, 2021 at 11:29:07 AM UTC-4, FredJeffries wrote: 
> >>>>>>>>>>> I don't really see the point you are making. Especially where you 
> >>>>>>>>>>> say that { 0, 1 } 
> >>>>>>>>>>> has no order. Clearly you passed the zero first, and the one 
> >>>>>>>>>>> second. The denial of order is in a different stance. It is 
> >>>>>>>>>>> required that we remove the order from this set in order for it to 
> >>>>>>>>>>> become disordered. Upon ensuring this disorderly conduct of the 
> >>>>>>>>>>> set we will no longer be able to provide reliable operations such 
> >>>>>>>>>>> as union and intersection. You see, to access the elements of your 
> >>>>>>>>>>> set in a sensible fashion you'd like a concept like Element 
> >>>>>>>>>>> GetFirstElement() or even better Element GetElement( int order ) 
> >>>>>>>>>>> but these operations will not be possible on a set which lacks 
> >>>>>>>>>>> order. The best that you can have on the disordered set is simply 
> >>>>>>>>>>> Element GetElement() and because the set is disordered you can get 
> >>>>>>>>>>> the same element back twice from this algorithm. There is no 
> >>>>>>>>>>> looping through the element of the set because by definition the 
> >>>>>>>>>>> set lacks order. As far as I know, the methods of generating the 
> >>>>>>>>>>> disordered set access must be built from an ordered set and not 
> >>>>>>>>>>> the other way around. 
> >>>>>>>>>> Tell us: When I scoop a cup of flour out of the bin in order to make 
> >>>>>>>>>> some bread, which molecule of flour is the FIRST element of the set 
> >>>>>>>>>> of molecules in the measuring cup? 
> >>>>>>>>> 
> >>>>>>>>> No, Fred, I certainly am very concerned about this question of order 
> >>>>>>>>> in spacetime. However we are discussing simple set theory here where 
> >>>>>>>>> we define sets such as: S1 = { a, b, c, d } S2 = { a, c, d, e } 
> >>>>>>>> Union commutes so you could think of this as S2 = A and S1 = B so A 
> >>>>>>>> union B would be a set 
> >>>>>>>> 
> >>>>>>>> { } 
> >>>>>>>> 
> >>>>>>>> Containing the union of the two sets 
> >>>>>>>> 
> >>>>>>>> {{a,c,d,e}union{a,b,c,d}} 
> >>>>>>>> 
> >>>>>>>> Union is the elements of the elements, so lose the inner braces and 
> >>>>>>>> the union symbol. 
> >>>>>>>> 
> >>>>>>>> {a,c,d,e,a,b,c,d} is the result. Order doesn't matter and duplicates 
> >>>>>>>> are ignored axiomatically so this set has a cardinality number 5. 
> >>>>>>>> 
> >>>>>>>> Not not computable, but I think they said computability is not needed, 
> >>>>>>>> not that it is impossible. 
> >>>>>>> 
> >>>>>>> Well, maybe we have to focus on the intersection instead. If your 
> >>>>>>> nonsense here does stand then the union is nearly a NOP. 
> >>>>>> Union alone doesn't do what is expected, The 'result' has to be a set 
> >>>>>> and as such must adhere to the axiomatic system which describes how 
> >>>>>> sets work in relation to elements. The roster form's apparent order of 
> >>>>>> listing elements is not to be taken as an order on the set and 
> >>>>>> duplicates are ignored so that {a,c,b,d} and {b,c,a,d,c,d,d,a} are the 
> >>>>>> same set. 
> >>>>> 
> >>>>> Then lets move on to the intersection, where computation will not take 
> >>>>> the argument of a NOP. 
> >>>> NOPs are executed, set operations don't have to be. Fewer clock cycles 
> >>>> are needed for union than for NOP. 
> >>>> 
> >>>> [...] 
> >>> 
> >>> Rafters you ordinarily are far more solid in your interpretation. You are 
> >>> afraid to breach the intersection and are going to claim that the 
> >>> intersection comes magically for free? No computation necessary? Please, 
> >>> now, when we ask a child to compute: { 0, 1, 2, 4 } Intersect { 0, 1, 5, 
> >>> 6, 7, 8, 9 } are you going to tell me that the child gets their answer in 
> >>> a way that has no halting criteria? The halting problem is going to get 
> >>> you, sir. 
> >> What, another strawman? Still, I'm only saying that "order" is not 
> >> necessary in the idea of intersecting sets. I'm not saying computation 
> >> is never necessary for obtaining desired results. 
> >> 
> >> https://en.wikipedia.org/wiki/Intersection_(set_theory)#/media/File:Venn_diagram_gr_la_ru.svg 
> > 
> > I do concede that the graphical representation is rather different than the 
> > bracket notation. Yet as we see in the graphic it is as if the intersection 
> > is pre-computed; not far away from your own interpretation. Next, lets put 
> > these very alphabets in circles at random and find out what the probability 
> > is of arriving at that intersection.
> Again, the claim isn't that this particular intersection set lacks 
> order. There are many possible orders. 
n factorial orders 
> Rather, it is about sets written 
> in roster form do not take the inherent 'order' of the listing as being 
> an order on the set. It could be one possible ordering though if one 
> wanted to have an ordered set. 
> 
> Consider that (red, blue, green) and (red, green, blue) are two 
> orderings of these elements. One by associated EM frequency, one by 
> length of character string. They both come from the same set {blue, 
> red, green} which has no order imposed. Notice the braces as opposed to 
> the parentheses, we have a set and two ordered triplets. 
> 
> Getting away from the abstraction and into the actual arithmetic needed 
> to arrange things to do a more orderly sorting process is a good and 
> worthy goal. Whether the given sets are precumputed using an order or 
> computed when the intersection is taken or not is not relevant to how 
> the roster form works. The abstraction has to take in the idea that 
> order is not implied in the roster form. The setbuilder form often uses 
> order to describe a set (essentially generating them in a natural 
> order) but the set itself is just the the elements in a container.

As you utter this last word the bag method is the least ordered that I can come up with. The elements can come out in single file in any order presuming the hand that grabs them is not cheating. But is it still the set S after the first token has left the bag? It is not. That token from the bag leaves a different set. This is to say that the mathematician's denial of order of their set with their processing techniques is only an idea, to use your own words against you. It is a flawed idea. Ideas are not supposed to be perfect, but set theory is supposed to be perfect, and as soon as you started to lean on the 'idea' as a basis of your argument you as much as gave away this thread.

Each word that we utter here comes from a set of characters. It is the combinations of these characters that form the most relevant usages of set theory, from numerics to written languages. The modulo and radix forms are nearby to this relationship. There can be little doubt that the elemental nature of these characters before your eyes is well established across the land, though they are arbitrarily arrived at and certainly we will have to stop, in some cases at the river, where the next land begins and they speak a different tongue. So it is in Central and South America still in the highlands.

The fact is that to implement the disordered set theory that status quo theory relies upon we must implement that container you spoke of. Whether a computer or a bag, and I suppose the rnd() function would have to be scrutinized even then, just as soon as you maintain S in its full state, and this is the proper state of disorder rather than the gradual decomposition of S as we pick away at its elements, it is obvious that order is present within the computations and working of the set theorist.  

To deny that the order of the bracket (roster) form is handy to do computations is probably the weakest fail of the representatives of the status quo position here. Possibly a few school children do actually run backwards through the list of elements to do their computation and shuffle the answer to keep the teacher on their toes,  but none were taught that they must roll dice to truly achieve clean set theory. Indeed nowhere in the subject does this random interpretation even get pointed out. All the while we are supposed to believe that the disordered set precedes the ordered set in the proper theoretical treatment. Here we have a loose proof that it is not so.

I believe the simplest way to expose this has been developed by Rafters and I here. As he squoke out of the union and we push over to the intersection the issue of set decomposition has been put into focus. Without it no actual computation can take place. There will be no clean halt to the operation of intersection of S1 having n1 elements and S2 having n2 elements. The very ability to state the quantity of these elements implies that an order can be imposed on these sets. Otherwise no such count will be possible. This is the nature of a truly disordered set.

That we can land in a gradation of ordering... is there a lemma here on reordering as well? We can order the numbers from one to one hundred by their count, but we may as well order them by their last digit first, their third digit second, and their second digit third. Any such order that yields coverage of the elements exactly once will suffice as an efficient means of decomposing the set. Possibly we could even cover some of the elements twice and thrice and still call it coverage, and no doubt some mathematician somewhere keeps a trick like this up his sleeve. I am not that tricky honestly. I try to keep things simple. I see no reason that a bracket defined set should be claimed to lack order. The deletion of the information passed is an extraordinary step of mathematical thinking; one that deserves further scrutiny.

Another easy way in is to ponder the disordered set versus the ordered set. The breakpoint is when you get the same element out more than once; when you access your set of ten elements a hundred times and you still see only eight or nine of the elements then you know you've got a disordered set on your hands. Well, no, says the statistician; you really will have to study the distribution. So there is a can of worms here that ordinary set theory claims to fall under yet has no dice in the game. If I can uphold my interpretation and you can uphold the status quo interpretation then that is as well a sorry point of the status quo position. I don't think it is true that you can uphold it, and I think I'm doing a pretty good job here of taking it down. Some would say I'm doing a fantastic job. Taking down the system is not so easy really, and we see just how far status quo power will go to uphold its traditions. They will cheat and lie their way and start a new cold war. Shortly I suppose we will see rhetoric classes showing up in the mathematics department.

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


#517332

FromFromTheRafters <erratic@nomail.afraid.org>
Date2021-04-10 09:22 -0400
Message-ID<s4s8q3$1rjr$1@gioia.aioe.org>
In reply to#517327
It happens that Timothy Golden formulated :
> On Friday, April 9, 2021 at 3:10:04 PM UTC-4, FromTheRafters wrote:
>> Timothy Golden explained :
>>> On Thursday, April 8, 2021 at 11:39:27 AM UTC-4, FromTheRafters wrote: 
>>>> Timothy Golden explained on 4/8/2021 : 
>>>>> On Thursday, April 8, 2021 at 9:06:23 AM UTC-4, FromTheRafters wrote: 
>>>>>> Timothy Golden laid this down on his screen : 
>>>>>>> On Wednesday, April 7, 2021 at 6:33:39 PM UTC-4, FromTheRafters wrote: 
>>>>>>>> Timothy Golden used his or her keyboard to write : 
>>>>>>>>> On Wednesday, April 7, 2021 at 9:51:45 AM UTC-4, FromTheRafters 
>>>>>>>>> wrote: 
>>>>>>>>>> Timothy Golden wrote : 
>>>>>>>>>>> On Tuesday, April 6, 2021 at 11:29:07 AM UTC-4, FredJeffries wrote: 
>>>>>>>>>>>>> I don't really see the point you are making. Especially where you 
>>>>>>>>>>>>> say that { 0, 1 } 
>>>>>>>>>>>>> has no order. Clearly you passed the zero first, and the one 
>>>>>>>>>>>>> second. The denial of order is in a different stance. It is 
>>>>>>>>>>>>> required that we remove the order from this set in order for it 
>>>>>>>>>>>>> to  become disordered. Upon ensuring this disorderly conduct of 
>>>>>>>>>>>>> the  set we will no longer be able to provide reliable operations 
>>>>>>>>>>>>> such  as union and intersection. You see, to access the elements 
>>>>>>>>>>>>> of your  set in a sensible fashion you'd like a concept like 
>>>>>>>>>>>>> Element  GetFirstElement() or even better Element GetElement( int 
>>>>>>>>>>>>> order )  but these operations will not be possible on a set which 
>>>>>>>>>>>>> lacks  order. The best that you can have on the disordered set is 
>>>>>>>>>>>>> simply  Element GetElement() and because the set is disordered 
>>>>>>>>>>>>> you can get  the same element back twice from this algorithm. 
>>>>>>>>>>>>> There is no  looping through the element of the set because by 
>>>>>>>>>>>>> definition the  set lacks order. As far as I know, the methods of 
>>>>>>>>>>>>> generating the  disordered set access must be built from an 
>>>>>>>>>>>>> ordered set and not  the other way around. 
>>>>>>>>>>>> Tell us: When I scoop a cup of flour out of the bin in order to 
>>>>>>>>>>>> make  some bread, which molecule of flour is the FIRST element of 
>>>>>>>>>>>> the set  of molecules in the measuring cup? 
>>>>>>>>>>> 
>>>>>>>>>>> No, Fred, I certainly am very concerned about this question of 
>>>>>>>>>>> order  in spacetime. However we are discussing simple set theory 
>>>>>>>>>>> here where  we define sets such as: S1 = { a, b, c, d } S2 = { a, 
>>>>>>>>>>> c, d, e } 
>>>>>>>>>> Union commutes so you could think of this as S2 = A and S1 = B so A 
>>>>>>>>>> union B would be a set 
>>>>>>>>>> 
>>>>>>>>>> { } 
>>>>>>>>>> 
>>>>>>>>>> Containing the union of the two sets 
>>>>>>>>>> 
>>>>>>>>>> {{a,c,d,e}union{a,b,c,d}} 
>>>>>>>>>> 
>>>>>>>>>> Union is the elements of the elements, so lose the inner braces and 
>>>>>>>>>> the union symbol. 
>>>>>>>>>> 
>>>>>>>>>> {a,c,d,e,a,b,c,d} is the result. Order doesn't matter and duplicates 
>>>>>>>>>> are ignored axiomatically so this set has a cardinality number 5. 
>>>>>>>>>> 
>>>>>>>>>> Not not computable, but I think they said computability is not 
>>>>>>>>>> needed,  not that it is impossible. 
>>>>>>>>> 
>>>>>>>>> Well, maybe we have to focus on the intersection instead. If your 
>>>>>>>>> nonsense here does stand then the union is nearly a NOP. 
>>>>>>>> Union alone doesn't do what is expected, The 'result' has to be a set 
>>>>>>>> and as such must adhere to the axiomatic system which describes how 
>>>>>>>> sets work in relation to elements. The roster form's apparent order of 
>>>>>>>> listing elements is not to be taken as an order on the set and 
>>>>>>>> duplicates are ignored so that {a,c,b,d} and {b,c,a,d,c,d,d,a} are the 
>>>>>>>> same set. 
>>>>>>> 
>>>>>>> Then lets move on to the intersection, where computation will not take 
>>>>>>> the argument of a NOP. 
>>>>>> NOPs are executed, set operations don't have to be. Fewer clock cycles 
>>>>>> are needed for union than for NOP. 
>>>>>> 
>>>>>> [...] 
>>>>> 
>>>>> Rafters you ordinarily are far more solid in your interpretation. You are 
>>>>> afraid to breach the intersection and are going to claim that the 
>>>>> intersection comes magically for free? No computation necessary? Please, 
>>>>> now, when we ask a child to compute: { 0, 1, 2, 4 } Intersect { 0, 1, 5, 
>>>>> 6, 7, 8, 9 } are you going to tell me that the child gets their answer in 
>>>>> a way that has no halting criteria? The halting problem is going to get 
>>>>> you, sir. 
>>>> What, another strawman? Still, I'm only saying that "order" is not 
>>>> necessary in the idea of intersecting sets. I'm not saying computation 
>>>> is never necessary for obtaining desired results. 
>>>> 
>>>> https://en.wikipedia.org/wiki/Intersection_(set_theory)#/media/File:Venn_diagram_gr_la_ru.svg 
>>> 
>>> I do concede that the graphical representation is rather different than the 
>>> bracket notation. Yet as we see in the graphic it is as if the intersection 
>>> is pre-computed; not far away from your own interpretation. Next, lets put 
>>> these very alphabets in circles at random and find out what the probability 
>>> is of arriving at that intersection.
>> Again, the claim isn't that this particular intersection set lacks 
>> order. There are many possible orders.  n factorial orders 
>> Rather, it is about sets written 
>> in roster form do not take the inherent 'order' of the listing as being 
>> an order on the set. It could be one possible ordering though if one 
>> wanted to have an ordered set. 
>> 
>> Consider that (red, blue, green) and (red, green, blue) are two 
>> orderings of these elements. One by associated EM frequency, one by 
>> length of character string. They both come from the same set {blue, 
>> red, green} which has no order imposed. Notice the braces as opposed to 
>> the parentheses, we have a set and two ordered triplets. 
>> 
>> Getting away from the abstraction and into the actual arithmetic needed 
>> to arrange things to do a more orderly sorting process is a good and 
>> worthy goal. Whether the given sets are precumputed using an order or 
>> computed when the intersection is taken or not is not relevant to how 
>> the roster form works. The abstraction has to take in the idea that 
>> order is not implied in the roster form. The setbuilder form often uses 
>> order to describe a set (essentially generating them in a natural 
>> order) but the set itself is just the the elements in a container.
>
> As you utter this last word the bag method is the least ordered that I can 
> come up with. The elements can come out in single file in any order presuming 
> the hand that grabs them is not cheating. But is it still the set S after the 
> first token has left the bag?

You can't actually remove an element from a set, but you can create a 
proper subset with only that element excluded and work with that 
resulting set.

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


#517425

FromTimothy Golden <timbandtech@gmail.com>
Date2021-04-11 04:50 -0700
Message-ID<1688950a-ddba-4a25-b06c-ba57a5b1eef7n@googlegroups.com>
In reply to#517332
On Saturday, April 10, 2021 at 9:22:22 AM UTC-4, FromTheRafters wrote:
> It happens that Timothy Golden formulated :
> > On Friday, April 9, 2021 at 3:10:04 PM UTC-4, FromTheRafters wrote: 
> >> Timothy Golden explained : 
> >>> On Thursday, April 8, 2021 at 11:39:27 AM UTC-4, FromTheRafters wrote: 
> >>>> Timothy Golden explained on 4/8/2021 : 
> >>>>> On Thursday, April 8, 2021 at 9:06:23 AM UTC-4, FromTheRafters wrote: 
> >>>>>> Timothy Golden laid this down on his screen : 
> >>>>>>> On Wednesday, April 7, 2021 at 6:33:39 PM UTC-4, FromTheRafters wrote: 
> >>>>>>>> Timothy Golden used his or her keyboard to write : 
> >>>>>>>>> On Wednesday, April 7, 2021 at 9:51:45 AM UTC-4, FromTheRafters 
> >>>>>>>>> wrote: 
> >>>>>>>>>> Timothy Golden wrote : 
> >>>>>>>>>>> On Tuesday, April 6, 2021 at 11:29:07 AM UTC-4, FredJeffries wrote: 
> >>>>>>>>>>>>> I don't really see the point you are making. Especially where you 
> >>>>>>>>>>>>> say that { 0, 1 } 
> >>>>>>>>>>>>> has no order. Clearly you passed the zero first, and the one 
> >>>>>>>>>>>>> second. The denial of order is in a different stance. It is 
> >>>>>>>>>>>>> required that we remove the order from this set in order for it 
> >>>>>>>>>>>>> to become disordered. Upon ensuring this disorderly conduct of 
> >>>>>>>>>>>>> the set we will no longer be able to provide reliable operations 
> >>>>>>>>>>>>> such as union and intersection. You see, to access the elements 
> >>>>>>>>>>>>> of your set in a sensible fashion you'd like a concept like 
> >>>>>>>>>>>>> Element GetFirstElement() or even better Element GetElement( int 
> >>>>>>>>>>>>> order ) but these operations will not be possible on a set which 
> >>>>>>>>>>>>> lacks order. The best that you can have on the disordered set is 
> >>>>>>>>>>>>> simply Element GetElement() and because the set is disordered 
> >>>>>>>>>>>>> you can get the same element back twice from this algorithm. 
> >>>>>>>>>>>>> There is no looping through the element of the set because by 
> >>>>>>>>>>>>> definition the set lacks order. As far as I know, the methods of 
> >>>>>>>>>>>>> generating the disordered set access must be built from an 
> >>>>>>>>>>>>> ordered set and not the other way around. 
> >>>>>>>>>>>> Tell us: When I scoop a cup of flour out of the bin in order to 
> >>>>>>>>>>>> make some bread, which molecule of flour is the FIRST element of 
> >>>>>>>>>>>> the set of molecules in the measuring cup? 
> >>>>>>>>>>> 
> >>>>>>>>>>> No, Fred, I certainly am very concerned about this question of 
> >>>>>>>>>>> order in spacetime. However we are discussing simple set theory 
> >>>>>>>>>>> here where we define sets such as: S1 = { a, b, c, d } S2 = { a, 
> >>>>>>>>>>> c, d, e } 
> >>>>>>>>>> Union commutes so you could think of this as S2 = A and S1 = B so A 
> >>>>>>>>>> union B would be a set 
> >>>>>>>>>> 
> >>>>>>>>>> { } 
> >>>>>>>>>> 
> >>>>>>>>>> Containing the union of the two sets 
> >>>>>>>>>> 
> >>>>>>>>>> {{a,c,d,e}union{a,b,c,d}} 
> >>>>>>>>>> 
> >>>>>>>>>> Union is the elements of the elements, so lose the inner braces and 
> >>>>>>>>>> the union symbol. 
> >>>>>>>>>> 
> >>>>>>>>>> {a,c,d,e,a,b,c,d} is the result. Order doesn't matter and duplicates 
> >>>>>>>>>> are ignored axiomatically so this set has a cardinality number 5. 
> >>>>>>>>>> 
> >>>>>>>>>> Not not computable, but I think they said computability is not 
> >>>>>>>>>> needed, not that it is impossible. 
> >>>>>>>>> 
> >>>>>>>>> Well, maybe we have to focus on the intersection instead. If your 
> >>>>>>>>> nonsense here does stand then the union is nearly a NOP. 
> >>>>>>>> Union alone doesn't do what is expected, The 'result' has to be a set 
> >>>>>>>> and as such must adhere to the axiomatic system which describes how 
> >>>>>>>> sets work in relation to elements. The roster form's apparent order of 
> >>>>>>>> listing elements is not to be taken as an order on the set and 
> >>>>>>>> duplicates are ignored so that {a,c,b,d} and {b,c,a,d,c,d,d,a} are the 
> >>>>>>>> same set. 
> >>>>>>> 
> >>>>>>> Then lets move on to the intersection, where computation will not take 
> >>>>>>> the argument of a NOP. 
> >>>>>> NOPs are executed, set operations don't have to be. Fewer clock cycles 
> >>>>>> are needed for union than for NOP. 
> >>>>>> 
> >>>>>> [...] 
> >>>>> 
> >>>>> Rafters you ordinarily are far more solid in your interpretation. You are 
> >>>>> afraid to breach the intersection and are going to claim that the 
> >>>>> intersection comes magically for free? No computation necessary? Please, 
> >>>>> now, when we ask a child to compute: { 0, 1, 2, 4 } Intersect { 0, 1, 5, 
> >>>>> 6, 7, 8, 9 } are you going to tell me that the child gets their answer in 
> >>>>> a way that has no halting criteria? The halting problem is going to get 
> >>>>> you, sir. 
> >>>> What, another strawman? Still, I'm only saying that "order" is not 
> >>>> necessary in the idea of intersecting sets. I'm not saying computation 
> >>>> is never necessary for obtaining desired results. 
> >>>> 
> >>>> https://en.wikipedia.org/wiki/Intersection_(set_theory)#/media/File:Venn_diagram_gr_la_ru.svg 
> >>> 
> >>> I do concede that the graphical representation is rather different than the 
> >>> bracket notation. Yet as we see in the graphic it is as if the intersection 
> >>> is pre-computed; not far away from your own interpretation. Next, lets put 
> >>> these very alphabets in circles at random and find out what the probability 
> >>> is of arriving at that intersection. 
> >> Again, the claim isn't that this particular intersection set lacks 
> >> order. There are many possible orders. n factorial orders 
> >> Rather, it is about sets written 
> >> in roster form do not take the inherent 'order' of the listing as being 
> >> an order on the set. It could be one possible ordering though if one 
> >> wanted to have an ordered set. 
> >> 
> >> Consider that (red, blue, green) and (red, green, blue) are two 
> >> orderings of these elements. One by associated EM frequency, one by 
> >> length of character string. They both come from the same set {blue, 
> >> red, green} which has no order imposed. Notice the braces as opposed to 
> >> the parentheses, we have a set and two ordered triplets. 
> >> 
> >> Getting away from the abstraction and into the actual arithmetic needed 
> >> to arrange things to do a more orderly sorting process is a good and 
> >> worthy goal. Whether the given sets are precumputed using an order or 
> >> computed when the intersection is taken or not is not relevant to how 
> >> the roster form works. The abstraction has to take in the idea that 
> >> order is not implied in the roster form. The setbuilder form often uses 
> >> order to describe a set (essentially generating them in a natural 
> >> order) but the set itself is just the the elements in a container. 
> > 
> > As you utter this last word the bag method is the least ordered that I can 
> > come up with. The elements can come out in single file in any order presuming 
> > the hand that grabs them is not cheating. But is it still the set S after the 
> > first token has left the bag?
> You can't actually remove an element from a set, but you can create a 
> proper subset with only that element excluded and work with that 
> resulting set.

Well, there are n! possible orders in a set of n elements. Any one of them will do for the simple set computations we discussed.

Could it be that in the search for new operators we should turn to set theory rather than algebra? I guess I'll try.

As we perform the operations we are decomposing the set. Otherwise you get the random form that I argue the lack of order claim actually implies.

The subject of set theory is easy. Could it be that it is too easy? As we witness the world from a blank slate and we see the redundancies of reality and yet the uniqueness of large objects such as pine trees or you or me; to arrive at the elemental via a procedure of cuts is quite an impressive feat of the early philosophers. Here again though it is the same misnomer all over again: it is the many combinations that the atomic elements can take with their complicated joinery that  build molecules and proteins whose complexities allow for life to arise.  It really is more about these combinations than the elements themselves. CHON are the critical four and of course we single carbon out of those four even if you must point to one. It's tetrahedral joinery does match the three dimensional nature of space itself. The quantity of these elements does take meaning. Set theory wipes that out. Conservation is missing.

But then, even these very complicated elements; and we do still use this language; are exposed as consisting of electrons, protons, and neutrons, and those protons and neutrons are now claimed to be composed of triples of quarks. We face a long accumulation of information and few today are going to claim that the human body is composed of electrons and quarks as a first principle. I certainly have not adopted this stance. That what we call the elements are no longer the elements... this is the sort of ambiguity that accumulation brings. At this time if some young mind does attempt a from-scratch account of the accumulation so as to collapse the pile, well, good luck to your slender list of adoptees. Kant and Descartes had it much easier. Their works fit into a one room library that fit into a castle. Now the stacks are piled ten floors high and growing out of control really as we breach 8 billion humans on planet Earth and more and more adopting college education; becoming PhDs; the need to be published. No worries: the next generation of media will store petabytes instead of gigabytes. Then we can all get something on the platter.  Our usenet hangout here can go into the database that only the top goons get to access... if the content is too rich...
   https://www.youtube.com/watch?v=cr2SmniV0HY
#TheJimmyDoreShow
The FUNNIEST Russia-Gate Headlines Of All Time
56,055 views•Apr 10, 2021

2.8K

40

SHARE

SAVE

What I really mean to say is that what is elemental is a far more serious topic than the problems of elementhood that set theory faces. Set theory is so watered down as to allow for elements such as
   { clowns, comedians, goons, intelligence officers }
and everything will be just fine on S. I don't think everything is going to be just fine. We cannot undo what has been done. Accumulation has gotten the better of us. Could the set
   { mutually, assured, destruction }
have been adopted falsely? By a bunch of Christian generals who hate atheism? And these then lead us down this road of ambiguity? To start a fresh cold war? This is a losing position no different than the last cold war was a losing postion. We are losing our civility now. This is not a time to tuck your head into your math text and close the covers onto your ears people. These times that we are in now require that the language of nothing burger be called that as it is elocuted.

I don't believe that this thread is nothing burger. I do believe that the problems that humanity faces are larger than my cuntry's national border. I do believe that we are a fine instance of the way not to go. I do believe that it is time to try again. 

To wipe the slate clean... to start from scratch... will we merely arrive in the same position again? Is this redundancy guaranteed? I don't think so. I think we see Europe as the next image to imprint upon and that Europe will be making friends with its neighbors rather than making enemies with them. China makes friends. U$A twists arms and launches armaments in attrition as a game of winner takes all... global cutthroat capitalism. You Brits are in on it too. Weasels everywhere are in on it. Media weasels running down the holes dug by the deep state popping up out of the ground here and there and everywhere uttering 
   Russia !
and now we are supposed to forget about that storm? No. It does not work this way. Truth is Freedom. Media Accountability is necessary now. NPR Sucks Ass. That is my fav because I used to be a daily listener there. Not any more. I get the sense that I can't trust anybody anymore and the more nothing burger I hear spoken the more I have to point it out. Strong minds will fail under these conditions. Throw in a global pandemic and some inconvenient virus mutations. Who really cares about the general population when you get to the level of general? Well, they say, it is too easy to be a critic. And it certainly is way too easy to be a critic right now.

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


#517441

FromFromTheRafters <erratic@nomail.afraid.org>
Date2021-04-11 09:24 -0400
Message-ID<s4utaa$4lg$1@gioia.aioe.org>
In reply to#517425
Timothy Golden pretended :
> On Saturday, April 10, 2021 at 9:22:22 AM UTC-4, FromTheRafters wrote:
>> It happens that Timothy Golden formulated :
>>> On Friday, April 9, 2021 at 3:10:04 PM UTC-4, FromTheRafters wrote: 
>>>> Timothy Golden explained : 
>>>>> On Thursday, April 8, 2021 at 11:39:27 AM UTC-4, FromTheRafters wrote: 
>>>>>> Timothy Golden explained on 4/8/2021 : 
>>>>>>> On Thursday, April 8, 2021 at 9:06:23 AM UTC-4, FromTheRafters wrote: 
>>>>>>>> Timothy Golden laid this down on his screen : 
>>>>>>>>> On Wednesday, April 7, 2021 at 6:33:39 PM UTC-4, FromTheRafters 
>>>>>>>>> wrote: 
>>>>>>>>>> Timothy Golden used his or her keyboard to write : 
>>>>>>>>>>> On Wednesday, April 7, 2021 at 9:51:45 AM UTC-4, FromTheRafters 
>>>>>>>>>>> wrote: 
>>>>>>>>>>>> Timothy Golden wrote : 
>>>>>>>>>>>>> On Tuesday, April 6, 2021 at 11:29:07 AM UTC-4, FredJeffries 
>>>>>>>>>>>>> wrote: 
>>>>>>>>>>>>>>> I don't really see the point you are making. Especially where 
>>>>>>>>>>>>>>> you  say that { 0, 1 } 
>>>>>>>>>>>>>>> has no order. Clearly you passed the zero first, and the one 
>>>>>>>>>>>>>>> second. The denial of order is in a different stance. It is 
>>>>>>>>>>>>>>> required that we remove the order from this set in order for it 
>>>>>>>>>>>>>>> to become disordered. Upon ensuring this disorderly conduct of 
>>>>>>>>>>>>>>> the set we will no longer be able to provide reliable 
>>>>>>>>>>>>>>> operations  such as union and intersection. You see, to access 
>>>>>>>>>>>>>>> the elements  of your set in a sensible fashion you'd like a 
>>>>>>>>>>>>>>> concept like  Element GetFirstElement() or even better Element 
>>>>>>>>>>>>>>> GetElement( int  order ) but these operations will not be 
>>>>>>>>>>>>>>> possible on a set which  lacks order. The best that you can 
>>>>>>>>>>>>>>> have on the disordered set is  simply Element GetElement() and 
>>>>>>>>>>>>>>> because the set is disordered  you can get the same element 
>>>>>>>>>>>>>>> back twice from this algorithm.  There is no looping through 
>>>>>>>>>>>>>>> the element of the set because by  definition the set lacks 
>>>>>>>>>>>>>>> order. As far as I know, the methods of  generating the 
>>>>>>>>>>>>>>> disordered set access must be built from an  ordered set and 
>>>>>>>>>>>>>>> not the other way around. 
>>>>>>>>>>>>>> Tell us: When I scoop a cup of flour out of the bin in order to 
>>>>>>>>>>>>>> make some bread, which molecule of flour is the FIRST element of 
>>>>>>>>>>>>>> the set of molecules in the measuring cup? 
>>>>>>>>>>>>> 
>>>>>>>>>>>>> No, Fred, I certainly am very concerned about this question of 
>>>>>>>>>>>>> order in spacetime. However we are discussing simple set theory 
>>>>>>>>>>>>> here where we define sets such as: S1 = { a, b, c, d } S2 = { a, 
>>>>>>>>>>>>> c, d, e } 
>>>>>>>>>>>> Union commutes so you could think of this as S2 = A and S1 = B so 
>>>>>>>>>>>> A  union B would be a set 
>>>>>>>>>>>> 
>>>>>>>>>>>> { } 
>>>>>>>>>>>> 
>>>>>>>>>>>> Containing the union of the two sets 
>>>>>>>>>>>> 
>>>>>>>>>>>> {{a,c,d,e}union{a,b,c,d}} 
>>>>>>>>>>>> 
>>>>>>>>>>>> Union is the elements of the elements, so lose the inner braces 
>>>>>>>>>>>> and  the union symbol. 
>>>>>>>>>>>> 
>>>>>>>>>>>> {a,c,d,e,a,b,c,d} is the result. Order doesn't matter and 
>>>>>>>>>>>> duplicates  are ignored axiomatically so this set has a 
>>>>>>>>>>>> cardinality number 5. 
>>>>>>>>>>>> 
>>>>>>>>>>>> Not not computable, but I think they said computability is not 
>>>>>>>>>>>> needed, not that it is impossible. 
>>>>>>>>>>> 
>>>>>>>>>>> Well, maybe we have to focus on the intersection instead. If your 
>>>>>>>>>>> nonsense here does stand then the union is nearly a NOP. 
>>>>>>>>>> Union alone doesn't do what is expected, The 'result' has to be a 
>>>>>>>>>> set  and as such must adhere to the axiomatic system which describes 
>>>>>>>>>> how  sets work in relation to elements. The roster form's apparent 
>>>>>>>>>> order of  listing elements is not to be taken as an order on the set 
>>>>>>>>>> and  duplicates are ignored so that {a,c,b,d} and {b,c,a,d,c,d,d,a} 
>>>>>>>>>> are the  same set. 
>>>>>>>>> 
>>>>>>>>> Then lets move on to the intersection, where computation will not 
>>>>>>>>> take  the argument of a NOP. 
>>>>>>>> NOPs are executed, set operations don't have to be. Fewer clock cycles 
>>>>>>>> are needed for union than for NOP. 
>>>>>>>> 
>>>>>>>> [...] 
>>>>>>> 
>>>>>>> Rafters you ordinarily are far more solid in your interpretation. You 
>>>>>>> are  afraid to breach the intersection and are going to claim that the 
>>>>>>> intersection comes magically for free? No computation necessary? 
>>>>>>> Please,  now, when we ask a child to compute: { 0, 1, 2, 4 } Intersect 
>>>>>>> { 0, 1, 5,  6, 7, 8, 9 } are you going to tell me that the child gets 
>>>>>>> their answer in  a way that has no halting criteria? The halting 
>>>>>>> problem is going to get  you, sir. 
>>>>>> What, another strawman? Still, I'm only saying that "order" is not 
>>>>>> necessary in the idea of intersecting sets. I'm not saying computation 
>>>>>> is never necessary for obtaining desired results. 
>>>>>> 
>>>>>> https://en.wikipedia.org/wiki/Intersection_(set_theory)#/media/File:Venn_diagram_gr_la_ru.svg 
>>>>> 
>>>>> I do concede that the graphical representation is rather different than 
>>>>> the  bracket notation. Yet as we see in the graphic it is as if the 
>>>>> intersection  is pre-computed; not far away from your own interpretation. 
>>>>> Next, lets put  these very alphabets in circles at random and find out 
>>>>> what the probability  is of arriving at that intersection. 
>>>> Again, the claim isn't that this particular intersection set lacks 
>>>> order. There are many possible orders. n factorial orders 
>>>> Rather, it is about sets written 
>>>> in roster form do not take the inherent 'order' of the listing as being 
>>>> an order on the set. It could be one possible ordering though if one 
>>>> wanted to have an ordered set. 
>>>> 
>>>> Consider that (red, blue, green) and (red, green, blue) are two 
>>>> orderings of these elements. One by associated EM frequency, one by 
>>>> length of character string. They both come from the same set {blue, 
>>>> red, green} which has no order imposed. Notice the braces as opposed to 
>>>> the parentheses, we have a set and two ordered triplets. 
>>>> 
>>>> Getting away from the abstraction and into the actual arithmetic needed 
>>>> to arrange things to do a more orderly sorting process is a good and 
>>>> worthy goal. Whether the given sets are precumputed using an order or 
>>>> computed when the intersection is taken or not is not relevant to how 
>>>> the roster form works. The abstraction has to take in the idea that 
>>>> order is not implied in the roster form. The setbuilder form often uses 
>>>> order to describe a set (essentially generating them in a natural 
>>>> order) but the set itself is just the the elements in a container. 
>>> 
>>> As you utter this last word the bag method is the least ordered that I can 
>>> come up with. The elements can come out in single file in any order 
>>> presuming  the hand that grabs them is not cheating. But is it still the 
>>> set S after the  first token has left the bag?
>> You can't actually remove an element from a set, but you can create a 
>> proper subset with only that element excluded and work with that 
>> resulting set.
>
> Well, there are n! possible orders in a set of n elements. Any one of them 
> will do for the simple set computations we discussed.

True, but consider also, from a foundational aspect, we have sets and 
operations on sets before we have things like numbers, order and 
equality.

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


#517442

FromFromTheRafters <erratic@nomail.afraid.org>
Date2021-04-11 09:34 -0400
Message-ID<s4utu0$dot$1@gioia.aioe.org>
In reply to#517441
FromTheRafters has brought this to us :
> Timothy Golden pretended :
>> On Saturday, April 10, 2021 at 9:22:22 AM UTC-4, FromTheRafters wrote:
>>> It happens that Timothy Golden formulated :
>>>> On Friday, April 9, 2021 at 3:10:04 PM UTC-4, FromTheRafters wrote:
>>>>> Timothy Golden explained :
>>>>>> On Thursday, April 8, 2021 at 11:39:27 AM UTC-4, FromTheRafters wrote:
>>>>>>> Timothy Golden explained on 4/8/2021 :
>>>>>>>> On Thursday, April 8, 2021 at 9:06:23 AM UTC-4, FromTheRafters wrote:
>>>>>>>>> Timothy Golden laid this down on his screen :
>>>>>>>>>> On Wednesday, April 7, 2021 at 6:33:39 PM UTC-4, FromTheRafters 
>>>>>>>>>> wrote:
>>>>>>>>>>> Timothy Golden used his or her keyboard to write :
>>>>>>>>>>>> On Wednesday, April 7, 2021 at 9:51:45 AM UTC-4, FromTheRafters 
>>>>>>>>>>>> wrote:
>>>>>>>>>>>>> Timothy Golden wrote :
>>>>>>>>>>>>>> On Tuesday, April 6, 2021 at 11:29:07 AM UTC-4, FredJeffries 
>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>>> I don't really see the point you are making. Especially where 
>>>>>>>>>>>>>>>> you  say that { 0, 1 } has no order. Clearly you passed the 
>>>>>>>>>>>>>>>> zero first, and the one second. The denial of order is in a 
>>>>>>>>>>>>>>>> different stance. It is required that we remove the order 
>>>>>>>>>>>>>>>> from this set in order for it to become disordered. Upon 
>>>>>>>>>>>>>>>> ensuring this disorderly conduct of the set we will no longer 
>>>>>>>>>>>>>>>> be able to provide reliable operations  such as union and 
>>>>>>>>>>>>>>>> intersection. You see, to access the elements  of your set in 
>>>>>>>>>>>>>>>> a sensible fashion you'd like a concept like  Element 
>>>>>>>>>>>>>>>> GetFirstElement() or even better Element GetElement( int  
>>>>>>>>>>>>>>>> order ) but these operations will not be possible on a set 
>>>>>>>>>>>>>>>> which  lacks order. The best that you can have on the 
>>>>>>>>>>>>>>>> disordered set is  simply Element GetElement() and because 
>>>>>>>>>>>>>>>> the set is disordered  you can get the same element back 
>>>>>>>>>>>>>>>> twice from this algorithm.  There is no looping through the 
>>>>>>>>>>>>>>>> element of the set because by  definition the set lacks 
>>>>>>>>>>>>>>>> order. As far as I know, the methods of  generating the 
>>>>>>>>>>>>>>>> disordered set access must be built from an  ordered set and 
>>>>>>>>>>>>>>>> not the other way around.
>>>>>>>>>>>>>>> Tell us: When I scoop a cup of flour out of the bin in order 
>>>>>>>>>>>>>>> to make some bread, which molecule of flour is the FIRST 
>>>>>>>>>>>>>>> element of the set of molecules in the measuring cup?
>>>>>>>>>>>>>> 
>>>>>>>>>>>>>> No, Fred, I certainly am very concerned about this question of 
>>>>>>>>>>>>>> order in spacetime. However we are discussing simple set theory 
>>>>>>>>>>>>>> here where we define sets such as: S1 = { a, b, c, d } S2 = { 
>>>>>>>>>>>>>> a, c, d, e }
>>>>>>>>>>>>> Union commutes so you could think of this as S2 = A and S1 = B 
>>>>>>>>>>>>> so A  union B would be a set 
>>>>>>>>>>>>> 
>>>>>>>>>>>>> { } 
>>>>>>>>>>>>> 
>>>>>>>>>>>>> Containing the union of the two sets 
>>>>>>>>>>>>> 
>>>>>>>>>>>>> {{a,c,d,e}union{a,b,c,d}} 
>>>>>>>>>>>>> 
>>>>>>>>>>>>> Union is the elements of the elements, so lose the inner braces 
>>>>>>>>>>>>> and  the union symbol. 
>>>>>>>>>>>>> 
>>>>>>>>>>>>> {a,c,d,e,a,b,c,d} is the result. Order doesn't matter and 
>>>>>>>>>>>>> duplicates  are ignored axiomatically so this set has a 
>>>>>>>>>>>>> cardinality number 5. 
>>>>>>>>>>>>> 
>>>>>>>>>>>>> Not not computable, but I think they said computability is not 
>>>>>>>>>>>>> needed, not that it is impossible.
>>>>>>>>>>>> 
>>>>>>>>>>>> Well, maybe we have to focus on the intersection instead. If your 
>>>>>>>>>>>> nonsense here does stand then the union is nearly a NOP.
>>>>>>>>>>> Union alone doesn't do what is expected, The 'result' has to be a 
>>>>>>>>>>> set  and as such must adhere to the axiomatic system which 
>>>>>>>>>>> describes how  sets work in relation to elements. The roster 
>>>>>>>>>>> form's apparent order of  listing elements is not to be taken as 
>>>>>>>>>>> an order on the set and  duplicates are ignored so that {a,c,b,d} 
>>>>>>>>>>> and {b,c,a,d,c,d,d,a} are the  same set.
>>>>>>>>>> 
>>>>>>>>>> Then lets move on to the intersection, where computation will not 
>>>>>>>>>> take  the argument of a NOP.
>>>>>>>>> NOPs are executed, set operations don't have to be. Fewer clock 
>>>>>>>>> cycles are needed for union than for NOP. 
>>>>>>>>> 
>>>>>>>>> [...]
>>>>>>>> 
>>>>>>>> Rafters you ordinarily are far more solid in your interpretation. You 
>>>>>>>> are  afraid to breach the intersection and are going to claim that 
>>>>>>>> the intersection comes magically for free? No computation necessary? 
>>>>>>>> Please,  now, when we ask a child to compute: { 0, 1, 2, 4 } 
>>>>>>>> Intersect { 0, 1, 5,  6, 7, 8, 9 } are you going to tell me that the 
>>>>>>>> child gets their answer in  a way that has no halting criteria? The 
>>>>>>>> halting problem is going to get  you, sir.
>>>>>>> What, another strawman? Still, I'm only saying that "order" is not 
>>>>>>> necessary in the idea of intersecting sets. I'm not saying computation 
>>>>>>> is never necessary for obtaining desired results. 
>>>>>>> 
>>>>>>> https://en.wikipedia.org/wiki/Intersection_(set_theory)#/media/File:Venn_diagram_gr_la_ru.svg
>>>>>> 
>>>>>> I do concede that the graphical representation is rather different than 
>>>>>> the  bracket notation. Yet as we see in the graphic it is as if the 
>>>>>> intersection  is pre-computed; not far away from your own 
>>>>>> interpretation. Next, lets put  these very alphabets in circles at 
>>>>>> random and find out what the probability  is of arriving at that 
>>>>>> intersection.
>>>>> Again, the claim isn't that this particular intersection set lacks 
>>>>> order. There are many possible orders. n factorial orders Rather, it is 
>>>>> about sets written in roster form do not take the inherent 'order' of 
>>>>> the listing as being an order on the set. It could be one possible 
>>>>> ordering though if one wanted to have an ordered set. 
>>>>> 
>>>>> Consider that (red, blue, green) and (red, green, blue) are two 
>>>>> orderings of these elements. One by associated EM frequency, one by 
>>>>> length of character string. They both come from the same set {blue, red, 
>>>>> green} which has no order imposed. Notice the braces as opposed to the 
>>>>> parentheses, we have a set and two ordered triplets. 
>>>>> 
>>>>> Getting away from the abstraction and into the actual arithmetic needed 
>>>>> to arrange things to do a more orderly sorting process is a good and 
>>>>> worthy goal. Whether the given sets are precumputed using an order or 
>>>>> computed when the intersection is taken or not is not relevant to how 
>>>>> the roster form works. The abstraction has to take in the idea that 
>>>>> order is not implied in the roster form. The setbuilder form often uses 
>>>>> order to describe a set (essentially generating them in a natural order) 
>>>>> but the set itself is just the the elements in a container.
>>>> 
>>>> As you utter this last word the bag method is the least ordered that I 
>>>> can come up with. The elements can come out in single file in any order 
>>>> presuming  the hand that grabs them is not cheating. But is it still the 
>>>> set S after the  first token has left the bag?
>>> You can't actually remove an element from a set, but you can create a 
>>> proper subset with only that element excluded and work with that resulting 
>>> set.
>>
>> Well, there are n! possible orders in a set of n elements. Any one of them 
>> will do for the simple set computations we discussed.
>
> True, but consider also, from a foundational aspect, we have sets and 
> operations on sets before we have things like numbers, order and equality.

Acually, the word is permutation or arrangement depending upon which 
you prefer to be the noun and which the verb.

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


#517452

FromTimothy Golden <timbandtech@gmail.com>
Date2021-04-11 07:33 -0700
Message-ID<c638d809-121e-4808-aa98-eca64a5e7683n@googlegroups.com>
In reply to#517441
On Sunday, April 11, 2021 at 9:24:37 AM UTC-4, FromTheRafters wrote:
> Timothy Golden pretended :
> > On Saturday, April 10, 2021 at 9:22:22 AM UTC-4, FromTheRafters wrote: 

> > Well, there are n! possible orders in a set of n elements. Any one of them 
> > will do for the simple set computations we discussed.
> True, but consider also, from a foundational aspect, we have sets and 
> operations on sets before we have things like numbers, order and 
> equality.

I stand by my earlier refutation of this statement. I do feel that we could close this thread out now.
I won't be around much probably for the next week anyways, but I will check in on it and respond to any late contributions.
The ordered precedes the truly disordered set. What you call a set that lacks order has order from the get-go. There is no language which allows the expression of a disordered set other than from within random analysis, which is where the claim should land the theoretician. If there were more ground to cover, I'd say let's cover it, but I'm pretty sure we've run out of ground. Maybe it's time to go underground...

   https://www.rt.com/shows/going-underground

Afshin often gets it right. I bumped into him at a Boston protest back ala 2016 rigged election and the Trump quagmire. He is quite short.

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


#517458

FromPeter <peterxpercival@hotmail.com>
Date2021-04-11 16:14 +0100
Message-ID<s4v3oc$1068$1@gioia.aioe.org>
In reply to#517452
Timothy Golden wrote:
> On Sunday, April 11, 2021 at 9:24:37 AM UTC-4, FromTheRafters wrote:
>> Timothy Golden pretended :
>>> On Saturday, April 10, 2021 at 9:22:22 AM UTC-4, FromTheRafters wrote:
> 
>>> Well, there are n! possible orders in a set of n elements. Any one of them
>>> will do for the simple set computations we discussed.
>> True, but consider also, from a foundational aspect, we have sets and
>> operations on sets before we have things like numbers, order and
>> equality.
> 
> I stand by my earlier refutation of this statement. I do feel that we could close this thread out now.
> I won't be around much probably for the next week anyways, but I will check in on it and respond to any late contributions.
> The ordered precedes the truly disordered set. What you call a set that lacks order has order from the get-go. There is no language which allows the expression of a disordered set other than from within random analysis, which is where the claim should land the theoretician. If there were more ground to cover, I'd say let's cover it, but I'm pretty sure we've run out of ground. Maybe it's time to go underground...
> 
>     https://www.rt.com/shows/going-underground
> 
> Afshin often gets it right. I bumped into him at a Boston protest back ala 2016 rigged election and the Trump quagmire. He is quite short.
> 

Consider two overlapping disks in the plane.  They are each sets of 
points.  What has their intersection got to do with order or computation?

-- 
Just as 'beautiful' points the way for aesthetics and 'good' for ethics,
so do words like 'true' for logic.  All sciences have truth as their
goal; but logic is also concerned with it in a quite different way:
logic has much the same relation to truth as physics has to weight or
heat.                               Frege in 'Thoughts' (Der Gedanke)

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


#517557

From"zelos...@gmail.com" <zelos.malum@gmail.com>
Date2021-04-12 01:18 -0700
Message-ID<9810580e-d768-47d1-8b29-62921e7152f7n@googlegroups.com>
In reply to#517061
torsdag 8 april 2021 kl. 14:48:57 UTC+2 skrev timba...@gmail.com:
> On Wednesday, April 7, 2021 at 6:33:39 PM UTC-4, FromTheRafters wrote: 
> > Timothy Golden used his or her keyboard to write : 
> > > On Wednesday, April 7, 2021 at 9:51:45 AM UTC-4, FromTheRafters wrote: 
> > >> Timothy Golden wrote : 
> > >>> On Tuesday, April 6, 2021 at 11:29:07 AM UTC-4, FredJeffries wrote: 
> > >>>>> I don't really see the point you are making. Especially where you say 
> > >>>>> that { 0, 1 } 
> > >>>>> has no order. Clearly you passed the zero first, and the one second. 
> > >>>>> The denial of order is in a different stance. It is required that we 
> > >>>>> remove the order from this set in order for it to become disordered. 
> > >>>>> Upon ensuring this disorderly conduct of the set we will no longer be 
> > >>>>> able to provide reliable operations such as union and intersection. You 
> > >>>>> see, to access the elements of your set in a sensible fashion you'd like 
> > >>>>> a concept like Element GetFirstElement() or even better Element 
> > >>>>> GetElement( int order ) but these operations will not be possible on a 
> > >>>>> set which lacks order. The best that you can have on the disordered set 
> > >>>>> is simply Element GetElement() 
> > >>>>> and because the set is disordered you can get the same element back twice 
> > >>>>> from this algorithm. There is no looping through the element of the set 
> > >>>>> because by definition the set lacks order. As far as I know, the methods 
> > >>>>> of generating the disordered set access must be built from an ordered set 
> > >>>>> and not the other way around. 
> > >>>> Tell us: When I scoop a cup of flour out of the bin in order to make some 
> > >>>> bread, which molecule of flour is the FIRST element of the set of 
> > >>>> molecules in the measuring cup? 
> > >>> 
> > >>> No, Fred, I certainly am very concerned about this question of order in 
> > >>> spacetime. However we are discussing simple set theory here where we define 
> > >>> sets such as: S1 = { a, b, c, d } S2 = { a, c, d, e } 
> > >> Union commutes so you could think of this as S2 = A and S1 = B so A 
> > >> union B would be a set 
> > >> 
> > >> { } 
> > >> 
> > >> Containing the union of the two sets 
> > >> 
> > >> {{a,c,d,e}union{a,b,c,d}} 
> > >> 
> > >> Union is the elements of the elements, so lose the inner braces and the 
> > >> union symbol. 
> > >> 
> > >> {a,c,d,e,a,b,c,d} is the result. Order doesn't matter and duplicates 
> > >> are ignored axiomatically so this set has a cardinality number 5. 
> > >> 
> > >> Not not computable, but I think they said computability is not needed, 
> > >> not that it is impossible. 
> > > 
> > > Well, maybe we have to focus on the intersection instead. If your nonsense 
> > > here does stand then the union is nearly a NOP. 
> > Union alone doesn't do what is expected, The 'result' has to be a set 
> > and as such must adhere to the axiomatic system which describes how 
> > sets work in relation to elements. The roster form's apparent order of 
> > listing elements is not to be taken as an order on the set and 
> > duplicates are ignored so that {a,c,b,d} and {b,c,a,d,c,d,d,a} are the 
> > same set.
> Then lets move on to the intersection, where computation will not take the argument of a NOP. 
> I do partially accept what you are saying on the union. This is the nature of the sum. 
> The union and the sum are nearby to each other. 
> Normally under arithmetic logic I would also argue that the difference is not fundamental, and that it can be composed by the sum of the inverse value. It seems set theory does not carry this replacement easily. 
> 
> That said the silliness of working in sets such as: 
> "Animals except hippopotamuses" 
> is not at all what is under discussion here. 
> We (meaning I if you don't include yourself) am discussing discrete sets which follow the notation 
> S = { element1, element2, element3, ... elementN } 
> and here by this order I don't mean to be imposing order directly but to expose that this order is present and that we do in fact rely upon some form of order to perform operations on the set of elements. Also the ellipses and the N are only present for generality. A truly instantiated set of elements will have a natural value. 
> 
> The very ability to mention cardinality is an indication that you are practicing an ordered set theory. What is the meaning of set? To have coverage means that each element got treatment. To do this efficiently order has to be present; even while the greats of old claimed it wasn't; right up to modernity this very day. 
> 
> I can provide the intersection out of two bags if you like. There may be some intermediate bags needed as well, and of course a final bag for the output set. We may need an element copy so that the original bags are maintained, but this doesn't seem to be a problem for you all. Lets say we are operating with woodchips marked as tokens. We simply take a chip from bag A and put it next to bag A. Now we do the same at bag B but keep sweeping through the bag B and if a match comes up we must then build a copy of that token and place it in bag C. Upon completion of the sweep of bag B we put the chips back into B for another round. We pick another chip out of A and do it all again until we are out of chips in A. We now put A's chips back in bag A, B's chips back in B, and C is the intersection. This is about as disorderly as we can get, but there is still order present. This is a random decomposition of both A and B. B got out of the bag a different way each time and the operation still worked. Clearly we were highly ordered in A and less ordered in B. We are also looking very near to a Cartesian product space as well. We've covered all the matrix of (A,B) in order to arrive here. 
> 
> The fully disordered version of this intersection operation will require that you put all of A's tokens back in bag A and all of B's tokens back in bag B at every step. If you even decide to scrawl down on a piece of paper what token has come out of what bag then you are imposing order on the set system of full disorder. Pull a token from A. Pull a token from B. If they match make a token copy and place it in C. Put A token back in A bag, B token back in B bag, and repeat. All that you have is a probabilistic system. After a hundred attempts on two ten token bags I'll be done and you'll be scratching your head. The means of order may appear insignificant yet it is via the destruction of order that we witness their presence. Clearly we still have another sense of order and that is the ownership of tokens to bags. The bag would seem to be a disordered system, yet because we can pick a single token out of the bag and call it out there is still some semblance of order. I'd have to say that some you here are half in the bag and and the other half are pulling the bag over their heads here. 
> 
> We have the halting problem. We have exposed forms of order that go deeper than elementhood. Your claims land you in a probabilistic set theory. My claims land us in ordinary set theory. Therefor while our ancestors and their posteriors who have been smooching their ancestors' posteriors the whole time are wrong. We have to grant this new analysis to the existence of our new machines rather than to some brilliant mind. The points that are being exposed here are of a primitive and simplistic nature. What is being exposed here is the programmability of the human mind. This occurs en masse and that it strikes the heart of the Queen suggest that we are on the cusp of something new. This new stance will appear as nihilistic to some as atheism does to the devout Catholic. It is not as if one has any greater intelligence than the other but rather that they operate from differing assumptions on reality. For the Catholic mathematician he or she can hope to get to speak to Bertrand Russell about this point when they finally arrive. For the atheist this is it. Speak now or forever hold your peace. Squeak We Must.

There is no computation in set operations, the sets all alraedy exist.

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


#517622

Frommichael Rodriguez <michael.michael.10302@gmail.com>
Date2021-04-12 12:23 -0700
Message-ID<34d716a1-5432-40d0-9081-5f1c250976b1n@googlegroups.com>
In reply to#517557
Hey Tim, I caught you red-handed :

http://iconicmath.com/wordpress/wp-content/mymedia/IconicArithmeticTWOchs16-26-30public.210315.pdf
http://iconicmath.com/new/coming-in-may-2017-3/

...joking. It is from a web that you posted in other thread.

 Anyway, are you considering adapt Iconic stuff and mucke stuff into polysigns ?

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


#517968

Frommichael Rodriguez <michael.michael.10302@gmail.com>
Date2021-04-14 15:31 -0700
Message-ID<9668a17f-a988-48e8-988d-88594df640c2n@googlegroups.com>
In reply to#517622

[post vaccinated against lamerization and doubly periodic lamerization,
 vaccine sponsored by the clingy duck]

$ := addition p6 

t = -11 $ +2 $ *13 $ #7 $ &3 $ @5 

t~ = -'11 $ +2 $ *'13 $ #7 $ &'3 $ @5  

1/t = (1/t)(t~/t~) = t~/(t·t~)

Expanding terms, only can remain terms with symbols +,#,@ and 
their additives


t~/(t·t~) = (-'11 $ +2 $ *'13 $ #7 $ &'3 $ @5)/( +'130 $ #'221 $ @'182 )

Since in the denominator only remain signs with values 2,4,0
and ready to cook since 2+2+2 = 4+4+4 = 0+0+0 = 2+4+0 (mod 6)
we proceed to complete the following cubic formula :

x^3 @ y^3 @ z^3 @ (3xyz)' = (x @ y @ z)(x^2 @ y^2 @ z^2 @ (xy)' @ (yz)' @ (zx)')

in this case we complete over +'130 $ #'221 $ @'182 

(t·t~) = +'130 $ #'221 $ @'182 = u  
note that u is (x @ y @ z)

u~~ = #16900 $ +48841 $ @33124 $ @'28730 $ +'23660 $ #'40222
u~~ = +25181 $ #'23322 $ @4394
note that u~~ is (x^2 @ y^2 @ z^2 @ (xy)' @ (yz)' @ (zx)')

t~/u = (t~/u)(u~~/u~~) = (t~·u~~)/(u·u~~) 

(t~·u~~) = -179309 $ +'28561 $ *'264147 $ #'35490 $ &'83993 $ @151593
(u·u~~) = @'3332849

it is observed that the denominator(u·u~~) has subp2 negative sign,therefore
we will send the negative p2 subsign (@') to the numerator :

(t~·u~~)(u·u~~) = ((t~·u~~)/(u·u~~))(@'1/@'1) = (t~·u~~·@'1)/(u·u~~·@'1)

(t~·u~~·@'1) = (-179309 $ +'28561 $ *'264147 $ #'35490 $ &'83993 $ @151593)(@'1)
(t~·u~~·@'1) = (-'179309 $ +28561 $ *264147 $ #35490 $ &83993 $ @'151593)
expanding the first and last term, since they are additive inverses we have :
-151593 $ +359463 $ *595049 $ #366392 $ &414895 $ @179309

Since in the denominator we have :
(u·u~~·@'1) = @3332849 = k
it is then possible to apply vacuum, and pump it as an "scalar" upwards, to the
legth component of the terms of the numerator :

vacuum( (t~·u~~·@'1)/k ) = v

v = -(151593/k) $ +(359463/k) $ *(595049/k) $ #(366392/k) $ &(414895/k) $ @(179309/k)

t·v = -(13566982/k) $ +(13566982/k) $ *(13566982/k) $ #(13566982/k) $ &(13566982/k) $ @(16899831/k)
t·v = @(3332849/k) = @(3332849/3332849) = @1
therefore v = reciprocalOf(t)

Certainly not San petro cactee

Maybe a alternative symbol to $ could be 光 or 先

An observation could be that to get the reciprocal of a p6 number, in a camouflaged way,
one is using substructures, you may call it subp2 and (not used explicitly here)subp3
since the factors of 6 are 2 and 3 (not a prime number)

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


#518202

FromTimothy Golden <timbandtech@gmail.com>
Date2021-04-16 14:09 -0700
Message-ID<b2c29abf-b820-4281-b1c2-61fda825639cn@googlegroups.com>
In reply to#517968
On Wednesday, April 14, 2021 at 6:31:35 PM UTC-4, michael Rodriguez wrote:
> [post vaccinated against lamerization and doubly periodic lamerization, 
> vaccine sponsored by the clingy duck] 
> 
> $ := addition p6 
> 
> t = -11 $ +2 $ *13 $ #7 $ &3 $ @5 
As far as I know we do not have a P5 sign yet. Yes, it would be nice to make it to P6 with traditional sign mechanics, but you are already forgoing this with your extra signage. Your expression with an '&' for sign 5 in P6 can simply read:
 t = @ 5 - 11 + 2 * 13 # 7 & 3
and there is no conflict. In reduced form we can as well simply say that:
 t = @ 3 - 9 * 11 # 5 & 1
so I really do disagree with your style since a most compact form is preferable. In fact we can proceed to simplify one character further if we allow:
   t = 3 - 9 * 11 # 5 & 1
where the identity sign remains silent; just as is done with real numbers, and this really is the same concept as getting rid of all those '$' characters, which may as well be '@' characters since they are the identity sign.

We cannot continue to assign higher sign symbols and maintain the mnemonic relation with the mnemonic conflict that '&' brings. What we can do is shift over to ordered notation. This reads:
 t = ( 5, 11, 2, 13, 7, 3 )
or in reduced form 
 t = ( 3, 9, 0, 11, 5, 1 )
and this notation comes at the penalty of having to express rudimentary values such as #a as
( 0, 0, 0, 0, a, 0 )
but this also could be stated as
  MU^4 a
where MU is minus unity.

> 
> t~ = -'11 $ +2 $ *'13 $ #7 $ &'3 $ @5 

I'm not understanding how this is general. I suppose thought that it should also be true that:
  t~ = @ 3 -' 9 *' 11 # 5 &' 1
where I am not fighting with your own usage of prime notation but am insisting on the simplifications that I lay out above. I'm not really liking the prime symbol in the middle, and I hate to be quibbling over notation, but really it is becoming troublesome to translate.

> 
> 1/t = (1/t)(t~/t~) = t~/(t·t~) 
> 
> Expanding terms, only can remain terms with symbols +,#,@ and 
> their additives 
> 
> 
> t~/(t·t~) = (-'11 $ +2 $ *'13 $ #7 $ &'3 $ @5)/( +'130 $ #'221 $ @'182 ) 
> 
> Since in the denominator only remain signs with values 2,4,0 
> and ready to cook since 2+2+2 = 4+4+4 = 0+0+0 = 2+4+0 (mod 6) 
> we proceed to complete the following cubic formula : 
> 
> x^3 @ y^3 @ z^3 @ (3xyz)' = (x @ y @ z)(x^2 @ y^2 @ z^2 @ (xy)' @ (yz)' @ (zx)') 
> 
> in this case we complete over +'130 $ #'221 $ @'182 
> 
> (t·t~) = +'130 $ #'221 $ @'182 = u 
> note that u is (x @ y @ z) 
> 
> u~~ = #16900 $ +48841 $ @33124 $ @'28730 $ +'23660 $ #'40222 
> u~~ = +25181 $ #'23322 $ @4394 
> note that u~~ is (x^2 @ y^2 @ z^2 @ (xy)' @ (yz)' @ (zx)') 
> 
> t~/u = (t~/u)(u~~/u~~) = (t~·u~~)/(u·u~~) 
> 
> (t~·u~~) = -179309 $ +'28561 $ *'264147 $ #'35490 $ &'83993 $ @151593 
> (u·u~~) = @'3332849 
> 
> it is observed that the denominator(u·u~~) has subp2 negative sign,therefore 
> we will send the negative p2 subsign (@') to the numerator : 
> 
> (t~·u~~)(u·u~~) = ((t~·u~~)/(u·u~~))(@'1/@'1) = (t~·u~~·@'1)/(u·u~~·@'1) 
> 
> (t~·u~~·@'1) = (-179309 $ +'28561 $ *'264147 $ #'35490 $ &'83993 $ @151593)(@'1) 
> (t~·u~~·@'1) = (-'179309 $ +28561 $ *264147 $ #35490 $ &83993 $ @'151593) 
> expanding the first and last term, since they are additive inverses we have : 
> -151593 $ +359463 $ *595049 $ #366392 $ &414895 $ @179309 
> 
> Since in the denominator we have : 
> (u·u~~·@'1) = @3332849 = k 
> it is then possible to apply vacuum, and pump it as an "scalar" upwards, to the 
> legth component of the terms of the numerator : 
> 
> vacuum( (t~·u~~·@'1)/k ) = v 
> 
> v = -(151593/k) $ +(359463/k) $ *(595049/k) $ #(366392/k) $ &(414895/k) $ @(179309/k) 
> 
> t·v = -(13566982/k) $ +(13566982/k) $ *(13566982/k) $ #(13566982/k) $ &(13566982/k) $ @(16899831/k) 
> t·v = @(3332849/k) = @(3332849/3332849) = @1 
> therefore v = reciprocalOf(t) 
> 
> Certainly not San petro cactee 
> 
> Maybe a alternative symbol to $ could be 光 or 先 

Yeah, well, as I said, we cannot keep these going so nicely. The early signs are clean mnemonically with the number of strokes to draw them being their sign. You know, another alternative would be to, say in P7:
 + # a = ( 0, 0, 0, 0, 0, 0, a )
and this would be consistent without any need for further notation, though it goes against my argument for concise notation, at least it is ordinary reuse.

> 
> An observation could be that to get the reciprocal of a p6 number, in a camouflaged way, 
> one is using substructures, you may call it subp2 and (not used explicitly here)subp3 
> since the factors of 6 are 2 and 3 (not a prime number)

I'm going to have to try and code this and I'm sorry this is the first I've read this and I just don't have the energy to follow it right now. I really do hope that you are correct and are close to the general solution. No matter what you deserve a ton of credit for your work, and one more complaint: You have so many pseudonyms going that I don't know who to call you any more.
Still I must say: keep up the good work. I am so happy to have somebody else to discuss with and really you are surpassing me in polysign now.

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


#518443

From"zelos...@gmail.com" <zelos.malum@gmail.com>
Date2021-04-18 21:53 -0700
Message-ID<544c0588-6f90-4da8-b0da-add6568057adn@googlegroups.com>
In reply to#518202
fredag 16 april 2021 kl. 23:10:01 UTC+2 skrev timba...@gmail.com:
> On Wednesday, April 14, 2021 at 6:31:35 PM UTC-4, michael Rodriguez wrote: 
> > [post vaccinated against lamerization and doubly periodic lamerization, 
> > vaccine sponsored by the clingy duck] 
> > 
> > $ := addition p6 
> > 
> > t = -11 $ +2 $ *13 $ #7 $ &3 $ @5
> As far as I know we do not have a P5 sign yet. Yes, it would be nice to make it to P6 with traditional sign mechanics, but you are already forgoing this with your extra signage. Your expression with an '&' for sign 5 in P6 can simply read: 
> t = @ 5 - 11 + 2 * 13 # 7 & 3 
> and there is no conflict. In reduced form we can as well simply say that: 
> t = @ 3 - 9 * 11 # 5 & 1 
> so I really do disagree with your style since a most compact form is preferable. In fact we can proceed to simplify one character further if we allow: 
> t = 3 - 9 * 11 # 5 & 1 
> where the identity sign remains silent; just as is done with real numbers, and this really is the same concept as getting rid of all those '$' characters, which may as well be '@' characters since they are the identity sign. 
> 
> We cannot continue to assign higher sign symbols and maintain the mnemonic relation with the mnemonic conflict that '&' brings. What we can do is shift over to ordered notation. This reads: 
> t = ( 5, 11, 2, 13, 7, 3 ) 
> or in reduced form 
> t = ( 3, 9, 0, 11, 5, 1 ) 
> and this notation comes at the penalty of having to express rudimentary values such as #a as 
> ( 0, 0, 0, 0, a, 0 ) 
> but this also could be stated as 
> MU^4 a 
> where MU is minus unity.
> > 
> > t~ = -'11 $ +2 $ *'13 $ #7 $ &'3 $ @5
> I'm not understanding how this is general. I suppose thought that it should also be true that: 
> t~ = @ 3 -' 9 *' 11 # 5 &' 1 
> where I am not fighting with your own usage of prime notation but am insisting on the simplifications that I lay out above. I'm not really liking the prime symbol in the middle, and I hate to be quibbling over notation, but really it is becoming troublesome to translate.
> > 
> > 1/t = (1/t)(t~/t~) = t~/(t·t~) 
> > 
> > Expanding terms, only can remain terms with symbols +,#,@ and 
> > their additives 
> > 
> > 
> > t~/(t·t~) = (-'11 $ +2 $ *'13 $ #7 $ &'3 $ @5)/( +'130 $ #'221 $ @'182 ) 
> > 
> > Since in the denominator only remain signs with values 2,4,0 
> > and ready to cook since 2+2+2 = 4+4+4 = 0+0+0 = 2+4+0 (mod 6) 
> > we proceed to complete the following cubic formula : 
> > 
> > x^3 @ y^3 @ z^3 @ (3xyz)' = (x @ y @ z)(x^2 @ y^2 @ z^2 @ (xy)' @ (yz)' @ (zx)') 
> > 
> > in this case we complete over +'130 $ #'221 $ @'182 
> > 
> > (t·t~) = +'130 $ #'221 $ @'182 = u 
> > note that u is (x @ y @ z) 
> > 
> > u~~ = #16900 $ +48841 $ @33124 $ @'28730 $ +'23660 $ #'40222 
> > u~~ = +25181 $ #'23322 $ @4394 
> > note that u~~ is (x^2 @ y^2 @ z^2 @ (xy)' @ (yz)' @ (zx)') 
> > 
> > t~/u = (t~/u)(u~~/u~~) = (t~·u~~)/(u·u~~) 
> > 
> > (t~·u~~) = -179309 $ +'28561 $ *'264147 $ #'35490 $ &'83993 $ @151593 
> > (u·u~~) = @'3332849 
> > 
> > it is observed that the denominator(u·u~~) has subp2 negative sign,therefore 
> > we will send the negative p2 subsign (@') to the numerator : 
> > 
> > (t~·u~~)(u·u~~) = ((t~·u~~)/(u·u~~))(@'1/@'1) = (t~·u~~·@'1)/(u·u~~·@'1) 
> > 
> > (t~·u~~·@'1) = (-179309 $ +'28561 $ *'264147 $ #'35490 $ &'83993 $ @151593)(@'1) 
> > (t~·u~~·@'1) = (-'179309 $ +28561 $ *264147 $ #35490 $ &83993 $ @'151593) 
> > expanding the first and last term, since they are additive inverses we have : 
> > -151593 $ +359463 $ *595049 $ #366392 $ &414895 $ @179309 
> > 
> > Since in the denominator we have : 
> > (u·u~~·@'1) = @3332849 = k 
> > it is then possible to apply vacuum, and pump it as an "scalar" upwards, to the 
> > legth component of the terms of the numerator : 
> > 
> > vacuum( (t~·u~~·@'1)/k ) = v 
> > 
> > v = -(151593/k) $ +(359463/k) $ *(595049/k) $ #(366392/k) $ &(414895/k) $ @(179309/k) 
> > 
> > t·v = -(13566982/k) $ +(13566982/k) $ *(13566982/k) $ #(13566982/k) $ &(13566982/k) $ @(16899831/k) 
> > t·v = @(3332849/k) = @(3332849/3332849) = @1 
> > therefore v = reciprocalOf(t) 
> > 
> > Certainly not San petro cactee 
> > 
> > Maybe a alternative symbol to $ could be 光 or 先
> Yeah, well, as I said, we cannot keep these going so nicely. The early signs are clean mnemonically with the number of strokes to draw them being their sign. You know, another alternative would be to, say in P7: 
> + # a = ( 0, 0, 0, 0, 0, 0, a ) 
> and this would be consistent without any need for further notation, though it goes against my argument for concise notation, at least it is ordinary reuse.
> > 
> > An observation could be that to get the reciprocal of a p6 number, in a camouflaged way, 
> > one is using substructures, you may call it subp2 and (not used explicitly here)subp3 
> > since the factors of 6 are 2 and 3 (not a prime number)
> I'm going to have to try and code this and I'm sorry this is the first I've read this and I just don't have the energy to follow it right now. I really do hope that you are correct and are close to the general solution. No matter what you deserve a ton of credit for your work, and one more complaint: You have so many pseudonyms going that I don't know who to call you any more. 
> Still I must say: keep up the good work. I am so happy to have somebody else to discuss with and really you are surpassing me in polysign now.
why do you keep on going with this? Sets are defined by their elements, so they do not have an order. End of story.

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


#518033

FromSergio <invalid@invalid.com>
Date2021-04-15 10:21 -0500
Message-ID<s59ll3$52i$2@gioia.aioe.org>
In reply to#516822
On 4/6/2021 10:29 AM, FredJeffries wrote:
>> I don't really see the point you are making. Especially where you say that 
>> { 0, 1 } 
>> has no order. Clearly you passed the zero first, and the one second. 
>> The denial of order is in a different stance. It is required that we remove the order from this set in order for it to become disordered. 
>> Upon ensuring this disorderly conduct of the set we will no longer be able to provide reliable operations such as union and intersection. 
>> You see, to access the elements of your set in a sensible fashion you'd like a concept like 
>> Element GetFirstElement() 
>> or even better 
>> Element GetElement( int order ) 
>> but these operations will not be possible on a set which lacks order. 
>> The best that you can have on the disordered set is simply 
>> Element GetElement() 
>> and because the set is disordered you can get the same element back twice from this algorithm. There is no looping through the element of the set because by definition the set lacks order. 
>> As far as I know, the methods of generating the disordered set access must be built from an ordered set and not the other way around. 
> 
> Tell us: When I scoop a cup of flour out of the bin in order to make some bread, which molecule of flour is the FIRST element of the set of molecules in the measuring cup?
> 
> When I step on a scales to find my weight, which is the FIRST quark in my body that gets weighed?
> 
> When I deposit my paycheck into my bank account, which is the FIRST penny that gets deposited?
> 
> When the Vogons blow up the earth, which is the FIRST atom that gets torn into its constituent parts?
> 
>  
> 

Dont know about all that, but the Vogons are aholes for sure.

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


#518143

FromVittorio Santiago-Rodriguez <vitsa118@ucla2ancw.ca>
Date2021-04-16 12:01 +0000
Message-ID<s5bubk$1n0d$1@gioia.aioe.org>
In reply to#518033
Sergio wrote:

>> When the Vogons blow up the earth, which is the FIRST atom that gets
>> torn into its constituent parts?
> 
> Dont know about all that, but the Vogons are aholes for sure.


2017 John Hopkins produced a document about an outbreak called SPARS in 
2025-2028. The are funded by the Gates foundation among others.

2017 Faucci said after this that there will be a surprise outbreak in 
Trump term

This document is shocking parallels what is going on with COVID!

They preplanned for conspiracies that would blame the vaccines, etc. Its 
pretty wild and scary.

https://stars.library.ucf.edu/cgi/viewcontent.cgi?
article=1029&context=jicrcr

“Vaccine Injury”
As time passed and more people across the United States were
vaccinated, claims of adverse side effects began to emerge. Several
parents claimed that their children were experiencing neurolog-
ical symptoms similar to those seen among livestock exposed to
the GMI vaccine. By May 2027, parental anxiety around this claim
had intensified to the point of lawsuits. That month, a group of
parents whose children developed mental retardation as a result of
encephalitis in the wake of Corovax vaccination sued the federal
government, demanding removal of the liability shield protecting
the pharmaceutical companies responsible for developing and
manufacturing Corovax.

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


#516663

FromTimothy Golden <timbandtech@gmail.com>
Date2021-04-04 21:26 -0700
Message-ID<7b494d4f-9852-432d-bdcd-aff1e10db3b8n@googlegroups.com>
In reply to#516584
On Sunday, April 4, 2021 at 11:08:55 AM UTC-4, Gus Gassmann wrote:
> On Saturday, 3 April 2021 at 09:38:21 UTC-3, timba...@gmail.com wrote: 
> > On Friday, April 2, 2021 at 12:07:34 PM UTC-4, Gus Gassmann wrote: 
> > > On Friday, 2 April 2021 at 08:47:29 UTC-3, timba...@gmail.com wrote: 
> > > > On Wednesday, March 31, 2021 at 8:21:56 AM UTC-4, Gus Gassmann wrote: 
> > > > > On Tuesday, 30 March 2021 at 20:56:47 UTC-3, timba...@gmail.com wrote: 
> > > > > > On Tuesday, March 30, 2021 at 1:27:56 PM UTC-4, Gus Gassmann wrote: 
> > > > > > > On Tuesday, 30 March 2021 at 14:03:42 UTC-3, timba...@gmail.com wrote: 
> > > > > > > > On Tuesday, March 30, 2021 at 9:18:35 AM UTC-4, Gus Gassmann wrote: 
> > > > > > > > > On Friday, 19 March 2021 at 20:30:30 UTC-3, timba...@gmail.com wrote: 
> > > > > > > > > > The set {red, green, blue} is ordered. To claim that it is not is a falsifiable statement. 
> > > > > > > > > [...] 
> > > > > > > > > Go ahead, falsify this statement. 
> > > > > > > > The work involved in destroying the order of the set 
> > > > > > > > { red, green, blue } 
> > > > > > > > is considerable. I find it interesting how inflexible minds are that have been trained on mathematics. 
> > > > > > > > 
> > > > > > > > There must be a philosophy of covering the ground. Especially when some fundamental choice exists, and the options can be covered, they ought to be covered. The option to allow the set definition 
> > > > > > > > { e1, e2, e3 } 
> > > > > > > > to be ordered is obvious, and this merely as a bifurcated system cannot be far off from formalization here. Yet which is the more primitive form: now we have a contentious problem and again we must state that mathematicians of yore had no compiler level of integrity to operate from. 
> > > > > > > > What appears simpler is not always so. 
> > > > > > > > 
> > > > > > > > Again also I must stress the notion of elementhood as something so primitive, and yet it is our very linguistics getting in the way, for we know which is more primitive to humans. We learn our first language out of thin air and so it should be true as well of mathematics. When a child learns their abc's and the set theorist has something to say about it, it goes something like this: 
> > > > > > > > "That's just fine Johnny. When the disonance in class rises as you all sing it try and stay focused on your version. Yell it if you must." 
> > > > > > > As FromTheRafters said, you can't prove that { red, green, blue } forces an order on the set. (And, yes, I knew that you wouldn't be able.) All you have is wishful thinking. Note how you yourself call the order an "option". Nothing more. I didn't sign up for that option; I don't need it. 
> > > > > > I don't believe that this is a matter of proof. This is merely a matter of construction. 
> > > > > It is distinctly *not* a matter of construction. You can construct sets by set operators such as union and intersection. Suppose you have the two sets {red, green, blue} and {red, blue, green}. I guess you would treat them as different sets, but what would you think is {red, green, blue} intersected with {red, blue, green}? 
> > > > > 
> > > > > Or take the two sets {1, 2, 3} and {5, 4, 3}. What is their union? 
> > > > > 
> > > > > The only way to make sense of the set operations is to declare sets as unordered. If you want to operate on ordered sets, you (Tim Golden) will have to work out what the order should be. 
> > > > > 
> > > > > [...] 
> > > > Well Gus, I didn't realize you has some grand plan going with your union there. We know that the answer to your question from within ordinary set theory is 
> > > > { 1, 2, 3, 4, 5 } 
> > > Not true. It could just as easily be {1, 2, 3, 5, 4}, ignoring the duplicates. *ORDER DOES NOT MATTER*. 
> > > > Now as you mention set operations making sense, Let's consider doing this union based on 1E6 elements in each of the source sets. Due to the disorder of the sets the operation will take quite some time to perform. Especially the insistence on the disordered medium of set theory would be very problematic mid way through your operation. You are bound to get bad results. 
> > > I have no clue what you mean by "bad results", and I doubt that you do, either. All I note is that you have admitted to being unable to find the union of two sets that contain a million elements each. That's pretty sad, actually. 
> > > > It is not actually possible to do a clean union on truly disordered sets. 
> > > WTF is a "clean union"? 
> > > > The checker will have no means of enumeration. 
> > > Who or what is the "checker", and what would be enumerated? There are clean and clear algorithms (in at most O(n^2) ops that will compute a union or an intersection of two finite sets. 
> > Well Sergio and Gus the gas man do have some tender under belly.
> [...] 
> 
> Fuck you, Tim Golden. If personal insults are all you have in response, this discussion is over.

Alright Gus, I do apologize, but I will also have to falsify your statement here. I have provided content. The rest is rhetoric. I will attempt not to name call unless you are being a dink. I sincerely apologize and understand just how rare such an event is here on usenet.

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


#516750

FromTimothy Golden <timbandtech@gmail.com>
Date2021-04-05 16:40 -0700
Message-ID<095440db-4b20-44f8-ad6d-8c518245e742n@googlegroups.com>
In reply to#516460
On Saturday, April 3, 2021 at 8:38:21 AM UTC-4, Timothy Golden wrote:
> On Friday, April 2, 2021 at 12:07:34 PM UTC-4, Gus Gassmann wrote: 
> > On Friday, 2 April 2021 at 08:47:29 UTC-3, timba...@gmail.com wrote: 
> > > On Wednesday, March 31, 2021 at 8:21:56 AM UTC-4, Gus Gassmann wrote: 
> > > > On Tuesday, 30 March 2021 at 20:56:47 UTC-3, timba...@gmail.com wrote: 
> > > > > On Tuesday, March 30, 2021 at 1:27:56 PM UTC-4, Gus Gassmann wrote: 
> > > > > > On Tuesday, 30 March 2021 at 14:03:42 UTC-3, timba...@gmail.com wrote: 
> > > > > > > On Tuesday, March 30, 2021 at 9:18:35 AM UTC-4, Gus Gassmann wrote: 
> > > > > > > > On Friday, 19 March 2021 at 20:30:30 UTC-3, timba...@gmail.com wrote: 
> > > > > > > > > The set {red, green, blue} is ordered. To claim that it is not is a falsifiable statement. 
> > > > > > > > [...] 
> > > > > > > > Go ahead, falsify this statement. 
> > > > > > > The work involved in destroying the order of the set 
> > > > > > > { red, green, blue } 
> > > > > > > is considerable. I find it interesting how inflexible minds are that have been trained on mathematics. 
> > > > > > > 
> > > > > > > There must be a philosophy of covering the ground. Especially when some fundamental choice exists, and the options can be covered, they ought to be covered. The option to allow the set definition 
> > > > > > > { e1, e2, e3 } 
> > > > > > > to be ordered is obvious, and this merely as a bifurcated system cannot be far off from formalization here. Yet which is the more primitive form: now we have a contentious problem and again we must state that mathematicians of yore had no compiler level of integrity to operate from. 
> > > > > > > What appears simpler is not always so. 
> > > > > > > 
> > > > > > > Again also I must stress the notion of elementhood as something so primitive, and yet it is our very linguistics getting in the way, for we know which is more primitive to humans. We learn our first language out of thin air and so it should be true as well of mathematics. When a child learns their abc's and the set theorist has something to say about it, it goes something like this: 
> > > > > > > "That's just fine Johnny. When the disonance in class rises as you all sing it try and stay focused on your version. Yell it if you must." 
> > > > > > As FromTheRafters said, you can't prove that { red, green, blue } forces an order on the set. (And, yes, I knew that you wouldn't be able.) All you have is wishful thinking. Note how you yourself call the order an "option". Nothing more. I didn't sign up for that option; I don't need it. 
> > > > > I don't believe that this is a matter of proof. This is merely a matter of construction. 
> > > > It is distinctly *not* a matter of construction. You can construct sets by set operators such as union and intersection. Suppose you have the two sets {red, green, blue} and {red, blue, green}. I guess you would treat them as different sets, but what would you think is {red, green, blue} intersected with {red, blue, green}? 
> > > > 
> > > > Or take the two sets {1, 2, 3} and {5, 4, 3}. What is their union? 
> > > > 
> > > > The only way to make sense of the set operations is to declare sets as unordered. If you want to operate on ordered sets, you (Tim Golden) will have to work out what the order should be. 
> > > > 
> > > > [...] 
> > > Well Gus, I didn't realize you has some grand plan going with your union there. We know that the answer to your question from within ordinary set theory is 
> > > { 1, 2, 3, 4, 5 } 
> > Not true. It could just as easily be {1, 2, 3, 5, 4}, ignoring the duplicates. *ORDER DOES NOT MATTER*. 
> > > Now as you mention set operations making sense, Let's consider doing this union based on 1E6 elements in each of the source sets. Due to the disorder of the sets the operation will take quite some time to perform. Especially the insistence on the disordered medium of set theory would be very problematic mid way through your operation. You are bound to get bad results. 
> > I have no clue what you mean by "bad results", and I doubt that you do, either. All I note is that you have admitted to being unable to find the union of two sets that contain a million elements each. That's pretty sad, actually. 
> > > It is not actually possible to do a clean union on truly disordered sets. 
> > WTF is a "clean union"? 
> > > The checker will have no means of enumeration. 
> > Who or what is the "checker", and what would be enumerated? There are clean and clear algorithms (in at most O(n^2) ops that will compute a union or an intersection of two finite sets.
> Well Sergio and Gus the gas man do have some tender under belly. Weak responses both. Here though I find a flaw.
> The gas man says: 
> "There are clean and clear algorithms (in at most O(n^2) ops that will compute a union or an intersection of two finite sets."
> and what he fails to confess is that these very algorithms will rely upon the orderly enumeration of the elements of these sets. 
> But he claims that his sets lack order. This is a conflict. 

With Gusto, I have to say that I do stand by this point. The content to name calling ratio here I find in review to be entirely acceptable. I did bother on the chance that I really was being an asshole to look up Gus Gasmann, and its just like Wolfgang Muckenheim! These whacky names are for real and I am caught out thinking they were screen names or something.  Still, I'd say I've responded so strongly to his claim here that he has essentially withdrawn it from the conversation by abandoning the conversation. It's fine. When these sorts of bugs show up they tend to come out in many ways. We will carry on and I will lick my finger and put a one up on the chalk board under 'Tim'. And for 'Gus' I think a minus one.

> 
> At best on disordered sets only a probablility of accurate union will be arrived at under the disordered method. 
> Let's now take this to the next level and offer up a method of accessing an element of a disordered set: 
> const Element & DisorderedSet::GetElement() 
> { // a disordered set will be required to return a random element of an ordered set. 
> // there is no other way to code this as far as I can tell. (AFAICT) 
> return OrderedSet.GetElement( OrderedSet.RandomElement(this)); 
> } 
> 
> Honestly I cannot guarantee that this code will compile but I do believe that the idea of the disordered set pre-existing the ordered set is a clear fallacy from the standpoint of ordinary logic. That you have fallen into your own trap here is a very good sticking point. Do not back out. Do not move one iota, for you have the jaws upon you now. Await help from some higher up authority to get you out of your predicament.
> > > When the requirement that sets contain no order goes out, secretly in their back pocket, the mathematicians kept an order that they did not want to admit. This order was the initial definition. Clearly you will have to rely upon that order to perform the union. 
> > Sure. Nobody is saying that you should consider every permutation of the elements before you can compute a union. But that sure as hell is not the same as a literal order, where 1 < 2 < 3 or, if the set is given as {1, 3, 2}, 1 < 3 < 2. In particular, I want to emphasize that {1, 2, 3} and {1, 3, 2} represent the same set. 
> > 
> > [...]

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


#516088

From"zelos...@gmail.com" <zelos.malum@gmail.com>
Date2021-03-30 22:15 -0700
Message-ID<c8f32ccd-87ef-4987-8240-84d59fbf65b4n@googlegroups.com>
In reply to#516023
tisdag 30 mars 2021 kl. 19:03:42 UTC+2 skrev timba...@gmail.com:
> On Tuesday, March 30, 2021 at 9:18:35 AM UTC-4, Gus Gassmann wrote: 
> > On Friday, 19 March 2021 at 20:30:30 UTC-3, timba...@gmail.com wrote: 
> > > The set {red, green, blue} is ordered. To claim that it is not is a falsifiable statement. 
> > [...] 
> > Go ahead, falsify this statement.
> The work involved in destroying the order of the set 
> { red, green, blue } 
> is considerable. I find it interesting how inflexible minds are that have been trained on mathematics. 
> 
> There must be a philosophy of covering the ground. Especially when some fundamental choice exists, and the options can be covered, they ought to be covered. The option to allow the set definition 
> { e1, e2, e3 } 
> to be ordered is obvious, and this merely as a bifurcated system cannot be far off from formalization here. Yet which is the more primitive form: now we have a contentious problem and again we must state that mathematicians of yore had no compiler level of integrity to operate from. 
> What appears simpler is not always so. 
> 
> Again also I must stress the notion of elementhood as something so primitive, and yet it is our very linguistics getting in the way, for we know which is more primitive to humans. We learn our first language out of thin air and so it should be true as well of mathematics. When a child learns their abc's and the set theorist has something to say about it, it goes something like this: 
> "That's just fine Johnny. When the disonance in class rises as you all sing it try and stay focused on your version. Yell it if you must."

We have defined it not to be ordered in sets because sets are defined by their elements and nothing else. From this we we can create ordered n-tuplets which is what you want.

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


#516108

FromTimothy Golden <timbandtech@gmail.com>
Date2021-03-31 05:39 -0700
Message-ID<9f45624b-f76e-41af-b141-6cda3f4186abn@googlegroups.com>
In reply to#516088
On Wednesday, March 31, 2021 at 1:15:46 AM UTC-4, zelos...@gmail.com wrote:
> tisdag 30 mars 2021 kl. 19:03:42 UTC+2 skrev timba...@gmail.com: 
> > On Tuesday, March 30, 2021 at 9:18:35 AM UTC-4, Gus Gassmann wrote: 
> > > On Friday, 19 March 2021 at 20:30:30 UTC-3, timba...@gmail.com wrote: 
> > > > The set {red, green, blue} is ordered. To claim that it is not is a falsifiable statement. 
> > > [...] 
> > > Go ahead, falsify this statement. 
> > The work involved in destroying the order of the set 
> > { red, green, blue } 
> > is considerable. I find it interesting how inflexible minds are that have been trained on mathematics. 
> > 
> > There must be a philosophy of covering the ground. Especially when some fundamental choice exists, and the options can be covered, they ought to be covered. The option to allow the set definition 
> > { e1, e2, e3 } 
> > to be ordered is obvious, and this merely as a bifurcated system cannot be far off from formalization here. Yet which is the more primitive form: now we have a contentious problem and again we must state that mathematicians of yore had no compiler level of integrity to operate from. 
> > What appears simpler is not always so. 
> > 
> > Again also I must stress the notion of elementhood as something so primitive, and yet it is our very linguistics getting in the way, for we know which is more primitive to humans. We learn our first language out of thin air and so it should be true as well of mathematics. When a child learns their abc's and the set theorist has something to say about it, it goes something like this: 
> > "That's just fine Johnny. When the disonance in class rises as you all sing it try and stay focused on your version. Yell it if you must."
> We have defined it not to be ordered in sets because sets are defined by their elements and nothing else. From this we we can create ordered n-tuplets which is what you want.

I appreciate your non-assaultive response, but in it do lay some more details worth turning over. We know of the bracket notation
   S = { e1, e2, e3, e4, ... en }
but really we know that only a few sets can be well stated this way. For instance
   S[Letters = { a, b, c, d, e, f, ..., x, y, z }
   S[Numbers] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 0 }
   S[Binary] = { 0, 1 }
   S[Hexadecimal] = { 0, 1, 2, 3, ..., 8, 9, A, B, C, D, E, F }
are all actual instances of useful discrete sets. What we find though is that their usage and nature is only elemental in a partial sense. It is their reuse in sequential combinations which then establish the representations that are generally useful. That these discrete forms take on modulo usage within representations (as our native tongue requires) denies any basic value to their elemental status. Having picked apart our words down to these letters we will find no meaning whatsoever. We will find statistical qualities such as a high frequency of 't' and 'e' yet this can do little to assign any meaning other than to identify the language in use as English.

As we get into mathematics more, we see that real analysis is a subject which attempts a purity above S[Numbers]. They engage with the value 'a' as a first instance and attempt to operate on a list of axioms as their basis, so in this way your statement is false: not all sets are defined via the bracket notation. Elementhood in the real numbers has gone to another form. The notion that we must first build the real numbers without any sense of order and then impose order on them all is about as senseless a pursuit I believe as one can muster.

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


#516110

FromTimothy Golden <timbandtech@gmail.com>
Date2021-03-31 05:47 -0700
Message-ID<6742bae9-8f04-4777-8e5c-6a0086d0a66an@googlegroups.com>
In reply to#516108
On Wednesday, March 31, 2021 at 8:39:37 AM UTC-4, Timothy Golden wrote:
> On Wednesday, March 31, 2021 at 1:15:46 AM UTC-4, zelos...@gmail.com wrote: 
> > tisdag 30 mars 2021 kl. 19:03:42 UTC+2 skrev timba...@gmail.com: 
> > > On Tuesday, March 30, 2021 at 9:18:35 AM UTC-4, Gus Gassmann wrote: 
> > > > On Friday, 19 March 2021 at 20:30:30 UTC-3, timba...@gmail.com wrote: 
> > > > > The set {red, green, blue} is ordered. To claim that it is not is a falsifiable statement. 
> > > > [...] 
> > > > Go ahead, falsify this statement. 
> > > The work involved in destroying the order of the set 
> > > { red, green, blue } 
> > > is considerable. I find it interesting how inflexible minds are that have been trained on mathematics. 
> > > 
> > > There must be a philosophy of covering the ground. Especially when some fundamental choice exists, and the options can be covered, they ought to be covered. The option to allow the set definition 
> > > { e1, e2, e3 } 
> > > to be ordered is obvious, and this merely as a bifurcated system cannot be far off from formalization here. Yet which is the more primitive form: now we have a contentious problem and again we must state that mathematicians of yore had no compiler level of integrity to operate from. 
> > > What appears simpler is not always so. 
> > > 
> > > Again also I must stress the notion of elementhood as something so primitive, and yet it is our very linguistics getting in the way, for we know which is more primitive to humans. We learn our first language out of thin air and so it should be true as well of mathematics. When a child learns their abc's and the set theorist has something to say about it, it goes something like this: 
> > > "That's just fine Johnny. When the disonance in class rises as you all sing it try and stay focused on your version. Yell it if you must." 
> > We have defined it not to be ordered in sets because sets are defined by their elements and nothing else. From this we we can create ordered n-tuplets which is what you want.
> I appreciate your non-assaultive response, but in it do lay some more details worth turning over. We know of the bracket notation 
> S = { e1, e2, e3, e4, ... en } 
> but really we know that only a few sets can be well stated this way. For instance 
> S[Letters = { a, b, c, d, e, f, ..., x, y, z } 
> S[Numbers] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 0 } 
> S[Binary] = { 0, 1 } 
> S[Hexadecimal] = { 0, 1, 2, 3, ..., 8, 9, A, B, C, D, E, F } 
> are all actual instances of useful discrete sets. What we find though is that their usage and nature is only elemental in a partial sense. It is their reuse in sequential combinations which then establish the representations that are generally useful. That these discrete forms take on modulo usage within representations (as our native tongue requires) denies any basic value to their elemental status. Having picked apart our words down to these letters we will find no meaning whatsoever. We will find statistical qualities such as a high frequency of 't' and 'e' yet this can do little to assign any meaning other than to identify the language in use as English. 

And of course this identification of English has to be done from the ordered set. From the insistence of the disordered set theory all that you will have is a count of letters, if even that. Possibly due to the intense lack of order within your set theory your own ability to even count elements will be nonexistent.

> 
> As we get into mathematics more, we see that real analysis is a subject which attempts a purity above S[Numbers]. They engage with the value 'a' as a first instance and attempt to operate on a list of axioms as their basis, so in this way your statement is false: not all sets are defined via the bracket notation. Elementhood in the real numbers has gone to another form. The notion that we must first build the real numbers without any sense of order and then impose order on them all is about as senseless a pursuit I believe as one can muster.

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


Page 8 of 9 — ← Prev page 1 2 3 4 5 6 7 [8] 9  Next page →

Back to top | Article view | sci.math


csiph-web