If your project works, then, it will reduce science to a problem in NP?
That's what other compression advocates want to do. In fact, it's pretty obvious that this is true - if you found an algorithm capable of computing the Kolmogorov complexity of any input string, you would pretty much put all theoretical scientists out of work. Unfortunately or not, this problem is uncomputable. Some people (Hutter et al) think, however, that it is possible to find good general purpose algorithms for computing approximations to the K-complexity.
I disagree - I think such algorithms are far out of reach. To me, the compression idea is intere...
There must be quite a few undergrad/graduate/post-doc/???-level researchers on LessWrong. I'm interested in hearing about your work. I'll post about myself in the comments.