Abstract
The major thesis presented in this article is a focused standard of software patentability, in particular for pure computational methods or algorithms directed to the manipulation of numbers operating on a computer. The general philosophy is to compel inventors to narrow their claims to an algorithm expressed in terms of its utility and then to require that the particular utility or functionality be expressed in the claim as a limit on the claim, thus precluding the patent monopoly from being overbroad. As a corollary, any person is free to use or perhaps to patent the algorithm for a different utility outside the claims. The standard is consistent with existing statutes and with the trend which can be seen in the case law favorable to software patents.
Recommended Citation
Brooke Schumm III,
Escaping the World of I Know it When I See It: A New Test for Software Patent ability,
2
Mich. Telecomm. & Tech. L. Rev.
1
(1996).
Available at:
https://repository.law.umich.edu/mttlr/vol2/iss1/1
Included in
Computer Law Commons, Courts Commons, Intellectual Property Law Commons, Supreme Court of the United States Commons