(under construction) Here is my second autobiography called - My two Awakenings I was a Boy Scout and I remember the pursuit of one particular merit badge really excited me; it was the Computers Merit Badge. Ever since then I've been fascinated by computers and calculators. In my Junior year in high school I bought a TI-58 and matching printer from money I earned from my Laundromat job. I was pretty heavily involved in chess at that time and soon found a way to make my calculator emulate playing chess by making random legal moves. I later wrote a better program, which had a few openings memorized, for computers. I also found that I could actually make a little money by selling biorhythms computed by my calculator. - [In the above I would like to talk about my life from 1983 to 1994. I would also like to talk about how my thought disorder helped me do more research than I would have otherwise. |
1979
| Here is a link to my first autobiography. Captivity’s Captor: Now is the Time for the Chorus of Conversion Dear Reader, journey through the most exciting educational experience of my life. Please be patient and understanding as you accompany me, because you may not understand why I had my particular priorities or why I made some decisions. My story begins back in 1994, and it is from that time-perspective that you may accompany me. Welcome to my cave. It is a damp, dark, and dreary fourth floor apartment where the dim light of an old television set continuously petitions my undivided interest. Yes, it, my dearest confidant is always there to greet me after work. The only thing as steadfastly present as the TV is total exhaustion from another ten-hour day of siding houses. Consequently, incapable of resisting its hypnotic power, I collapse into my recliner. The age-softened, albeit somewhat torn leather sensuously swaths my aching shoulders, once-broken back, and bruised neck. Hence, I assume a nearly horizontal position, leveraging my feet to just the optimum height for both snoozing and watching. My mind assures my heart; my job is through for this twenty-four hour ... Here is a link to the rest of my first auto- biography. |
Here is the rest of My two Awakenings
 |
| |
 |
| |
 |
| |
 |
| |
 |
| |
 |
| |
 |
| |
 |
| |
 |
| |
 |
Here are some record computations. If you know of any others let me know. See the full list in the above link.
On or about Dec 31, 1998, I computed 1 digit of the (additive inverse of ) CMRB with my TI-92s, by adding 1-sqrt(2)+3^(1/3)-4^(1/4)+... as far as I could. That first digit, by the way, is just 0. Then by using the sum feature, in
approximate mode, to compute ∑1000n=1(−1)n(n1/n), I computed the first correct decimal of CMRB=∑∞n=1(−1)n(n1/n−1) i.e. (.1). It gave (.1_91323989714) which is close to what Mathematica gives for summing to only an
upper limit of 1000.
On Jan 11, 1999, I computed 4 decimals(.1878) of CMRB with the Inverse Symbolic Calculator, with the command evalf( 0.1879019633921476926565342538468+sum((-1)^n* (n^(1/n)-1),n=140001..150000)); were
0.1879019633921476926565342538468 was the running total of t=sum((-1)^n* (n^(1/n)-1),n=1..10000), then t= t+the sum from (10001.. 20000), then t=t+the sum from (20001..30000) ... up to t=t+the sum from (130001..
140000).
In Jan of 1999, I computed 5 correct decimals (rounded to .18786)of CMRB using Mathcad 3.1 on a 50 MHz 80486 IBM 486 personal computer operating on Windows 95.
Shortly afterward I tried to compute 9 digits of CMRB using Mathcad 7 professional on the Pentium II mentioned below, by summing (-1)^x x^(1/x) for x=1 to 10,000,000, 20,000,000, and a many more, then linearly approximating
the sum to a what a few billion terms would have given.
On Jan 23, 1999, I computed 500 digits of CMRB with an online tool called Sigma. Remarkably the sum in 4. was correct to 6 of the 9 decimal places! See http://marvinrayburns.com/OriginalMRBPost.html if you can read the
printed and scanned copy there.
In September of 1999, I computed the first 5,000 digits of CMRB on a 350 MHz Pentium II with 64 Mb of RAM using the simple PARI commands \p 5000;sumalt(n=1,((-1)^n*(n^(1/n)-1))), after allocating enough memory.
On June 10-11, 2003 over a period, of 10 hours, on a 450 MHz P3 with an available 512 MB RAM, I computed 6,995 accurate digits of CMRB.
Using a Sony Vaio P4 2.66 GHz laptop computer with 960 MB of available RAM, at 2:04 PM 3/25/2004, I finished computing 8000 digits of CMRB.
On March 01, 2006, with a 3 GHz PD with 2 GB RAM available, I computed the first 11,000 digits of CMRB.
...
Washed away by Hurricane Ike -- on September 13, 2008 sometime between 2:00 PM - 8:00 PM EST an almost complete computation of 300,000 digits of CMRB was destroyed. Computed for a long 4015. Hours (23.899
weeks or 1.4454*10^7 seconds) on a 2.66 GHz Core 2 Duo using 64 bit Windows XP. Max memory used was 91 GB of RAM. The Mathematica 6.0 code used follows:
...
Here is my mini-cluster of the fastest 3 computers mentioned below: The one to the left is my custom-built extreme edition 6 core and later with an 8 core Xeon processor. The one in the center is my fast little 4 core Asus with
2400 MHz RAM. Then the one on the right is my fastest -- a Digital Storm 6 core overclocked to 4.7 GHz on all cores and with 3000 MHz RAM.
On or about Dec 31, 1998, I computed 1 digit of the (additive inverse of ) CMRB with my TI-92s, by adding 1-sqrt(2)+3^(1/3)-4^(1/4)+... as far as I could. That first digit, by the way, is just 0. Then by using the sum feature, in
approximate mode, to compute ∑1000n=1(−1)n(n1/n), I computed the first correct decimal of CMRB=∑∞n=1(−1)n(n1/n−1) i.e. (.1). It gave (.1_91323989714) which is close to what Mathematica gives for summing to only an
upper limit of 1000.
On Jan 11, 1999, I computed 4 decimals(.1878) of CMRB with the Inverse Symbolic Calculator, with the command evalf( 0.1879019633921476926565342538468+sum((-1)^n* (n^(1/n)-1),n=140001..150000)); were
0.1879019633921476926565342538468 was the running total of t=sum((-1)^n* (n^(1/n)-1),n=1..10000), then t= t+the sum from (10001.. 20000), then t=t+the sum from (20001..30000) ... up to t=t+the sum from (130001..
140000).
In Jan of 1999, I computed 5 correct decimals (rounded to .18786)of CMRB using Mathcad 3.1 on a 50 MHz 80486 IBM 486 personal computer operating on Windows 95.
Shortly afterward I tried to compute 9 digits of CMRB using Mathcad 7 professional on the Pentium II mentioned below, by summing (-1)^x x^(1/x) for x=1 to 10,000,000, 20,000,000, and a many more, then linearly approximating
the sum to a what a few billion terms would have given.
On Jan 23, 1999, I computed 500 digits of CMRB with an online tool called Sigma. Remarkably the sum in 4. was correct to 6 of the 9 decimal places! See http://marvinrayburns.com/OriginalMRBPost.html if you can read the
printed and scanned copy there.
In September of 1999, I computed the first 5,000 digits of CMRB on a 350 MHz Pentium II with 64 Mb of RAM using the simple PARI commands \p 5000;sumalt(n=1,((-1)^n*(n^(1/n)-1))), after allocating enough memory.
On June 10-11, 2003 over a period, of 10 hours, on a 450 MHz P3 with an available 512 MB RAM, I computed 6,995 accurate digits of CMRB.
Using a Sony Vaio P4 2.66 GHz laptop computer with 960 MB of available RAM, at 2:04 PM 3/25/2004, I finished computing 8000 digits of CMRB.
On March 01, 2006, with a 3 GHz PD with 2 GB RAM available, I computed the first 11,000 digits of CMRB.
...
Washed away by Hurricane Ike -- on September 13, 2008 sometime between 2:00 PM - 8:00 PM EST an almost complete computation of 300,000 digits of CMRB was destroyed. Computed for a long 4015. Hours (23.899
weeks or 1.4454*10^7 seconds) on a 2.66 GHz Core 2 Duo using 64 bit Windows XP. Max memory used was 91 GB of RAM. The Mathematica 6.0 code used follows:
...
Here is my mini-cluster of the fastest 3 computers mentioned below: The one to the left is my custom-built extreme edition 6 core and later with an 8 core Xeon processor. The one in the center is my fast little 4 core Asus with
2400 MHz RAM. Then the one on the right is my fastest -- a Digital Storm 6 core overclocked to 4.7 GHz on all cores and with 3000 MHz RAM.
