I have gone back and forth, thinking that I found a way to disprove the theory and then discovering that my disproof was probably wrong. Right now, I feel that I will be able to get it to work, because the concepts look reasonable, but on the other hand, I could write persuasive arguments about why it should work and I could write persuasive arguments about why it should not work. I have been having trouble testing the theory out because I kept losing track of what I was doing. Yesterday, for the first time I began writing the algorithm for the simple part, which I am certain will work. It was like a ceremonial victory of some kind. The first thing I discovered was that it was heavily symmetrical. In retrospect I should have expected this, but it really amazed me when I first saw it. This means that if the theory works it can at the very least be compressed. But it suggests that it also can be made much more efficient than it will be as soon as I figure it out, (if it can be figured out.)
Thanks for the links. I just downloaded Ghostscript and I am looking forward to studying the lecture notes. Jim Bromer Lukasz Stafiniak <[EMAIL PROTECTED]> wrote: Lucky you, last time I proved P=NP it only lasted two days ;-) Some resources for people caught by this off-topic thread: - old year's celebrity: PCP Theorem by Gap Amplification http://www.cs.huji.ac.il/~dinuri/mypapers/combpcp.pdf - Introduction to Complexity Theory (Lecture Notes): http://www.wisdom.weizmann.ac.il/~oded/cc-sum.html - complexities do collapse at times (L=SL, 2004): Undirected ST-connectivity in Log-Space http://www.wisdom.weizmann.ac.il/~reingold/publications/sl.ps ----- This list is sponsored by AGIRI: http://www.agiri.org/email To unsubscribe or change your options, please go to: http://v2.listbox.com/member/?&; --------------------------------- Never miss a thing. Make Yahoo your homepage. ----- This list is sponsored by AGIRI: http://www.agiri.org/email To unsubscribe or change your options, please go to: http://v2.listbox.com/member/?member_id=8660244&id_secret=87116307-01937c
