Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > sci.math > #416035 > unrolled thread
| Started by | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| First post | 2018-06-22 07:36 -0700 |
| Last post | 2018-07-05 14:08 +0200 |
| Articles | 20 on this page of 638 — 20 participants |
Back to article view | Back to sci.math
In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-06-22 07:36 -0700
Re: In the Binary Tree there ... Dan Christensen <Dan_Christensen@sympatico.ca> - 2018-06-22 07:46 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-22 08:00 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-22 08:07 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-22 08:12 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-22 08:21 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-22 08:33 -0700
Re: In the Binary Tree there ... Dan Christensen <Dan_Christensen@sympatico.ca> - 2018-06-22 08:05 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-06-22 08:50 -0700
Re: In the Binary Tree there ... Dan Christensen <Dan_Christensen@sympatico.ca> - 2018-06-22 09:26 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-06-22 09:36 -0700
Re: In the Binary Tree there ... Dan Christensen <Dan_Christensen@sympatico.ca> - 2018-06-22 09:41 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-06-22 09:49 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-22 10:16 -0700
Re: In the Binary Tree there ... Dan Christensen <Dan_Christensen@sympatico.ca> - 2018-06-22 10:23 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-06-22 11:43 -0700
Re: In the Binary Tree there ... Dan Christensen <Dan_Christensen@sympatico.ca> - 2018-06-22 12:07 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-06-23 03:11 -0700
Re: In the Binary Tree there ... Dan Christensen <Dan_Christensen@sympatico.ca> - 2018-06-23 06:10 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-22 13:11 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-22 13:19 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-06-23 03:11 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-23 04:55 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-23 05:01 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-06-23 06:40 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-23 07:10 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-23 07:13 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-06-22 18:47 -0500
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-06-23 03:11 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-06-23 07:32 -0500
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-06-23 06:19 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-06-24 09:26 -0500
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-06-24 07:44 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-24 08:00 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-24 08:05 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-06-24 08:14 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-24 08:27 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-24 08:36 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-24 09:00 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-06-25 20:46 -0500
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-06-26 04:10 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-06-26 13:34 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-26 13:38 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-06-26 14:01 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-26 14:14 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-26 14:23 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-26 14:26 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-06-26 14:38 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-26 15:24 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-26 15:28 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-26 15:33 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-26 15:51 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-26 15:59 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-26 16:09 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-26 16:23 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-26 16:29 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-26 16:35 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-26 16:47 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-26 16:51 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-26 16:53 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-26 17:01 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-26 17:14 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-26 17:20 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-26 17:27 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-26 17:29 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-26 17:35 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-26 17:39 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-26 17:52 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-26 19:02 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-26 19:33 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-27 00:58 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-27 01:03 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-27 06:54 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-26 17:19 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-06-26 20:48 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-26 21:13 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-06-26 14:33 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-26 14:34 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-26 14:49 -0700
Re: In the Binary Tree there ... j4n bur53 <janburse@fastmail.fm> - 2018-06-26 23:54 +0200
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-26 14:00 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-06-26 18:28 -0500
Re: In the Binary Tree there ... transfinity01@gmail.com - 2018-06-27 06:49 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-27 07:05 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-27 07:44 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-27 07:53 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-27 08:07 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-27 08:39 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-06-27 18:24 -0500
Re: In the Binary Tree there ... transfinity01@gmail.com - 2018-06-28 06:56 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-28 07:00 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-06-28 15:58 -0500
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-06-29 06:23 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-06-29 18:40 -0500
Re: In the Binary Tree there ... transfinity01@gmail.com - 2018-06-30 06:57 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-06-30 09:37 -0500
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-06-26 05:41 -0700
Re: In the Binary Tree there ... Dan Christensen <Dan_Christensen@sympatico.ca> - 2018-06-26 06:33 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-06-26 06:39 -0700
Re: In the Binary Tree there ... Dan Christensen <Dan_Christensen@sympatico.ca> - 2018-06-26 07:05 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-06-26 16:38 +0100
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-06-26 09:13 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-06-26 18:32 -0500
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-06-27 15:00 +0100
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-06-26 18:31 -0500
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-06-26 20:56 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-06-27 18:25 -0500
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-06-24 20:16 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-06-24 20:21 -0700
Re: In the Binary Tree there ... j4n bur53 <janburse@fastmail.fm> - 2018-06-22 17:33 +0200
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-22 08:42 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-22 08:48 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-06-22 09:03 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-22 09:12 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-06-22 09:41 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-22 09:50 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-06-22 09:56 -0700
Re: In the Binary Tree there ... j4n bur53 <janburse@fastmail.fm> - 2018-06-22 19:16 +0200
Re: In the Binary Tree there ... j4n bur53 <janburse@fastmail.fm> - 2018-06-22 19:23 +0200
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-06-22 08:58 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-22 09:00 -0700
Re: In the Binary Tree there ... j4n bur53 <janburse@fastmail.fm> - 2018-06-22 22:28 +0200
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-22 18:57 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-22 19:27 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-06-22 20:28 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-23 10:04 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-23 10:51 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-23 11:02 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-23 11:04 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-23 11:10 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-23 11:52 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-23 21:37 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-24 03:42 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-24 11:39 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-24 11:55 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-24 12:02 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-06-24 11:46 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-24 12:00 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-06-24 12:39 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-24 12:58 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-06-24 13:09 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-06-24 13:11 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-24 14:13 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-06-24 14:34 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-24 14:58 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-06-24 15:02 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-24 15:12 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-06-24 15:14 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-24 15:30 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-24 16:01 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-24 22:00 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-22 20:28 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-06-22 20:29 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-22 20:31 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-06-22 20:33 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-22 20:34 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-06-22 20:35 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-22 20:36 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-06-22 20:39 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-22 20:41 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-06-22 20:45 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-22 22:16 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-06-22 20:21 -0700
Re: In the Binary Tree there ... j4n bur53 <janburse@fastmail.fm> - 2018-06-23 05:47 +0200
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-06-22 20:50 -0700
Re: In the Binary Tree there ... j4n bur53 <janburse@fastmail.fm> - 2018-06-23 05:54 +0200
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-06-22 20:59 -0700
Re: In the Binary Tree there ... j4n bur53 <janburse@fastmail.fm> - 2018-06-23 06:02 +0200
Re: In the Binary Tree there ... Zelos Malum <zelos.malum@gmail.com> - 2018-06-24 22:58 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-06-25 02:42 -0700
Re: In the Binary Tree there ... Zelos Malum <zelos.malum@gmail.com> - 2018-06-25 22:50 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-06-26 04:12 -0700
Re: In the Binary Tree there ... Zelos Malum <zelos.malum@gmail.com> - 2018-06-26 23:05 -0700
Re: In the Binary Tree there ... transfinity01@gmail.com - 2018-06-27 06:42 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-06-27 18:26 -0500
Re: In the Binary Tree there ... transfinity01@gmail.com - 2018-06-28 06:53 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-06-28 16:00 -0500
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-06-28 14:17 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-06-28 14:55 -0700
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-06-29 02:04 +0200
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-06-28 19:36 -0500
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-06-29 06:30 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-06-29 18:45 -0500
Re: In the Binary Tree there ... transfinity01@gmail.com - 2018-06-30 06:57 -0700
Re: In the Binary Tree there ... transfinity01@gmail.com - 2018-06-30 07:03 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-06-30 09:42 -0500
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-06-30 14:41 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-06-30 22:45 -0500
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-06-30 21:56 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-01 04:14 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-01 12:57 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-01 13:05 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-02 05:04 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-02 08:04 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-02 05:04 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-02 06:13 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-02 06:39 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-02 06:54 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-02 06:59 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-02 07:34 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-02 08:25 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-02 10:22 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-02 10:35 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-02 11:38 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-02 11:44 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-02 18:13 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-02 11:38 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-07-01 20:37 -0500
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-02 11:39 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-07-02 18:50 -0500
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-03 05:49 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-07-03 19:26 -0500
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-04 04:26 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-07-04 20:31 -0500
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-05 03:50 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-07-05 06:22 -0500
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-05 14:17 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-07-05 17:24 -0500
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-06 03:38 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-07-06 18:23 -0500
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-07 03:25 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-07-07 16:41 -0500
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-08 05:20 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-07-08 21:42 -0500
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-09 05:09 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-07-09 18:40 -0500
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-10 01:47 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-07-10 18:26 -0500
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-11 05:48 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-07-11 11:21 -0500
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-11 09:53 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-07-11 17:06 -0500
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-11 21:50 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-07-12 14:51 -0500
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-12 13:22 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-07-12 20:43 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-13 10:54 +0100
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-07-13 04:17 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-13 12:34 +0100
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-07-13 04:49 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-07-13 04:51 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-07-13 05:06 -0700
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-07-13 15:17 +0200
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-13 04:46 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-13 14:38 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-13 14:46 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-13 14:56 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-07-13 15:23 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-07-13 15:15 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-13 15:39 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-14 05:14 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-14 06:52 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-14 06:54 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-14 06:58 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-14 09:52 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-16 15:47 +0100
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-24 22:48 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-13 12:03 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-13 22:19 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-13 04:41 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-12 05:49 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-07-12 14:53 -0500
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-13 04:41 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-07-14 15:57 -0500
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-15 04:38 -0700
Re: In the Binary Tree there ... jrennenkampff@googlemail.com - 2018-07-15 05:39 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-15 06:30 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-15 15:32 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-07-15 22:06 -0500
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-16 05:00 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-07-16 07:51 -0500
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-16 06:12 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-07-16 15:58 -0500
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-17 05:27 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-07-18 21:03 -0500
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-19 06:10 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-07-19 22:03 -0500
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-07-20 03:15 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-20 05:12 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-07-20 07:30 -0500
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-20 13:52 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-20 14:20 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-11 21:38 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-11 21:44 -0700
Re: In the Binary Tree there ... Zelos Malum <zelos.malum@gmail.com> - 2018-07-11 06:45 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-11 08:13 -0700
Re: In the Binary Tree there ... Zelos Malum <zelos.malum@gmail.com> - 2018-07-15 01:44 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-15 04:38 -0700
Re: In the Binary Tree there ... Zelos Malum <zelos.malum@gmail.com> - 2018-07-15 21:10 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-15 21:21 -0700
Re: In the Binary Tree there ... FromTheRafters <erratic@nomail.afraid.org> - 2018-07-16 09:21 -0400
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-16 06:48 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-16 13:35 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-17 05:20 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-07-17 05:29 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-17 10:53 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-07-17 11:31 -0700
Re: In the Binary Tree there ... Zelos Malum <zelos.malum@gmail.com> - 2018-07-17 22:39 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-17 22:47 -0700
Re: In the Binary Tree there ... FromTheRafters <erratic@nomail.afraid.org> - 2018-07-18 06:17 -0400
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-18 09:16 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-18 06:12 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-18 17:11 +0100
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-19 05:37 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-20 12:20 +0100
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-20 05:03 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-20 14:33 +0100
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-20 11:41 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-21 20:58 +0100
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-22 06:16 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-22 15:49 +0100
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-23 06:21 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-23 14:52 +0100
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-23 10:12 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-23 18:38 +0100
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-24 06:58 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-24 13:47 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-25 04:26 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-25 14:02 +0100
Re: In the Binary Tree there ... transfinity01@gmail.com - 2018-07-25 06:20 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-25 16:41 +0100
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-25 09:45 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-25 19:42 +0100
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-26 03:52 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-26 14:36 +0100
Re: In the Binary Tree there ... transfinity01@gmail.com - 2018-07-26 07:26 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-26 15:36 +0100
Re: In the Binary Tree there ... transfinity01@gmail.com - 2018-07-26 09:38 -0700
Re: In the Binary Tree there ... FredJeffries <fredjeffries@gmail.com> - 2018-07-26 11:37 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-26 12:21 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-26 14:35 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-26 14:41 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-26 15:13 -0700
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-07-26 16:42 +0200
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-25 12:35 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-26 03:50 -0700
Re: In the Binary Tree there ... "K_h" <KHolmes@SX729.com> - 2018-07-24 19:03 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-24 20:23 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-25 04:35 -0700
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-07-25 13:45 +0200
Re: In the Binary Tree there ... transfinity01@gmail.com - 2018-07-25 06:24 -0700
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-07-25 15:29 +0200
Re: In the Binary Tree there ... Jürgen R. <jurgenr@web.de> - 2018-07-25 21:51 +0200
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-25 12:57 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-26 03:47 -0700
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-07-26 12:58 +0200
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-26 05:32 -0700
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-07-26 14:36 +0200
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-07-26 14:40 +0200
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-26 06:56 -0700
Re: In the Binary Tree there ... transfinity01@gmail.com - 2018-07-26 07:28 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-26 07:32 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-26 14:24 +0100
Re: In the Binary Tree there ... transfinity01@gmail.com - 2018-07-26 07:26 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-26 15:43 +0100
Re: In the Binary Tree there ... transfinity01@gmail.com - 2018-07-26 09:38 -0700
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-07-26 18:46 +0200
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-07-26 18:50 +0200
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-26 05:36 -0700
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-07-26 14:42 +0200
Re: In the Binary Tree there ... transfinity01@gmail.com - 2018-07-26 07:30 -0700
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-07-26 16:41 +0200
Re: In the Binary Tree there ... jrennenkampff@googlemail.com - 2018-07-27 05:34 -0700
Re: In the Binary Tree there ... transfinity01@gmail.com - 2018-07-27 06:43 -0700
Re: In the Binary Tree there ... jrennenkampff@googlemail.com - 2018-07-29 04:14 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-25 14:02 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-25 14:13 -0700
Re: In the Binary Tree there ... "K_h" <KHolmes@SX729.com> - 2018-07-26 11:33 -0700
Re: In the Binary Tree there ... transfinity01@gmail.com - 2018-07-27 04:17 -0700
Re: In the Binary Tree there ... "K_h" <KHolmes@SX729.com> - 2018-07-27 12:03 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-27 13:03 -0700
Re: In the Binary Tree there ... transfinity01@gmail.com - 2018-07-28 05:58 -0700
Re: In the Binary Tree there ... Zeit Geist <Tucsondrew@me.com> - 2018-07-28 14:15 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-29 04:06 -0700
Re: In the Binary Tree there ... Zeit Geist <Tucsondrew@me.com> - 2018-07-29 12:27 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-30 01:35 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-30 04:39 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-30 07:32 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-30 07:39 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-30 07:46 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-30 09:09 -0700
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-07-30 18:15 +0200
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-30 11:36 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-30 11:45 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-30 11:48 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-30 12:03 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-30 12:11 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-31 04:05 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-31 04:48 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-31 05:25 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-31 10:02 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-31 12:47 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-31 12:59 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-31 14:01 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-31 14:27 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-31 15:10 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-31 15:51 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-31 17:14 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-31 20:44 -0700
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-07-31 14:45 +0200
Re: In the Binary Tree there ... "K_h" <KHolmes@SX729.com> - 2018-07-28 16:12 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-29 04:40 -0700
Re: In the Binary Tree there ... FredJeffries <fredjeffries@gmail.com> - 2018-07-29 11:55 -0700
Re: In the Binary Tree there ... "K_h" <KHolmes@SX729.com> - 2018-07-29 22:19 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-30 04:38 -0700
Re: In the Binary Tree there ... "K_h" <KHolmes@SX729.com> - 2018-07-30 13:48 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-31 04:15 -0700
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-07-31 14:42 +0200
Re: In the Binary Tree there ... "K_h" <KHolmes@SX729.com> - 2018-07-31 20:52 -0700
Re: In the Binary Tree there ... transfinity01@gmail.com - 2018-08-01 03:50 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-08-01 22:14 -0700
Re: In the Binary Tree there ... FredJeffries <fredjeffries@gmail.com> - 2018-08-02 16:29 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-08-02 16:35 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-08-02 22:55 -0700
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-08-03 11:59 +0200
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-08-03 09:46 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-08-03 11:04 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-08-01 22:10 -0700
Re: In the Binary Tree there ... Zeit Geist <Tucsondrew@me.com> - 2018-07-27 14:38 -0700
Re: In the Binary Tree there ... transfinity01@gmail.com - 2018-07-28 05:44 -0700
Re: In the Binary Tree there ... Zeit Geist <Tucsondrew@me.com> - 2018-07-28 14:12 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-29 04:06 -0700
Re: In the Binary Tree there ... Zeit Geist <Tucsondrew@me.com> - 2018-07-29 12:29 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-16 05:05 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-16 05:12 -0700
Re: In the Binary Tree there ... jrennenkampff@googlemail.com - 2018-07-16 05:27 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-16 06:07 -0700
Re: In the Binary Tree there ... Zelos Malum <zelos.malum@gmail.com> - 2018-07-16 23:08 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-17 06:24 -0700
Re: In the Binary Tree there ... Mike Hart <gmoralesor@gmail.com> - 2018-07-17 08:42 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-17 10:52 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-17 16:25 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-17 23:28 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-18 05:16 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-18 05:29 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-18 09:45 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-18 12:12 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-18 12:17 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-18 12:30 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-18 12:46 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-18 12:47 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-18 12:59 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-18 13:27 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-18 13:30 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-18 13:43 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-18 14:27 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-18 14:31 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-18 15:10 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-18 12:42 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-05 20:51 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-06 03:46 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-06 13:02 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-07-06 18:25 -0500
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-06 16:29 -0700
Re: In the Binary Tree there ... Zelos Malum <zelos.malum@gmail.com> - 2018-06-27 22:27 -0700
Re: In the Binary Tree there ... transfinity01@gmail.com - 2018-06-28 06:52 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-06-28 14:25 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-28 16:21 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-06-29 06:30 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-06-30 21:54 -0700
Re: In the Binary Tree there ... FredJeffries <fredjeffries@gmail.com> - 2018-07-01 11:37 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-02 13:10 -0700
Re: In the Binary Tree there ... FredJeffries <fredjeffries@gmail.com> - 2018-07-02 14:38 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-02 14:47 -0700
Re: In the Binary Tree there ... FredJeffries <fredjeffries@gmail.com> - 2018-07-02 18:06 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-21 15:22 -0700
Re: In the Binary Tree there ... Zelos Malum <zelos.malum@gmail.com> - 2018-06-28 22:37 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-06-29 06:36 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-29 07:45 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-29 07:52 -0700
Re: In the Binary Tree there ... transfinity01@gmail.com - 2018-06-29 12:57 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-29 16:56 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-06-29 17:01 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-29 18:23 -0700
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-06-30 14:47 +0200
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-06-30 09:46 -0700
Re: In the Binary Tree there ... transfinity01@gmail.com - 2018-06-30 07:13 -0700
Re: In the Binary Tree there ... Zelos Malum <zelos.malum@gmail.com> - 2018-07-03 02:09 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-03 06:03 -0700
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-07-03 15:11 +0200
Re: In the Binary Tree there ... Zelos Malum <zelos.malum@gmail.com> - 2018-07-04 01:50 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-04 04:30 -0700
Re: In the Binary Tree there ... jrennenkampff@googlemail.com - 2018-07-04 05:06 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-05 03:45 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-05 20:53 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-05 20:58 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-06 03:46 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-06 13:06 -0700
Re: In the Binary Tree there ... Zelos Malum <zelos.malum@gmail.com> - 2018-07-05 01:51 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-05 03:54 -0700
Re: In the Binary Tree there ... Zelos Malum <zelos.malum@gmail.com> - 2018-07-05 04:55 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-05 14:20 -0700
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-07-06 02:31 +0200
Re: In the Binary Tree there ... Zelos Malum <zelos.malum@gmail.com> - 2018-07-06 02:18 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-06 03:54 -0700
Re: In the Binary Tree there ... wpihughes@gmail.com - 2018-07-04 20:37 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-05 04:04 -0700
Re: In the Binary Tree there ... wpihughes@gmail.com - 2018-07-05 04:26 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-05 14:10 -0700
Re: In the Binary Tree there ... wpihughes@gmail.com - 2018-07-05 16:26 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-06 03:42 -0700
Re: In the Binary Tree there ... wpihughes@gmail.com - 2018-07-06 08:03 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-06 11:40 -0700
Re: In the Binary Tree there ... wpihughes@gmail.com - 2018-07-06 12:03 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-06 14:24 -0700
Re: In the Binary Tree there ... wpihughes@gmail.com - 2018-07-06 15:18 -0700
Re: In the Binary Tree there ... wpihughes@gmail.com - 2018-07-06 15:41 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-06 15:59 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-07 03:42 -0700
Re: In the Binary Tree there ... wpihughes@gmail.com - 2018-07-07 05:40 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-07 06:18 -0700
Re: In the Binary Tree there ... wpihughes@gmail.com - 2018-07-07 06:52 -0700
Re: In the Binary Tree there ... wpihughes@gmail.com - 2018-07-07 07:03 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-07 10:21 -0700
Re: In the Binary Tree there ... wpihughes@gmail.com - 2018-07-07 12:18 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-08 05:09 -0700
Re: In the Binary Tree there ... wpihughes@gmail.com - 2018-07-08 07:53 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-08 08:17 -0700
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-07-08 17:29 +0200
Re: In the Binary Tree there ... wpihughes@gmail.com - 2018-07-08 09:07 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-08 09:50 -0700
Re: In the Binary Tree there ... wpihughes@gmail.com - 2018-07-08 10:45 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-09 04:58 -0700
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-07-09 14:31 +0200
Re: In the Binary Tree there ... wpihughes@gmail.com - 2018-07-09 07:42 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-09 08:45 -0700
Re: In the Binary Tree there ... wpihughes@gmail.com - 2018-07-09 08:59 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-09 09:21 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-10 01:47 -0700
Re: In the Binary Tree there ... wpihughes@gmail.com - 2018-07-10 08:11 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-10 13:01 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-11 05:37 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-11 14:00 -0700
Re: In the Binary Tree there ... wpihughes@gmail.com - 2018-07-10 13:24 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-11 05:57 -0700
Re: In the Binary Tree there ... wpihughes@gmail.com - 2018-07-11 07:02 -0700
Re: In the Binary Tree there ... wpihughes@gmail.com - 2018-07-11 07:19 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-11 08:15 -0700
Re: In the Binary Tree there ... wpihughes@gmail.com - 2018-07-11 08:46 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-11 09:54 -0700
Re: In the Binary Tree there ... wpihughes@gmail.com - 2018-07-11 10:31 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-07-09 10:12 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-10 01:54 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-10 15:33 +0100
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-07-10 07:45 -0700
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-07-10 16:50 +0200
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-07-10 08:00 -0700
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-07-10 17:05 +0200
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-10 16:11 +0100
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-07-10 08:22 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-07-10 08:34 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-11 19:06 +0100
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-10 16:58 +0100
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-07-10 09:03 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-11 05:34 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-11 15:29 +0100
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-11 08:31 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-11 17:02 +0100
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-11 09:44 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-17 13:56 +0100
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-17 11:04 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-17 19:38 +0100
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-07-17 11:52 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-18 16:53 +0100
Re: In the Binary Tree there ... FredJeffries <fredjeffries@gmail.com> - 2018-07-18 09:46 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-07-18 10:05 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-18 18:54 +0100
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-07-18 11:16 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-18 11:42 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-18 13:14 -0700
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-07-19 02:02 +0200
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-19 05:28 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-19 13:40 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-20 11:54 +0100
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-07-20 04:41 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-20 13:01 +0100
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-07-20 10:27 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-21 20:49 +0100
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-07-22 23:51 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-23 14:45 +0100
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-20 05:52 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-20 14:36 +0100
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-20 11:44 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-20 11:56 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-20 13:25 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-20 13:33 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-21 21:11 +0100
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-22 06:07 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-22 07:42 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-18 16:00 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-07-18 19:17 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-18 19:19 -0700
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-07-18 19:23 -0700
Re: In the Binary Tree there ... "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-07-19 22:05 -0500
Re: In the Binary Tree there ... Julio Di Egidio <julio@diegidio.name> - 2018-07-20 03:12 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-18 05:58 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-18 06:19 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-18 06:28 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-19 05:28 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-19 13:42 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-19 13:55 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-19 14:05 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-19 14:20 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-19 15:08 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-19 15:15 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-20 05:43 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-20 13:36 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-18 17:04 +0100
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-19 05:33 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-20 12:08 +0100
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-20 06:14 -0700
Re: In the Binary Tree there ... bursejan@gmail.com - 2018-07-20 06:21 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-20 16:04 +0100
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-20 11:53 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-21 21:21 +0100
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-22 05:59 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-22 15:39 +0100
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-23 06:21 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-23 15:10 +0100
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-23 10:19 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-08 09:51 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-08 10:50 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-08 13:38 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-08 14:03 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-08 15:19 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-09 04:58 -0700
Re: In the Binary Tree there ... "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> - 2018-07-09 22:28 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-10 13:34 -0700
Re: In the Binary Tree there ... "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-07-10 14:47 -0700
Re: In the Binary Tree there ... Zelos Malum <zelos.malum@gmail.com> - 2018-07-09 01:34 -0700
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-09 04:59 -0700
Re: In the Binary Tree there ... Zelos Malum <zelos.malum@gmail.com> - 2018-07-11 06:44 -0700
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-07-07 01:58 +0200
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-07 03:27 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-06 11:32 +0100
Re: In the Binary Tree there ... WM <wolfgang.mueckenheim@hs-augsburg.de> - 2018-07-06 03:53 -0700
Re: In the Binary Tree there ... Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-07-06 12:27 +0100
Re: In the Binary Tree there ... Python <python@python.invalid> - 2018-07-05 14:08 +0200
Page 12 of 32 — ← Prev page 1 … 10 11 [12] 13 14 … 32 Next page →
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2018-07-07 03:25 -0700 |
| Message-ID | <960f6b96-9ec4-4b59-b7f5-7c70721eb3a8@googlegroups.com> |
| In reply to | #417400 |
Am Samstag, 7. Juli 2018 01:23:45 UTC+2 schrieb Shobe, Martin: > On 7/6/2018 5:38 AM, WM wrote: > > Am Freitag, 6. Juli 2018 00:24:25 UTC+2 schrieb Shobe, Martin: > >> Aleph_0 nodes is capable of separating 2^aleph_0 paths. > > > > Your quirk is to make this counterfactual claim. Every node is left by two bunches while one has come in. That is a simple calculation. > > Which natural number is aleph_0? That is irrelevant as longs as we assume that aleph_0 exists. Of course it is not a number but nonsense, but for the moment we assume that there are aleph_0 nodes. And aleph_0 is almost nothing compared to 2^aleph_0. > You need to show that it still holds > when the number of nodes isn't a natural number. You've never done that. It holds for every node at a finite position. Other nodes are not available. Therefore there is nothing else to show. > > For every node we have this separation: > > | > > o > > / \ > > What should be shown in addition? That every node is at a finite place? > > That aleph_0 is an upper bound on the paths. You've never shown that. A mathematician concludes it from the above diagram. No node can increase the number of splits by more than 1. Without more splits than nodes not more distinct paths than nodes. > > If we accept that there are infinite paths in the Binary Tree, then every path can be straigtened below any of its nodes by simply omitting the further nodes of this path. > > Should this procedure eliminate any path? Should it reduce their number? > > That will join an uncountable number of paths into a single path, No. All distinct paths that are in the ordinary Binary Tree will remain in the modified one because every node is left by the same number of distinct paths as before. > so > yes, it reduces their number. Wrong. Assume 10 straight lines are fixed to each node. Then every level of the modified tree is crossed by more paths than in the ordinary Binary Tree. This proves, in mathematics, that the limit cannot be less. > > >>>> Of course the paths split at nodes. I never said that they didn't. But > >>>> you still end up with an uncountable number of paths. > >>> > >>> Even if we let the number of nodes remain the same, but don't connect them and instead we fix two paths to every node? Would that result in uncountably many paths? > >> > >> Maybe. > > > > No, with certainty. > > It depends on how you do it. Fix 10 lines to every node. That makes the modified tree having not less paths than the original Binary Tree. > There are countable covers (we've been over that before). If what you're > doing results in one of those, then the number of paths in the cover > will (obviously) be countable. This doesn't result in an upper bound of > aleph_0 on the total number of paths as most of the paths don't stick to > a single path in the cover. I do not believe in undistinguishable paths. The set of paths separated by nodes and distinguishable from each other by nodes is countable. Luckily most sober minds can understand that. Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | "Shobe, Martin" <martin.shobe@yahoo.com> |
|---|---|
| Date | 2018-07-07 16:41 -0500 |
| Message-ID | <phrc24$jtr$1@dont-email.me> |
| In reply to | #417434 |
On 7/7/2018 5:25 AM, WM wrote: > Am Samstag, 7. Juli 2018 01:23:45 UTC+2 schrieb Shobe, Martin: >> On 7/6/2018 5:38 AM, WM wrote: >>> Am Freitag, 6. Juli 2018 00:24:25 UTC+2 schrieb Shobe, Martin: >>>> Aleph_0 nodes is capable of separating 2^aleph_0 paths. >>> >>> Your quirk is to make this counterfactual claim. Every node is left by two bunches while one has come in. That is a simple calculation. >> >> Which natural number is aleph_0? > > That is irrelevant as longs as we assume that aleph_0 exists. You tried to sneak in treating aleph_0 as a natural number. Asking you which one helps point that out. > Of course it is not a number but nonsense, but for the moment we assume that there are aleph_0 nodes. And aleph_0 is almost nothing compared to 2^aleph_0. Very good. But that doesn't address your error. >> You need to show that it still holds >> when the number of nodes isn't a natural number. You've never done that. > > It holds for every node at a finite position. Other nodes are not available. Therefore there is nothing else to show. For this utterance to be relevant, the number of nodes would need to be a node. That's even more nonsensical than your usual rants. So, you still need to show that it still holds when the number of nodes isn't a natural number. You still haven't done that. >>> For every node we have this separation: >>> | >>> o >>> / \ >>> What should be shown in addition? That every node is at a finite place? >> >> That aleph_0 is an upper bound on the paths. You've never shown that. > > A mathematician concludes it from the above diagram. No node can increase the number of splits by more than 1. Without more splits than nodes not more distinct paths than nodes. We aren't talking about a single node. What you need to do is show that it applies when there are aleph_0 nodes. You still haven't done that. >>> If we accept that there are infinite paths in the Binary Tree, then every path can be straigtened below any of its nodes by simply omitting the further nodes of this path. >>> Should this procedure eliminate any path? Should it reduce their number? >> >> That will join an uncountable number of paths into a single path, > > No. All distinct paths that are in the ordinary Binary Tree will remain in the modified one because every node is left by the same number of distinct paths as before. No, the number of paths leaving each node before the modification is uncountable. After the modification the number of paths is countable. In this case, the set of straightened paths, forms a cover of the regular paths. This does not show that aleph_0 is an upper bound for the number of regular paths. >> so >> yes, it reduces their number. > > Wrong. Assume 10 straight lines are fixed to each node. Then every level of the modified tree is crossed by more paths than in the ordinary Binary Tree. This proves, in mathematics, that the limit cannot be less. No. Even with 10 straight lines fixed to each node, there are fewer straightened paths then regular paths. The straightened paths form a cover of the regular paths, but that doesn't show that the number of straightened paths is an upper bound to the number of regular paths. >> There are countable covers (we've been over that before). If what you're >> doing results in one of those, then the number of paths in the cover >> will (obviously) be countable. This doesn't result in an upper bound of >> aleph_0 on the total number of paths as most of the paths don't stick to >> a single path in the cover. > > I do not believe in undistinguishable paths. Of course, instead you believe in inconsistent nonsense. Martin Shobe
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2018-07-08 05:20 -0700 |
| Message-ID | <b56db759-2ec3-483a-a175-f047eb29a568@googlegroups.com> |
| In reply to | #417475 |
Am Samstag, 7. Juli 2018 23:41:32 UTC+2 schrieb Shobe, Martin: > On 7/7/2018 5:25 AM, WM wrote: > You tried to sneak in treating aleph_0 as a natural number. Asking you > which one helps point that out. No. It is a cardinal number and as such a fixed quantity smaller than 2^aleph_0. Only that is what I use. > > > And aleph_0 is almost nothing compared to 2^aleph_0. > > Assume 10 straight lines are fixed to each node. Then every level of the modified tree is crossed by more paths than in the ordinary Binary Tree. This proves, in mathematics, that the limit cannot be less. > > No. Even with 10 straight lines fixed to each node, there are fewer > straightened paths then regular paths. Wrong. Since more distinct paths start from every node than in the ordinary case, there cannot be more in the latter. > The straightened paths form a > cover of the regular paths, but that doesn't show that the number of > straightened paths is an upper bound to the number of regular paths. It does show that more straightened paths can be distinguished than in the ordinary tree. > > > > I do not believe in undistinguishable paths. And therefore I give an upper bound of all distingusihable paths of the Binary Tree by placing all nodes on one and the same level. Since more paths cannot be distingusished, the upper bound is less than 2^aleph_0. Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | "Shobe, Martin" <martin.shobe@yahoo.com> |
|---|---|
| Date | 2018-07-08 21:42 -0500 |
| Message-ID | <phui37$att$1@dont-email.me> |
| In reply to | #417501 |
On 7/8/2018 7:20 AM, WM wrote: > Am Samstag, 7. Juli 2018 23:41:32 UTC+2 schrieb Shobe, Martin: >> On 7/7/2018 5:25 AM, WM wrote: >> You tried to sneak in treating aleph_0 as a natural number. Asking you >> which one helps point that out. > > No. It is a cardinal number and as such a fixed quantity smaller than 2^aleph_0. Only that is what I use. You use a property of finite trees (where the number of nodes is a natural number) to place a limit on an infinite tree. For that to be valid, aleph_0 would have to be a natural number. >>> And aleph_0 is almost nothing compared to 2^aleph_0. >>> Assume 10 straight lines are fixed to each node. Then every level of the modified tree is crossed by more paths than in the ordinary Binary Tree. This proves, in mathematics, that the limit cannot be less. >> >> No. Even with 10 straight lines fixed to each node, there are fewer >> straightened paths then regular paths. > > Wrong. Since more distinct paths start from every node than in the ordinary case, there cannot be more in the latter. Incorrect. There are the same number of straightened paths in both cases. In both cases, the number of straightened paths is less than the number of paths. >> The straightened paths form a >> cover of the regular paths, but that doesn't show that the number of >> straightened paths is an upper bound to the number of regular paths. > > It does show that more straightened paths can be distinguished than in the ordinary tree. Not at all. >>> I do not believe in undistinguishable paths. > > And therefore I give an upper bound of all distingusihable paths of the Binary Tree by placing all nodes on one and the same level. Since more paths cannot be distingusished, the upper bound is less than 2^aleph_0. Which level is that? The only levels are finite ones, so it can't be any of them. Martin Shobe
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2018-07-09 05:09 -0700 |
| Message-ID | <65f9e9a2-d4e9-4fb9-a292-6854ca3f8f58@googlegroups.com> |
| In reply to | #417545 |
Am Montag, 9. Juli 2018 04:42:52 UTC+2 schrieb Shobe, Martin: > On 7/8/2018 7:20 AM, WM wrote: > > Am Samstag, 7. Juli 2018 23:41:32 UTC+2 schrieb Shobe, Martin: > You use a property of finite trees (where the number of nodes is a > natural number) to place a limit on an infinite tree. No. I use a property of infinite mathematicsn namely analysis. > > >>> And aleph_0 is almost nothing compared to 2^aleph_0. > > >>> Assume 10 straight lines are fixed to each node. Then every level of the modified tree is crossed by more paths than in the ordinary Binary Tree. This proves, in mathematics, that the limit cannot be less. > >> > >> No. Even with 10 straight lines fixed to each node, there are fewer > >> straightened paths then regular paths. > > > > Wrong. Since more distinct paths start from every node than in the ordinary case, there cannot be more in the latter. > > Incorrect. There are the same number of straightened paths in both > cases. In both cases, the number of straightened paths is less than the > number of paths. In mathematics we have this argument: Every finite level is crossed by more straight lines in the modified tree than by distinguished path bunches in the original Binary Tree. This means that the limit of the latter cannot be larger. Simple as that. > > It does show that more straightened paths can be distinguished than in the ordinary tree. > > Not at all. Not in matheology perhaps, but I use mathematics. > > >>> I do not believe in undistinguishable paths. > > > > And therefore I give an upper bound of all distingusihable paths of the Binary Tree by placing all nodes on one and the same level. Since more paths cannot be distingusished, the upper bound is less than 2^aleph_0. > > Which level is that? The new level is an upper bound to all levels. > The only levels are finite ones, That shows that only a finite set of distinguished paths can exists. aleph_0 already is an upper limit. Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | "Shobe, Martin" <martin.shobe@yahoo.com> |
|---|---|
| Date | 2018-07-09 18:40 -0500 |
| Message-ID | <pi0rpe$kkg$1@dont-email.me> |
| In reply to | #417572 |
On 7/9/2018 7:09 AM, WM wrote: > Am Montag, 9. Juli 2018 04:42:52 UTC+2 schrieb Shobe, Martin: >> On 7/8/2018 7:20 AM, WM wrote: >>> Am Samstag, 7. Juli 2018 23:41:32 UTC+2 schrieb Shobe, Martin: > > >> You use a property of finite trees (where the number of nodes is a >> natural number) to place a limit on an infinite tree. > > No. I use a property of infinite mathematicsn namely analysis. There's no analysis (as in the branch of mathematics) in what you did. >>>>> And aleph_0 is almost nothing compared to 2^aleph_0. >> >>>>> Assume 10 straight lines are fixed to each node. Then every level of the modified tree is crossed by more paths than in the ordinary Binary Tree. This proves, in mathematics, that the limit cannot be less. >>>> >>>> No. Even with 10 straight lines fixed to each node, there are fewer >>>> straightened paths then regular paths. >>> >>> Wrong. Since more distinct paths start from every node than in the ordinary case, there cannot be more in the latter. >> >> Incorrect. There are the same number of straightened paths in both >> cases. In both cases, the number of straightened paths is less than the >> number of paths. > > In mathematics we have this argument: Every finite level is crossed by more straight lines in the modified tree than by distinguished path bunches in the original Binary Tree. Correct. > This means that the limit of the latter cannot be larger. Simple as that. The limit of the distinguished path bunches for a sequence of binary trees might very well be aleph_0. That does not make aleph_0 an upper bound on the number of paths in the binary tree. >>> It does show that more straightened paths can be distinguished than in the ordinary tree. >> >> Not at all. > > Not in matheology perhaps, but I use mathematics. You use an inconsistent mess of handwaving. >>>>> I do not believe in undistinguishable paths. >>> >>> And therefore I give an upper bound of all distingusihable paths of the Binary Tree by placing all nodes on one and the same level. Since more paths cannot be distingusished, the upper bound is less than 2^aleph_0. >> >> Which level is that? > > The new level is an upper bound to all levels. So it's not a level in the tree, and therefore doesn't show what you claim. Martin Shobe
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2018-07-10 01:47 -0700 |
| Message-ID | <068adb34-c7ec-4d2d-9a8e-d1f85f052392@googlegroups.com> |
| In reply to | #417601 |
Am Dienstag, 10. Juli 2018 01:40:36 UTC+2 schrieb Shobe, Martin: > On 7/9/2018 7:09 AM, WM wrote: > > Am Montag, 9. Juli 2018 04:42:52 UTC+2 schrieb Shobe, Martin: > >> On 7/8/2018 7:20 AM, WM wrote: > >>> Am Samstag, 7. Juli 2018 23:41:32 UTC+2 schrieb Shobe, Martin: > > > > > >> You use a property of finite trees (where the number of nodes is a > >> natural number) to place a limit on an infinite tree. > > > > No. I use a property of infinite mathematics namely analysis. > > There's no analysis (as in the branch of mathematics) in what you did. Analysis includes the theory of sequences and their limits, in particular the majorant criterion: If for all n: a_n < b_n, then the limit a_oo cannot be larger than the limit b_oo. That is what I use. > > > In mathematics we have this argument: Every finite level is crossed by more straight lines in the modified tree than by distinguished path bunches in the original Binary Tree. > > Correct. > > > This means that the limit of the latter cannot be larger. Simple as that. > > The limit of the distinguished path bunches for a sequence of binary > trees I do not consider a sequence of Binary Tree but one modified tree and its sequence of levels. > might very well be aleph_0. That does not make aleph_0 an upper > bound on the number of paths in the binary tree. Using mathematics we find that the limit L_oo of the sequence L_n "lines hitting level n" is not less in the modified tree than in the Binary Tree. No mathematician can contradict that. > >>> It does show that more straightened paths can be distinguished than in the ordinary tree. > >> > >> Not at all. > > > > Not in matheology perhaps, but I use mathematics. > > You use an inconsistent mess of handwaving. That is your job. But your handwaving is so completely counter-mathematical that no real mathematician will follow you. And no person thinking logically. If every finite level has more hits in the modified tree than in the Binary Tree, how should the latter have more hits in the limit? > > >>>>> I do not believe in undistinguishable paths. > >>> > >>> And therefore I give an upper bound of all distingusihable paths of the Binary Tree by placing all nodes on one and the same level. Since more paths cannot be distingusished, the upper bound is less than 2^aleph_0. > >> > >> Which level is that? > > > > The new level is an upper bound to all levels. > > So it's not a level in the tree, and therefore doesn't show what you claim. It shows the upper bound of possible distinctions. Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | "Shobe, Martin" <martin.shobe@yahoo.com> |
|---|---|
| Date | 2018-07-10 18:26 -0500 |
| Message-ID | <pi3fcd$kar$1@dont-email.me> |
| In reply to | #417625 |
On 7/10/2018 3:47 AM, WM wrote: > Am Dienstag, 10. Juli 2018 01:40:36 UTC+2 schrieb Shobe, Martin: >> On 7/9/2018 7:09 AM, WM wrote: >>> Am Montag, 9. Juli 2018 04:42:52 UTC+2 schrieb Shobe, Martin: >>>> On 7/8/2018 7:20 AM, WM wrote: >>>>> Am Samstag, 7. Juli 2018 23:41:32 UTC+2 schrieb Shobe, Martin: >>> >>> >>>> You use a property of finite trees (where the number of nodes is a >>>> natural number) to place a limit on an infinite tree. >>> >>> No. I use a property of infinite mathematics namely analysis. >> >> There's no analysis (as in the branch of mathematics) in what you did. > > Analysis includes the theory of sequences and their limits, in particular the majorant criterion: If for all n: a_n < b_n, then the limit a_oo cannot be larger than the limit b_oo. That is what I use. Don't lie. The number of paths isn't being presented as the limit of a sequence. >>> In mathematics we have this argument: Every finite level is crossed by more straight lines in the modified tree than by distinguished path bunches in the original Binary Tree. >> >> Correct. >> >>> This means that the limit of the latter cannot be larger. Simple as that. >> >> The limit of the distinguished path bunches for a sequence of binary >> trees > > I do not consider a sequence of Binary Tree but one modified tree and its sequence of levels. I didn't say that you considered a sequence of binary trees here. >> might very well be aleph_0. That does not make aleph_0 an upper >> bound on the number of paths in the binary tree. > > Using mathematics we find that the limit L_oo of the sequence L_n "lines hitting level n" is not less in the modified tree than in the Binary Tree. No mathematician can contradict that. But what you need is that the limit is at least a large as the number of paths in the original tree. You haven't shown that. >>>>> It does show that more straightened paths can be distinguished than in the ordinary tree. >>>> >>>> Not at all. >>> >>> Not in matheology perhaps, but I use mathematics. >> >> You use an inconsistent mess of handwaving. > > That is your job. But your handwaving is so completely counter-mathematical that no real mathematician will follow you. Since what you call a real mathematician is someone who contradicts themselves regularly, I'm fine with not being one in your eyes. >And no person thinking logically. If every finite level has more hits in the modified tree than in the Binary Tree, how should the latter have more hits in the limit? What hits? >>>>>>> I do not believe in undistinguishable paths. >>>>> >>>>> And therefore I give an upper bound of all distingusihable paths of the Binary Tree by placing all nodes on one and the same level. Since more paths cannot be distingusished, the upper bound is less than 2^aleph_0. >>>> >>>> Which level is that? >>> >>> The new level is an upper bound to all levels. >> >> So it's not a level in the tree, and therefore doesn't show what you claim. > > It shows the upper bound of possible distinctions. You need to show that. You haven't at this point. Martin Shobe
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2018-07-11 05:48 -0700 |
| Message-ID | <784b7380-e3c5-4bf1-a07b-be8f57af2255@googlegroups.com> |
| In reply to | #417671 |
Am Mittwoch, 11. Juli 2018 01:27:14 UTC+2 schrieb Shobe, Martin: > On 7/10/2018 3:47 AM, WM wrote: > > Am Dienstag, 10. Juli 2018 01:40:36 UTC+2 schrieb Shobe, Martin: > >> On 7/9/2018 7:09 AM, WM wrote: > >>> Am Montag, 9. Juli 2018 04:42:52 UTC+2 schrieb Shobe, Martin: > >>>> On 7/8/2018 7:20 AM, WM wrote: > >>>>> Am Samstag, 7. Juli 2018 23:41:32 UTC+2 schrieb Shobe, Martin: > >>> > >>> > >>>> You use a property of finite trees (where the number of nodes is a > >>>> natural number) to place a limit on an infinite tree. > >>> > >>> No. I use a property of infinite mathematics namely analysis. > >> > >> There's no analysis (as in the branch of mathematics) in what you did. > > > > Analysis includes the theory of sequences and their limits, in particular the majorant criterion: If for all n: a_n < b_n, then the limit a_oo cannot be larger than the limit b_oo. That is what I use. > > The number of paths isn't being presented as the limit of a > sequence. The number of nodes at level n is a sequence. It is the same as the number of path bunches to be distinguished at level n. It has no limit in mathematics, i.e., in potential infinity. It simply grows without end. But if we assume that "countable" is a meaningful notion and omega is a limit (as Cantor said), then we can prove that countably many path bunches can be distinguished. But not more. > > >>> In mathematics we have this argument: Every finite level is crossed by more straight lines in the modified tree than by distinguished path bunches in the original Binary Tree. > >> > >> Correct. > >> > >>> This means that the limit of the latter cannot be larger. Simple as that. > >> > >> The limit of the distinguished path bunches for a sequence of binary > >> trees > > > > I do not consider a sequence of Binary Tree but one modified tree and its sequence of levels. > > I didn't say that you considered a sequence of binary trees here. Two lines above you argued: "for a sequence of binary trees". > > >> might very well be aleph_0. That does not make aleph_0 an upper > >> bound on the number of paths in the binary tree. > > > > Using mathematics we find that the limit L_oo of the sequence L_n "lines hitting level n" is not less in the modified tree than in the Binary Tree. No mathematician can contradict that. > > But what you need is that the limit is at least a large as the number of > paths in the original tree. You haven't shown that. I consider only what can be proved. That is: Not more than aleph_0 nodes can exist at any level. This is the maximum of distinguishable path bunches. > > > If every finite level has more hits in the modified tree than in the Binary Tree, how should the latter have more hits in the limit? > > What hits? Lines crossing the level. > > >> So it's not a level in the tree, and therefore doesn't show what you claim. > > > > It shows the upper bound of possible distinctions. > > You need to show that. Try to figure it out by yourself. Start with a Binary Tree that has only two levels and try there to distinguish five paths bunches. Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | "Shobe, Martin" <martin.shobe@yahoo.com> |
|---|---|
| Date | 2018-07-11 11:21 -0500 |
| Message-ID | <pi5asd$uqf$1@dont-email.me> |
| In reply to | #417686 |
On 7/11/2018 7:48 AM, WM wrote: > Am Mittwoch, 11. Juli 2018 01:27:14 UTC+2 schrieb Shobe, Martin: >> On 7/10/2018 3:47 AM, WM wrote: >>> Am Dienstag, 10. Juli 2018 01:40:36 UTC+2 schrieb Shobe, Martin: >>>> On 7/9/2018 7:09 AM, WM wrote: >>>>> Am Montag, 9. Juli 2018 04:42:52 UTC+2 schrieb Shobe, Martin: >>>>>> On 7/8/2018 7:20 AM, WM wrote: >>>>>>> Am Samstag, 7. Juli 2018 23:41:32 UTC+2 schrieb Shobe, Martin: >>>>> >>>>> >>>>>> You use a property of finite trees (where the number of nodes is a >>>>>> natural number) to place a limit on an infinite tree. >>>>> >>>>> No. I use a property of infinite mathematics namely analysis. >>>> >>>> There's no analysis (as in the branch of mathematics) in what you did. >>> >>> Analysis includes the theory of sequences and their limits, in particular the majorant criterion: If for all n: a_n < b_n, then the limit a_oo cannot be larger than the limit b_oo. That is what I use. >> >> The number of paths isn't being presented as the limit of a >> sequence. > > The number of nodes at level n is a sequence. No it isn't. It's 2^n. > It is the same as the number of path bunches to be distinguished at level n. It has no limit in mathematics, i.e., in potential infinity. It simply grows without end. But if we assume that "countable" is a meaningful notion and omega is a limit (as Cantor said), then we can prove that countably many path bunches can be distinguished. But not more. Incorrect. >>>> might very well be aleph_0. That does not make aleph_0 an upper >>>> bound on the number of paths in the binary tree. >>> >>> Using mathematics we find that the limit L_oo of the sequence L_n "lines hitting level n" is not less in the modified tree than in the Binary Tree.. No mathematician can contradict that. >> >> But what you need is that the limit is at least a large as the number of >> paths in the original tree. You haven't shown that. > > I consider only what can be proved. You'd have to know what a proof is to do that. You appear not to. > That is: Not more than aleph_0 nodes can exist at any level. This is the maximum of distinguishable path bunches. Which level is the level that bounds the infinite binary tree? >>> If every finite level has more hits in the modified tree than in the Binary Tree, how should the latter have more hits in the limit? >> >> What hits? > > Lines crossing the level. That's uncountable at every level of the infinite binary tree. >>>> So it's not a level in the tree, and therefore doesn't show what you claim. >>> >>> It shows the upper bound of possible distinctions. >> >> You need to show that. > > Try to figure it out by yourself. So no proof. I'm not surprised. Martin Shobe
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2018-07-11 09:53 -0700 |
| Message-ID | <88e8b56e-5090-49ed-b12a-2fdf8b7275db@googlegroups.com> |
| In reply to | #417713 |
Am Mittwoch, 11. Juli 2018 18:22:44 UTC+2 schrieb Shobe, Martin: > On 7/11/2018 7:48 AM, WM wrote: > > The number of nodes at level n is a sequence. > > No it isn't. It's 2^n. It is the sequence f(n) = 2^n. > > > It is the same as the number of path bunches to be distinguished at level n. It has no limit in mathematics, i.e., in potential infinity. It simply grows without end. But if we assume that "countable" is a meaningful notion and omega is a limit (as Cantor said), then we can prove that countably many path bunches can be distinguished. But not more. > > Incorrect. Try to distinguish 5 paths in a Binary Tree with 2 levels. > > > I consider only what can be proved. > > You'd have to know what a proof is to do that. You appear not to. You cannot understand. Therefore I repeat my hint: Try to distinguish 5 paths in a Binary Tree with 2 levels. > >>>> So it's not a level in the tree, and therefore doesn't show what you claim. > >>> > >>> It shows the upper bound of possible distinctions. > >> > >> You need to show that. > > > > Try to figure it out by yourself. > > So no proof. I'm not surprised. Neither am I. Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | "Shobe, Martin" <martin.shobe@yahoo.com> |
|---|---|
| Date | 2018-07-11 17:06 -0500 |
| Message-ID | <pi5v25$1k5$1@dont-email.me> |
| In reply to | #417715 |
On 7/11/2018 11:53 AM, WM wrote: > Am Mittwoch, 11. Juli 2018 18:22:44 UTC+2 schrieb Shobe, Martin: >> On 7/11/2018 7:48 AM, WM wrote: > > >>> The number of nodes at level n is a sequence. >> >> No it isn't. It's 2^n. > > It is the sequence f(n) = 2^n. That sequence is not the number of nodes at any level. >>> It is the same as the number of path bunches to be distinguished at level n. It has no limit in mathematics, i.e., in potential infinity. It simply grows without end. But if we assume that "countable" is a meaningful notion and omega is a limit (as Cantor said), then we can prove that countably many path bunches can be distinguished. But not more. >> >> Incorrect. > > Try to distinguish 5 paths in a Binary Tree with 2 levels. We aren't dealing with a tree with 2 levels. What you can and can't do with a 2 level tree is not relevant to the complete infinite binary tree. >>> I consider only what can be proved. >> >> You'd have to know what a proof is to do that. You appear not to. > > You cannot understand. Therefore I repeat my hint: Try to distinguish 5 paths in a Binary Tree with 2 levels. For the to be relevant, the complete infinite binary tree would have to be a 2 level tree. It's not. Martin Shobe
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> |
|---|---|
| Date | 2018-07-11 21:50 -0700 |
| Message-ID | <pi6mlm$a9a$2@dont-email.me> |
| In reply to | #417752 |
On 7/11/2018 3:06 PM, Shobe, Martin wrote:
> On 7/11/2018 11:53 AM, WM wrote:
>> Am Mittwoch, 11. Juli 2018 18:22:44 UTC+2 schrieb Shobe, Martin:
>>> On 7/11/2018 7:48 AM, WM wrote:
>>
>>
>>>> The number of nodes at level n is a sequence.
>>>
>>> No it isn't. It's 2^n.
>>
>> It is the sequence f(n) = 2^n.
>
> That sequence is not the number of nodes at any level.
It does work for a perfectly balanced tree.
f(n, a) = a^n
Ternary example:
___________________
f(0, 3) = 3^0 = 1
f(1, 3) = 3^1 = 3
f(2, 3) = 3^2 = 9
f(3, 3) = 3^3 = 27
...
f(n) = a^n = infinite nodes
___________________
Binary using f(n, a):
f(0, 2) = 1 0 - Level 0 Root 1 Node
/ \
/ \
f(1, 2) = 2 1 2 - Level 1 2 Nodes
/ \ / \
f(2, 2) = 4 3 4 5 6 - Level 2 4 Nodes
>
>>>> It is the same as the number of path bunches to be distinguished at
>>>> level n. It has no limit in mathematics, i.e., in potential
>>>> infinity. It simply grows without end. But if we assume that
>>>> "countable" is a meaningful notion and omega is a limit (as Cantor
>>>> said), then we can prove that countably many path bunches can be
>>>> distinguished. But not more.
>>>
>>> Incorrect.
>>
>> Try to distinguish 5 paths in a Binary Tree with 2 levels.
>
> We aren't dealing with a tree with 2 levels. What you can and can't do
> with a 2 level tree is not relevant to the complete infinite binary tree.
>
>>>> I consider only what can be proved.
>>>
>>> You'd have to know what a proof is to do that. You appear not to.
>>
>> You cannot understand. Therefore I repeat my hint: Try to distinguish
>> 5 paths in a Binary Tree with 2 levels.
>
> For the to be relevant, the complete infinite binary tree would have to
> be a 2 level tree. It's not.
>
> Martin Shobe
>
[toc] | [prev] | [next] | [standalone]
| From | "Shobe, Martin" <martin.shobe@yahoo.com> |
|---|---|
| Date | 2018-07-12 14:51 -0500 |
| Message-ID | <pi8bic$el3$1@dont-email.me> |
| In reply to | #417786 |
On 7/11/2018 11:50 PM, Chris M. Thomasson wrote: > On 7/11/2018 3:06 PM, Shobe, Martin wrote: >> On 7/11/2018 11:53 AM, WM wrote: >>> Am Mittwoch, 11. Juli 2018 18:22:44 UTC+2 schrieb Shobe, Martin: >>>> On 7/11/2018 7:48 AM, WM wrote: >>> >>> >>>>> The number of nodes at level n is a sequence. >>>> >>>> No it isn't. It's 2^n. >>> >>> It is the sequence f(n) = 2^n. >> >> That sequence is not the number of nodes at any level. > > It does work for a perfectly balanced tree. No it doesn't. What you've shown is "The sequence of the number of nodes at level n." Now it's true that, speaking informally, that we can say "The number of nodes at level n is a sequence." and mean "The sequence of the number of nodes at level n.", but WM needs it to mean something else for his "proof" to go through. > > f(n, a) = a^n > > Ternary example: > ___________________ > f(0, 3) = 3^0 = 1 > f(1, 3) = 3^1 = 3 > f(2, 3) = 3^2 = 9 > f(3, 3) = 3^3 = 27 > .... > f(n) = a^n = infinite nodes > ___________________ > > > Binary using f(n, a): > > f(0, 2) = 1 0 - Level 0 Root 1 Node > / \ > / \ > f(1, 2) = 2 1 2 - Level 1 2 Nodes > / \ / \ > f(2, 2) = 4 3 4 5 6 - Level 2 4 Nodes Martin Shobe
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <invalid_chris_thomasson@invalid.invalid> |
|---|---|
| Date | 2018-07-12 13:22 -0700 |
| Message-ID | <pi8daj$q5d$1@dont-email.me> |
| In reply to | #417826 |
On 7/12/2018 12:51 PM, Shobe, Martin wrote: > On 7/11/2018 11:50 PM, Chris M. Thomasson wrote: >> On 7/11/2018 3:06 PM, Shobe, Martin wrote: >>> On 7/11/2018 11:53 AM, WM wrote: >>>> Am Mittwoch, 11. Juli 2018 18:22:44 UTC+2 schrieb Shobe, Martin: >>>>> On 7/11/2018 7:48 AM, WM wrote: >>>> >>>> >>>>>> The number of nodes at level n is a sequence. >>>>> >>>>> No it isn't. It's 2^n. >>>> >>>> It is the sequence f(n) = 2^n. >>> >>> That sequence is not the number of nodes at any level. >> >> It does work for a perfectly balanced tree. > > No it doesn't. What you've shown is "The sequence of the number of nodes > at level n." Right. Exactly. Sorry if I was ambiguous on this. The function: f(n, a) = a^n where n is the level and a is the aryness, gives the exact number of nodes in level n wrt a perfectly balanced tree. > Now it's true that, speaking informally, that we can say > "The number of nodes at level n is a sequence." and mean "The sequence > of the number of nodes at level n.", but WM needs it to mean something > else for his "proof" to go through. > >> >> f(n, a) = a^n >> >> Ternary example: >> ___________________ >> f(0, 3) = 3^0 = 1 >> f(1, 3) = 3^1 = 3 >> f(2, 3) = 3^2 = 9 >> f(3, 3) = 3^3 = 27 >> .... >> f(n) = a^n = infinite nodes >> ___________________ >> >> >> Binary using f(n, a): >> >> f(0, 2) = 1 0 - Level 0 Root 1 Node >> / \ >> / \ >> f(1, 2) = 2 1 2 - Level 1 2 Nodes >> / \ / \ >> f(2, 2) = 4 3 4 5 6 - Level 2 4 Nodes > > Martin Shobe >
[toc] | [prev] | [next] | [standalone]
| From | Julio Di Egidio <julio@diegidio.name> |
|---|---|
| Date | 2018-07-12 20:43 -0700 |
| Message-ID | <89838bfe-b97b-44e9-bc7b-5feddaf770bc@googlegroups.com> |
| In reply to | #417831 |
On Thursday, 12 July 2018 22:22:50 UTC+2, Chris M. Thomasson wrote: <snip> > The function: > > f(n, a) = a^n > > where n is the level and a is the aryness, gives the exact number of > nodes in level n wrt a perfectly balanced tree. And the exact number of paths (paths from the root to the last level). That's all fine in the finite (i.e. for n finite), but things aren't anymore simple when n is infinite (i.e. with infinite trees), in fact it's not anymore trivial how one "counts" in that case. E.g. are there more natural numbers than even naturals, or not? The question is already very technical, and the answer may actually vary (be grosser or finer), depending on details and capabilities of the specific systems... Julio
[toc] | [prev] | [next] | [standalone]
| From | Alan Smaill <smaill@SPAMinf.ed.ac.uk> |
|---|---|
| Date | 2018-07-13 10:54 +0100 |
| Message-ID | <fwed0vro3zr.fsf@foxtrot.inf.ed.ac.uk> |
| In reply to | #417856 |
Julio Di Egidio <julio@diegidio.name> writes:
> On Thursday, 12 July 2018 22:22:50 UTC+2, Chris M. Thomasson wrote:
> <snip>
>> The function:
>>
>> f(n, a) = a^n
>>
>> where n is the level and a is the aryness, gives the exact number of
>> nodes in level n wrt a perfectly balanced tree.
>
> And the exact number of paths (paths from the root to the last level).
if there is a last level.
> That's all fine in the finite (i.e. for n finite), but things
> aren't anymore simple when n is infinite (i.e. with infinite trees),
or even when we consider the whole tree, without any infinitely deep
level ("when n is infinite").
>
> Julio
--
Alan Smaill
[toc] | [prev] | [next] | [standalone]
| From | Julio Di Egidio <julio@diegidio.name> |
|---|---|
| Date | 2018-07-13 04:17 -0700 |
| Message-ID | <50ff76e5-417a-439e-91b7-4772d7a01085@googlegroups.com> |
| In reply to | #417867 |
On Friday, 13 July 2018 11:55:06 UTC+2, Alan Smaill wrote:
> Julio Di Egidio <julio@diegidio.name> writes:
> > On Thursday, 12 July 2018 22:22:50 UTC+2, Chris M. Thomasson wrote:
> > <snip>
> >> The function:
> >>
> >> f(n, a) = a^n
> >>
> >> where n is the level and a is the aryness, gives the exact number of
> >> nodes in level n wrt a perfectly balanced tree.
> >
> > And the exact number of paths (paths from the root to the last level).
>
> if there is a last level.
Which there certainly is *for all* n finite...
> > That's all fine in the finite (i.e. for n finite), but things
> > aren't anymore simple when n is infinite (i.e. with infinite trees),
>
> or even when we consider the whole tree, without any infinitely deep
> level ("when n is infinite").
There just is no such thing as an infinite tree without an infinite level:
proof is elementary and already provided, of that and of how incongruent is
your math. But by all means you feel entitled to just keep playing deft.
*Plonk*
Julio
[toc] | [prev] | [next] | [standalone]
| From | Alan Smaill <smaill@SPAMinf.ed.ac.uk> |
|---|---|
| Date | 2018-07-13 12:34 +0100 |
| Message-ID | <fwe601jnzdb.fsf@foxtrot.inf.ed.ac.uk> |
| In reply to | #417869 |
Julio Di Egidio <julio@diegidio.name> writes:
> On Friday, 13 July 2018 11:55:06 UTC+2, Alan Smaill wrote:
>> Julio Di Egidio <julio@diegidio.name> writes:
>> > On Thursday, 12 July 2018 22:22:50 UTC+2, Chris M. Thomasson wrote:
>> > <snip>
>> >> The function:
>> >>
>> >> f(n, a) = a^n
>> >>
>> >> where n is the level and a is the aryness, gives the exact number of
>> >> nodes in level n wrt a perfectly balanced tree.
>> >
>> > And the exact number of paths (paths from the root to the last level).
>>
>> if there is a last level.
>
> Which there certainly is *for all* n finite...
one of WM's favourite ambiguities is the use of "for all" in this
sort of context:
the ambiguity between the universally quantified claim, and a
claim about the collection.
>> > That's all fine in the finite (i.e. for n finite), but things
>> > aren't anymore simple when n is infinite (i.e. with infinite trees),
>>
>> or even when we consider the whole tree, without any infinitely deep
>> level ("when n is infinite").
>
> There just is no such thing as an infinite tree without an infinite level:
> proof is elementary and already provided, of that and of how incongruent is
> your math. But by all means you feel entitled to just keep playing deft.
rather than playing daft?
When you have |N U { w }, you can also have |N.
> *Plonk*
>
> Julio
--
Alan Smaill
[toc] | [prev] | [next] | [standalone]
| From | Julio Di Egidio <julio@diegidio.name> |
|---|---|
| Date | 2018-07-13 04:49 -0700 |
| Message-ID | <58d362ee-13f7-49fb-84ce-0e29be3c75d7@googlegroups.com> |
| In reply to | #417871 |
On Friday, 13 July 2018 13:35:07 UTC+2, Alan Smaill wrote:
> Julio Di Egidio <julio@diegidio.name> writes:
> > On Friday, 13 July 2018 11:55:06 UTC+2, Alan Smaill wrote:
> >> Julio Di Egidio <julio@diegidio.name> writes:
> >> > On Thursday, 12 July 2018 22:22:50 UTC+2, Chris M. Thomasson wrote:
> >> > <snip>
> >> >> The function:
> >> >>
> >> >> f(n, a) = a^n
> >> >>
> >> >> where n is the level and a is the aryness, gives the exact number of
> >> >> nodes in level n wrt a perfectly balanced tree.
> >> >
> >> > And the exact number of paths (paths from the root to the last level).
> >>
> >> if there is a last level.
> >
> > Which there certainly is *for all* n finite...
>
> one of WM's favourite ambiguities is the use of "for all" in this
> sort of context:
> the ambiguity between the universally quantified claim, and a
> claim about the collection.
Except that I am not WM and you are still in plain denial of elementary facts.
> >> > That's all fine in the finite (i.e. for n finite), but things
> >> > aren't anymore simple when n is infinite (i.e. with infinite trees),
> >>
> >> or even when we consider the whole tree, without any infinitely deep
> >> level ("when n is infinite").
> >
> > There just is no such thing as an infinite tree without an infinite level:
> > proof is elementary and already provided, of that and of how incongruent is
> > your math. But by all means you feel entitled to just keep playing deft.
>
> rather than playing daft?
>
> When you have |N U { w }, you can also have |N.
Except that your |N is invalid to begin with: there just is no such thing as
an infinite tree without an infinite level. But by all means you feel entitled
to just keep playing deft...
EOD.
*Plonk*
Julio
[toc] | [prev] | [next] | [standalone]
Page 12 of 32 — ← Prev page 1 … 10 11 [12] 13 14 … 32 Next page →
Back to top | Article view | sci.math
csiph-web