They did make a point of saying that business method patents are contemplated by the patent laws. I wasn't expecting that.
I wasn't expecting it either, but I was half expecting some sort of straight-on addressing of "business method" patents.
And, the point was so good that I'm annoyed that I didn't think of it -- if Section 273 presupposes the existence of "business method" patents, how can you interpret a different section of the same Code to ensure that "business method" patents would never exist? Congress has spoken and, implicitly at least, indicated that our patent system accommodates "business method" patents.
Hypo Future Argument:
Examiner: rejected under 101 using the M or T test
Applicant: So what, the M or T test isn't the "sole" test. Besides "“an application of a law of nature or mathematical formula to a known structure or process may well be deserving of patent protection.”
Examiner: that "may well be", but it doesn't meet the "important and useful" M or T test, and there is no real alternative provided by the courts so if you don't like it appeal. Given the previous history (Benson, Flook, Bliski) of shooting down processes and software I'll take my chances.
Applicant: throws hands up in the air realizing nothing has changed.
I'm thinking more along the lines as to how the various tests inter-relate to one another. I expect examiners to reject under Section 101 any claims that fail under any individual test, including T|M. My view is that a claim need only to pass muster under one test to be statutory.
In other words, which is right?
- Fail any test --> non-statutory.
- Pass any test --> statutory.
What I really worry about seeing is a rejection under Section 101 saying little more than the claim covers an abstract idea, see, e.g., Bilski, Flook, Benson. If the SCt can just declare claims too abstract without saying more (other than the claims are more like Benson and Flook than like Diehr), why couldn't an examiner. That's the part that really worries me.
I'm also really curious to see about if and under what circumstances a computer is a "particular machine." I have a hard-time reconciling with Benson. I might read it over with Flook. Perhaps it's that there's really only one way to convert EBCDIC to/from ASCII and it's more or less straight-forward. Hmmm.... Benson makes a lot more sense under Walter-Freeman-Abele than under T|M.
Regards.