Gottschalk v. Benson (1972)
- Docket
- 71-485
- Decided
- 1972-01-01
- Public Good score
- 72 / 100
- Framers' Intent score
- 72 / 100
Summary
Question: Is a computer program patentable? More specifically, is a mathematical procedure such as long division patentable? Conclusion: No and no. The Supreme Court held that a patent cannot cover all possible uses of a mathematical procedure or equation within a computer. That would be tantamount to granting the inventor a patent on the mathematical procedure itself, and this was no more acceptable than granting Samuel Morse a patent covering all possible uses of magnetism to communicate, rather than a narrower patent covering only the specific way in which Morse actually used magnetism to communicate in his telegraph. The court then said that "[i]f these programs are to be patentable, considerable problems are raised which only committees of Congress can manage ...." This decision was accepted as a final determination that computer programs were not patentable, and the Patent Office immediately ceased examining all computer program inventions. Very few patent applications directed to computer programs were filed until after the Supreme Court readdressed this issue in Diamond v. Diehr some nine years later. During these nine years, alternative ways of protecting computer programs were developed under the laws of copyright and trade secret which remain part of our law today.
Case Brief
Facts
Benson and Tabbot sought a patent on a method intended for implementation on a general-purpose digital computer. The claimed method related to converting signals from binary-coded decimal form into pure binary form, which the Court characterized as a mathematical procedure/algorithm. The claims were not limited to any particular machine implementation beyond use in a computer context, and would effectively cover the algorithm’s use in any computer. The Commissioner of Patents (Gottschalk) denied patentability on the ground that the claims were directed to an unpatentable mathematical algorithm. The dispute presented whether such a computer-implemented mathematical procedure could be patented.
Procedural History
The Patent Office rejected the application as claiming an unpatentable mathematical algorithm. The applicants appealed, and the United States Court of Customs and Patent Appeals ruled in their favor, effectively allowing the claims. The Commissioner of Patents petitioned for certiorari. The Supreme Court granted certiorari and reversed the CCPA.
Issue
Is a computer program patentable? More specifically, is a mathematical procedure such as long division patentable?
Holding
No. The Court held that the claimed method was not patentable because it would effectively preempt all uses of the underlying mathematical algorithm in a computer, which would amount to patenting the algorithm itself. (Vote count: Not available in sources.)
Rule
Abstract ideas such as mathematical procedures/algorithms are not patentable subject matter. A claim that, in practical effect, covers all uses of a mathematical algorithm—merely because it is performed on a general-purpose digital computer—impermissibly preempts the algorithm itself. The patent laws do not permit an inventor to obtain a monopoly over a mathematical formula or procedure by drafting claims that would cover any computer implementation. If computer programs are to be broadly patentable, the Court indicated that this raises policy and administrative problems better addressed by Congress.
Reasoning
The Court reasoned that the claims would wholly preempt the mathematical procedure, making it the functional equivalent of a patent on the algorithm itself rather than on a specific inventive application. It analogized this overbreadth to Samuel Morse’s invalid attempt to claim all uses of electromagnetism for communication rather than the specific telegraph implementation he devised. The Court emphasized that allowing such claims would effectively remove a fundamental mathematical tool from the public domain. It concluded that extending patent protection to such broadly claimed computer-implemented mathematical procedures presented substantial policy issues that should be managed by Congress rather than resolved by judicial expansion of patentable subject matter. (Specific statutory/constitutional citations and named precedents beyond the Morse analogy: Not available in sources.)
Significance
The decision was widely understood as foreclosing patents on computer programs and mathematical algorithms when claims effectively monopolize the underlying procedure. According to the provided sources, the Patent Office responded by ceasing examination of computer program inventions for a period, and software protection shifted toward copyright and trade secret. The case became a foundational precedent in the Court’s patentable-subject-matter doctrine concerning abstract ideas and algorithms. The Court later revisited related questions in Diamond v. Diehr, which the sources identify as occurring about nine years later.
Public Good Analysis
GPT: By treating broad claims to computer-implemented mathematical procedures as unpatentable abstractions, the decision limited monopolization of basic building blocks of computation, helping preserve competition and downstream innovation. It also signaled that major expansions of patentable subject matter with economy-wide effects should be addressed by Congress rather than by judicial enlargement of patent scope. | Claude: This decision significantly benefited public access to mathematical knowledge and basic computational methods by preventing monopolization of fundamental mathematical procedures. By keeping abstract algorithms in the public domain, it fostered innovation, allowed competitive software development, and prevented private entities from claiming ownership over basic mathematical concepts that serve as building blocks for technological advancement. However, it also temporarily stifled patent-based investment in software innovation for nearly a decade.
Framers' Intent Analysis
GPT: The ruling aligns with a framers-era understanding that exclusive rights should be confined to concrete “discoveries” and not extend to fundamental principles, consistent with Madison’s Federalist No. 43 justification of patents as a limited inducement for useful inventions rather than control over abstract knowledge. It also reflects separation-of-powers and limited-government instincts associated with Hamilton’s Federalist No. 78 by declining to create a sweeping new property entitlement absent clearer legislative direction under the Constitution’s Progress Clause. | Claude: The decision aligns well with the Framers' vision of patent law as expressed in Article I, Section 8, which grants Congress power to promote 'Progress of Science and useful Arts' through limited monopolies for specific inventions, not abstract ideas. Following Jefferson's philosophy that 'ideas should freely spread from one to another' and the narrow interpretation of patent grants exemplified in the Morse telegraph precedent, the Court properly distinguished between patentable applications and unpatentable abstract principles. The deference to Congress on policy questions also respects separation of powers and legislative primacy in establishing intellectual property regimes.