LLMpediaThe first transparent, open encyclopedia generated by LLMs

Parker v. Flook

Generated by GPT-5-mini
Note: This article was automatically generated by a large language model (LLM) from purely parametric knowledge (no retrieval). It may contain inaccuracies or hallucinations. This encyclopedia is part of a research project currently under review.
Article Genealogy
Expansion Funnel Raw 50 → Dedup 0 → NER 0 → Enqueued 0
1. Extracted50
2. After dedup0 (None)
3. After NER0 ()
4. Enqueued0 ()
Parker v. Flook
Case nameParker v. Flook
Citations437 U.S. 584 (1978)
DecidedApril 24, 1978
CourtSupreme Court of the United States
PartiesParker (Petitioner) v. Flook (Respondent)
JudgesChief Justice Warren E. Burger; Justices William J. Brennan Jr., Potter Stewart, Byron White, Thurgood Marshall, Harry A. Blackmun, Lewis F. Powell Jr., John Paul Stevens (joined opinion), William H. Rehnquist (dissent)

Parker v. Flook

Parker v. Flook was a 1978 decision of the Supreme Court of the United States addressing patent eligibility under United States patent law for a method involving a mathematical algorithm applied to monitoring oil refining processes and calculating alarm limits. The Court's ruling constrained the scope of patentable subject matter, interacting with antecedent decisions such as Gottschalk v. Benson and influencing later rulings including Diamond v. Diehr and Bilski v. Kappos. The case involved parties from the petroleum industry and raised questions about the interplay between statutory interpretation of the Patent Act and judicially created exceptions for abstract ideas and natural phenomena.

Background

The dispute originated from a patent application owned by respondent Flook concerning a method for adjusting alarm limits in catalytic cracking units at refineries using a mathematical updating formula. The application was examined by the United States Patent and Trademark Office and rejected by the Board of Appeals (Patent), prompting appellate review in the United States Court of Customs and Patent Appeals before certiorari to the Supreme Court of the United States. The technology implicated processes familiar to engineers at Standard Oil, ExxonMobil, and firms operating fluid catalytic cracking units, and the legal question echoed issues litigated in Gottschalk v. Benson and debates among patent scholars at institutions like Harvard Law School and Yale Law School.

Supreme Court Decision

The Court, in an opinion authored by Chief Justice Warren E. Burger and joined by Justices John Paul Stevens and others, affirmed the rejection of the patent claims as unpatentable subject matter under §101 of the Patent Act of 1952. The majority emphasized precedent from Gottschalk v. Benson and applied a test that treated the claimed mathematical algorithm as an unpatentable abstract idea absent a novel application in a physical process. Justice William H. Rehnquist filed a dissent that questioned the majority's approach to distinguishing invention from abstract algorithmic steps and highlighted concerns raised in amicus briefs from trade groups such as the American Petroleum Institute.

The Court held that a claim incorporating a mathematical formula does not become patentable simply by being limited to a particular technological environment such as petroleum refining or by requiring post-solution activity in a process control setting. Drawing on Gottschalk v. Benson and referencing statutory terms in the Patent Act, the majority articulated that adding conventional or obvious post-solution activity to an algorithmic concept fails to transform the abstract idea into a patent-eligible application. The decision clarified that novelty under 35 U.S.C. § 102 and nonobviousness under 35 U.S.C. § 103 could not be circumvented by drafting claims to include routine industrial steps. The Court thus reinforced the judicially created exclusions for laws of nature, natural phenomena, and abstract ideas as shaped by prior cases such as Le Roy v. Tatham and later interpreted in Diamond v. Diehr.

Impact and Subsequent Developments

Parker v. Flook influenced lower courts and the United States Court of Appeals for the Federal Circuit in shaping standards for computer-implemented inventions and algorithms during the rise of software and semiconductor industries. Its reasoning was revisited and refined in Diamond v. Diehr and later in high-profile cases including Bilski v. Kappos, Alice Corp. v. CLS Bank International, and Mayo Collaborative Services v. Prometheus Laboratories, Inc., affecting patent practice at the United States Patent and Trademark Office and litigation strategies pursued by companies such as IBM, Microsoft, Intel, Google, and Apple Inc.. Academic commentary from scholars at Stanford Law School and Columbia Law School debated the decision's effect on innovation incentives, while legislative proposals in the United States Congress and policy reports issued by the Federal Trade Commission and U.S. Department of Commerce considered clarifying statutory standards for software and business-method patents.

Parker v. Flook sits within the doctrinal lineage that defines judicial exceptions to patent eligibility, alongside Gottschalk v. Benson, Diamond v. Diehr, Bilski v. Kappos, Mayo Collaborative Services v. Prometheus Laboratories, Inc., and Alice Corp. v. CLS Bank International. The case is frequently cited in analyses of §101 jurisprudence concerning mathematical algorithms, computer-implemented inventions, and the role of novelty and nonobviousness under 35 U.S.C. § 101, 35 U.S.C. § 102, and 35 U.S.C. § 103. It remains a touchstone in treatises like those by Richard A. Epstein and commentators at the Electronic Frontier Foundation when delineating the boundary between patentable technological applications and unpatentable abstract ideas.

Category:United States patent case law Category:1978 in United States case law