Theory

Patents 5381145 and 5471206 (Was: The Harrington Compression Method)
On Aug 26, 11:24 pm, Einstein <michae...(a)gmail.com> wrote: Please try to at least act like your trying. I *did* try, successfully as it turns out, fixing the bugs in your method some 15 years ago! (I found an easy way to locate my patents on Internet: *another* James D. Allen, in Florida, has incorporated m... 28 Aug 2008 14:10

convergent alternating series
On Aug 27, 7:36 pm, ju...(a)diegidio.name wrote: On 28 Aug, 03:27, Mariano Suárez-Alvarez <mariano.suarezalva...(a)gmail.com> wrote: It would not hurt you to read up a bit on the convergence of series... I second that. Good night, Mariano. sounds like a great topic in particular t... 30 Aug 2008 17:16

Bursary Award - eCheminfo Community of Practice Workshop, India, December 2008
I am posting details for the eCheminfo Community of Practice Drug Discovery Design Methods & Applications Workshop Meeting in December 2008 in Hyderabad, India. Please note that the deadline to apply for the bursary is September 12, 2008. Drug Discovery Design Methods & Applications Workshop December 15-18, 200... 27 Aug 2008 19:46

home shop 18 - computer peripherals
online computer shops - homeshop18 offers low price computers and peripherals online, an online shop to buy computer, computer parts, accessories, monitors, office products, printers and scanners online. please visit - http://www.homeshop18.com/shop/u/y/c-Computers-Q-and-Q-Peripherals/Home_Online-clI_2-cI_909- ... 27 Aug 2008 09:28

bispanning graphs
Hello, I recently stumbled upon bispanning graphs. A bispanning graph is a graph G=(V,E) so that E can be partitoned into two sets P and Q so that (V,P) and (V,Q) are spanning trees of G. Asking google for "bispanning graph" gives only a few results at the local chair. So either this graph class is actually ... 27 Aug 2008 11:31

The Harrington Compression Method (HCM) White Paper.
Introduction: This is a lossless compression method which WILL work on random binary data and data considered Entropic. It involves one unique step previously not considered by others to obtain the compression. It can work on data in nearly any level you want, with a minimum to be yet calculated. It does this v... 3 Sep 2008 16:28

New compression theory announcement soon
On Wednesday I am doing a release of a new compression method, for peer review purposes, though Patent is Pending. This compression method will define a new range for Entropy, is lossless, and will not result in two files becoming the other. I am pre-preparing the different venues with the basic's so that whe... 26 Aug 2008 02:45

polysize description of truth table
Say there is a boolean circuit B with n number of inputs. The number of gates in the boolean circuit is polynomial in the size of n. Let O be the output string where O is the sequence of 0s and 1s obtained by traversing down the output column of the truth table of B. Let B1 be the boolean circuit which takes in t... 25 Aug 2008 02:12

The Computable Reals (beta)
The Computable Reals (beta) --------------------------- Julio Di Egidio (LV) julio at diegidio dot name (c)2008 LV on behalf of sci.math, sci.logic, comp.theory All right reserved. alpha: http://groups.google.co.uk/group/sci.logic/msg/25487daf70efed0e ============================================= We start f... 15 Sep 2008 20:28

question on relativization of an algorithm
Hello, I was reading Lance Fortnow's paper on relativization and I hit a bit of a snag as far as my understanding goes. "It is a misnomer to relativize a complexity class C. Instead, suppose we take an enumeration of machines for C and give them some access mechanism to an oracle set A. We then say the rel... 23 Aug 2008 21:39