Slashdot Mirror


Judge Invalidates Software Patent, Citing Bilski

bfwebster writes "US District Court Judge Andrew Gilford (Central District of California) granted a summary judgment motion in DealerTrack v. Huber et al., finding DealerTrack's patent (US 7,181,427) — for an automated credit application processing system — invalid due to the recent In re Bilski court decision that requires a patent to either involve 'transformation' or 'a specific machine.' According to Judge Gilford's ruling, DealerTrack 'appears to concede that the claims of the '427 Patent do not meet the "transformation" prong of the Bilski test.' He then applied the 'specific machine' test and noted that, post-Bilski the Board of Patent Appeals and Interferences has ruled several times that 'claims reciting the use of general purpose processors or computers do not satisfy the [Bilski] test.' Judge Gilford analyzes the claims of the '427 patent, notes that they state that the 'machine' involved could be a 'dumb terminal' and a 'personal computer,' and then concludes: 'None of the claims of the '427 Patent require the use of a "particular machine," and the patent is thus invalid under Bilski.' DealerTrack apparently plans to appeal the ruling. Interesting times ahead."

3 of 252 comments (clear)

  1. Re:Similar to Donald Knuth's Logic by MenThal · · Score: 5, Insightful

    His argument is simple: (1) math cannot be patented (2) all algorithms are math (3) all software is one or more algorithms and so follows that software cannot be patentable.

    While I agree with the sentiment, this isn't good logic. Since software is a combination of algorithms, the combination of those algorithms may be non-obvious and novel.

    I want SW-patents to go the way of the dodo as much as the next /.'er, but the above struck me as aking to A) atoms cannot be patented, B) all machines are made of one or more atoms, ergo machines cannot be patented.

  2. Re:Similar to Donald Knuth's Logic by russotto · · Score: 5, Insightful

    While I agree with the sentiment, this isn't good logic. Since software is a combination of algorithms, the combination of those algorithms may be non-obvious and novel.

    Any combination of algorithms in software is itself an algorithm. Knuth isn't arguing obviousness or novelty; he's arguing that software isn't patentable subject matter at all, no matter how non-obvious or novel it may be.

  3. Re:Similar to Donald Knuth's Logic by Anonymous Coward · · Score: 5, Insightful

    I want SW-patents to go the way of the dodo as much as the next /.'er, but the above struck me as aking to A) atoms cannot be patented, B) all machines are made of one or more atoms, ergo machines cannot be patented.

    There is a distinct difference between Knuth's logical progression and yours. It's a matter of a few words, which may seem nit-picky, but what manner of logic doesn't boil down to pure semantics?

    Knuth's "software cannot be patented" argument:
    * Math cannot be patented.
    * Algorithms ARE math.
    * Software IS a series of algorithms strung together (as an aside, a series of algorithms interacting is itself an algorithm)
    * Ergo, software cannot be patented

    Your counter-argument via analogy:
    * Atoms cannot be patented
    * Machines ARE MADE OF one or more atoms strung together
    * Ergo, machines cannot be patented

    Note the emphasized words: ARE versus ARE MADE OF. Math is not a tangible object, so there is no concept of "is made of" in that context. Atoms are tangible, albeit on a microscopic scale. Still, that's enough to say that a machine IS MADE OF specific atoms. However, you cannot say that a machine IS an atom. You can say that a machine IS a group of atoms, but that's not enough to warrant a patent; a machine is more than that. The group of atoms is crafted into unique and complex shapes, and those shapes are put together and mechanical force is applied to make it accomplish a task. That is what warrants a patent.

    I know exactly what you are about to think: aren't you doing the same thing to the series of algorithms? The answer is no. Math cannot be "crafted" into a "shape". It can describe a shape, but it is intangible. No mechanical force can act on math, and a solid object cannot be "made of math". An algorithm, quite simply, IS math; no more, no less. You can string together as many algorithms as you like, but all that does is create one larger algorithm. The same cannot be said about a physical object consisting of multiple atoms strung together.

    The end result of a software may fall under another system, like copyright or trademark. But the underlying logic is all math, and that cannot and should not fall under patent.