en.swpat.org is a wiki. You can edit it. It may contain statements End Software Patents does not endorse.
May/June 2013: Help needed documenting events of May 2013
Sitemap • Countries • Why abolish software patents? • Studies • Case law • Patent office case law • Lawsuits
Parker v. Flook ruling by US Supreme Court on 22 June 1978
From en.swpat.org
Parker v Flook, 437 U.S. 584 (1978) was a case in the Supreme Court of the USA. The court found the patent invalid.
This ruling confirmed that math is not patentable, which is useful when arguing that software is math.
This was the second of the patentable subject matter "trilogy", along with Gottschalk v. Benson (1972) and Diamond v. Diehr (1981, USA).
[edit] Excerpts
Respondent's method for updating alarm limits during catalytic conversion processes, in which the only novel feature is a mathematical formula, held not patentable under 101 of the Patent Act.
(the ruling's first line)
[t]he process itself, not merely the mathematical algorithm [...] must be new and useful." at 591
[t]he notion that post-solution activity, no matter how conventional or obvious in itself, can transform an unpatentable principle into a patentable process exalts form over substance" because "[a] competent draftsman could attach some form of post-solution activity to almost any mathematical formula
[edit] External links
|
This wiki is part of the End Software Patents (ESP) campaign (donate). For more information, see: |
