Gottschalk v. Benson

Last updated
Gottschalk v. Benson
Seal of the United States Supreme Court.svg
Supreme Court of the United States
Argued October 16, 1972
Decided November 20, 1972
Full case nameGottschalk, Acting Commissioner of Patents v. Benson, et al.
Citations409 U.S. 63 ( more )
93 S. Ct. 253; 34 L. Ed. 2d 273; 1972 U.S. LEXIS 129; 175 U.S.P.Q. (BNA) 673
Case history
PriorApplication of Benson, 441 F.2d 682 (C.C.P.A. 1971), cert. granted, 405 U.S. 915(1972).
Subsequent Diamond v. Diehr , Diamond v. Chakrabarty
Holding
Respondents' method for converting numerical information from binary-coded decimal numbers into pure binary numbers, for use in programming conventional general-purpose digital computers is merely a series of mathematical calculations or mental steps and does not constitute a patentable "process" within the meaning of the Patent Act, 35 U.S.C. 100 (b). Pp. 64-73.
Court membership
Chief Justice
Warren E. Burger
Associate Justices
William O. Douglas  · William J. Brennan Jr.
Potter Stewart  · Byron White
Thurgood Marshall  · Harry Blackmun
Lewis F. Powell Jr.  · William Rehnquist
Case opinion
MajorityDouglas, joined by Burger, Brennan, White, Marshall, Rehnquist
Stewart, Blackmun, and Powell took no part in the consideration or decision of the case.
Laws applied
§ 101 of the Patent Act of 1952

Gottschalk v. Benson, 409 U.S. 63 (1972), was a United States Supreme Court case in which the Court ruled that a process claim directed to a numerical algorithm, as such, was not patentable because "the patent would wholly pre-empt the mathematical formula and in practical effect would be a patent on the algorithm itself." [1] That would be tantamount to allowing a patent on an abstract idea, contrary to precedent dating back to the middle of the 19th century. The ruling stated "Direct attempts to patent programs have been rejected [and] indirect attempts to obtain patents and avoid the rejection ... have confused the issue further and should not be permitted." [2] The case was argued on October 16, 1972, and was decided November 20, 1972.

Contents

Prior history

The case revolves around a patent application filed by inventors Gary Benson and Arthur Tabbot, for a method for converting binary-coded decimal (BCD) numerals into pure binary numerals on a general-purpose digital computer. [3] The patent examiner at the United States Patent Office, now called the U.S. Patent and Trademark Office or PTO, rejected the patent application as being directed to a mathematical expression. Pure mathematical expressions had been held to be unpatentable under earlier patent laws in Mackay Co. v. Radio Corp. [4] The applicant appealed to the Board of Patent Appeals and Interferences, which affirmed the examiner's rejection. The applicant further appealed to the Court of Customs and Patent Appeals. The Court reversed the Board. Finally, Commissioner of Patents Robert Gottschalk filed a petition for a writ of certiorari to the Supreme Court.

The case

The law which is applicable to this case is section 101 of the Patent Act of 1952. The question was whether or not the claimed invention was a "process" under the law. An older precendent held, that " a process was patentable if it brought about a useful, concrete, and tangible result."

The Court held that because the claim was not limited to any particular type of programmable digital computer and neither involved special purpose implementing machinery nor a transformation of substances, as in all prior cases holding processes patentable, the claim would effectively preclude use of the method for any currently known or future invention in any field. Thus the claim was directed to an algorithm alone and therefore was not patentable.

In its brief to the Supreme Court, the government asked the Court to hold that no process could be patented, unless it claimed either a transformation of substances or was implemented with a newly devised machine. This approach is known as machine-or-transformation test. The Court held that those criteria were "clues" to patent eligibility but declined to hold that they were necessary conditions for patent-eligibility in all cases, even though every case in which the Supreme Court had approved a process patent thus far had involved such a process.[reference needed]

Impact

This decision was widely seen as confirming that software by itself was not directly patentable. What patent attorneys agents had been doing in the meantime, however, was to get patent protection on software inventions by claiming the algorithm in combination with the general purpose digital computer programmed to carry out the algorithm. Thus they technically purported to be claiming a new machine and this, the lower patent court held, was patentable. [2]

The boundary between when a computer implemented process is purely an abstract idea (and thus not patentable) and when it is a process implementing the idea in a practical way (and thus is patentable) is still a matter of debate within the U.S. patent office. ("The Supreme Court has not been clear...as to whether such subject matter is excluded from the scope of 101 because it represents laws of nature, natural phenomena, or abstract ideas.") [5] It also remains a contested issue whether process patent claims must be directed to a transformation of substances or else embody a nontrivial, novel implementing machine or device. The PTO has taken this position in its arguments to the United States Court of Appeals for the Federal Circuit. See USPTO brief in In re Bilski . [6] The Government also so argued in briefing the Benson case. [7] The majority opinion in the Federal Circuit's opinion in In re Bilski adopts this position.

Notes

See also

Related Research Articles

The software patent debate is the argument about the extent to which, as a matter of public policy, it should be possible to patent software and computer-implemented inventions. Policy debate on software patents has been active for years. The opponents to software patents have gained more visibility with fewer resources through the years than their pro-patent opponents. Arguments and critiques have been focused mostly on the economic consequences of software patents.

Neither software nor computer programs are explicitly mentioned in statutory United States patent law. Patent law has changed to address new technologies, and decisions of the United States Supreme Court and United States Court of Appeals for the Federal Circuit (CAFC) beginning in the latter part of the 20th century have sought to clarify the boundary between patent-eligible and patent-ineligible subject matter for a number of new technologies including computers and software. The first computer software case in the Supreme Court was Gottschalk v. Benson in 1972. Since then, the Supreme Court has decided about a half dozen cases touching on the patent eligibility of software-related inventions.

State Street Bank and Trust Company v. Signature Financial Group, Inc., 149 F.3d 1368, also referred to as State Street or State Street Bank, was a 1998 decision of the United States Court of Appeals for the Federal Circuit concerning the patentability of business methods. State Street for a time established the principle that a claimed invention was eligible for protection by a patent in the United States if it involved some practical application and, in the words of the State Street opinion, "it produces a useful, concrete and tangible result."

Business method patents are a class of patents which disclose and claim new methods of doing business. This includes new types of e-commerce, insurance, banking and tax compliance etc. Business method patents are a relatively new species of patent and there have been several reviews investigating the appropriateness of patenting business methods. Nonetheless, they have become important assets for both independent inventors and major corporations.

Diamond v. Diehr, 450 U.S. 175 (1981), was a United States Supreme Court decision which held that controlling the execution of a physical process, by running a computer program did not preclude patentability of the invention as a whole. The high court reiterated its earlier holdings that mathematical formulas in the abstract could not be patented, but it held that the mere presence of a software element did not make an otherwise patent-eligible machine or process patent ineligible. Diehr was the third member of a trilogy of Supreme Court decisions on the patent-eligibility of computer software related inventions.

Patentable, statutory or patent-eligible subject matter is subject matter of an invention, which is considered appropriate for patent protection in a given country/authority. The laws and practices of many countries stipulate, that certain types of inventions should be denied patent protection. Together with criteria such as novelty, inventive step or nonobviousness, utility, and industrial applicability, which differ from country to country, the question of whether a particular subject matter is patentable is one of the substantive requirements for patentability.

Parker v. Flook, 437 U.S. 584 (1978), was a 1978 United States Supreme Court decision that ruled that an invention that departs from the prior art only in its use of a mathematical algorithm is patent eligible only if there is some other "inventive concept in its application." The algorithm itself must be considered as if it were part of the prior art, and the claim must be considered as a whole. The exact quotation from the majority opinion is: "Respondent’s process is unpatentable under §101, not because it contains a mathematical algorithm as one component, but because once that algorithm is assumed to be within the prior art, the application, considered as a whole, contains no patentable invention." "The fact that the algorithm may not have actually been known previously and that, when taken in combination with other claim elements, it might produce an invention that is novel and nonobvious, plays no part in the analysis."

Freeman-Walter-Abele is a now outdated judicial test in United States patent law. It came from three decisions of the United States Court of Customs and Patent Appeals—In re Freeman, 573 F.2d 1237, In re Walter, 618 F.2d 758 ; and In re Abele, 684 F.2d 902 —which attempted to comply with then-recent decisions of the Supreme Court concerning software-related patent claims.

<i>In re Bilski</i>

In re Bilski, 545 F.3d 943, 88 U.S.P.Q.2d 1385, was an en banc decision of the United States Court of Appeals for the Federal Circuit (CAFC) on the patenting of method claims, particularly business methods. The court affirmed the rejection of the patent claims involving a method of hedging risks in commodities trading, as non-patentable subject matter. Most importantly, the Court concluded, that machine-or-transformation test "was proper test to apply to determine patent-eligibility of process", and that the “useful, concrete and tangible result” of State Street Bank v. Signature Financial Group and AT&T Corp. v. Excel Communications, Inc. should no longer be relied upon.

Dann v. Johnston, 425 U.S. 219 (1976), is a decision of the United States Supreme Court on the patentability of a claim for a business method patent.

The exhausted combination doctrine, also referred to as the doctrine of theLincoln Engineeringcase, was the doctrine of U.S. patent law that when an inventor invents a new, unobvious device and seeks to patent not merely the new device but also the combination of the new device with a known, conventional device with which the new device cooperates in the conventional and predictable way in which devices of those types have previously cooperated, the combination is unpatentable as an "exhausted combination" or "old combination". The doctrine is also termed the doctrine of the Lincoln Engineering case because the United States Supreme Court explained the doctrine in its decision in Lincoln Engineering Co. v. Stewart-Warner Corp. This doctrine has been considered abrogated by the US Congress in 1952, when it passed the 1952 Patent Act.

In United States patent law, the machine-or-transformation test is a test of patent eligibility under which a claim to a process qualifies for consideration if (1) the process is implemented by a particular machine in a non-conventional and non-trivial manner or (2) the process transforms an article from one state to another.

<span class="mw-page-title-main">Piano roll blues</span>

The Piano Roll Blues or Old Piano Roll Blues is a figure of speech designating a legal argument made in US patent law relating to computer software. The argument is that a newly programmed general-purpose digital computer is a "new" machine and, accordingly, properly the subject of a US patent.

In United States patent law, a method, also called "process", is one of the four principal categories of things that may be patented through "utility patents". The other three are a machine, an article of manufacture, and a composition of matter.

Bilski v. Kappos, 561 U.S. 593 (2010), was a case decided by the Supreme Court of the United States holding that the machine-or-transformation test is not the sole test for determining the patent eligibility of a process, but rather "a useful and important clue, an investigative tool, for determining whether some claimed inventions are processes under § 101." In so doing, the Supreme Court affirmed the rejection of an application for a patent on a method of hedging losses in one segment of the energy industry by making investments in other segments of that industry, on the basis that the abstract investment strategy set forth in the application was not patentable subject matter.

AT&T Corp. v. Excel Communications, Inc., 172 F.3d 1352 was a case in which the United States Court of Appeals for the Federal Circuit reversed the decision of the United States District Court for the District of Delaware, which had granted summary judgment to Excel Communications, Inc. and decided that AT&T Corp. had failed to claim statutory subject matter with U.S. Patent No. 5,333,184 under 35 U.S.C. § 101. The United States Court of Appeals for the Federal Circuit remanded the case for further proceedings.

CyberSource Corp. v. Retail Decisions, Inc., 654 F.3d 1366, is a United States Court of Appeals for the Federal Circuit case that disputed patent eligibility for the '154 patent, which describes a method and system for detecting fraud of credit card transactions through the internet. This court affirmed the decision of United States District Court for the Northern District of California which ruled that the patent is actually unpatentable.

<i>In re Alappat</i>

In re Alappat, 33 F.3d 1526, along with In re Lowry and the State Street Bank case, form an important mid-to-late-1990s trilogy of Federal Circuit opinions because in these cases, that court changed course by abandoning the Freeman-Walter-Abele Test that it had previously used to determine patent eligibility of software patents and patent applications. The result was to open a floodgate of software and business-method patent applications, many or most of which later became invalid patents as a result of Supreme Court opinions in the early part of the following century in Bilski v. Kappos and Alice v. CLS Bank.

<i>In re Schrader</i>

In re Schrader, 22 F.3d 290 is a 1994 decision of the United States Court of Appeals for the Federal Circuit in which the court summarized and synthesized its precedents under the Freeman-Walter-Abele Test of patent eligibility. Under this test a key element is that the claimed invention is implemented with some type of hardware—that is, a particular machine. This was one of the last Federal Circuit decisions using that test.

References

  1. ↑ Gottschalk v. Benson, 409 U.S. 63, 72 (1972).
  2. 1 2 Gottschalk, 409 U.S. at 72 (citing "To Promote the Progress of . . . Useful Arts," Report of the President's Commission on the Patent System (1966)).
  3. ↑ "Gottschalk v. Benson". Project Oyez. Retrieved May 9, 2017.
  4. ↑ Mackay Co. v. Radio Corp., 306 U.S. 86 (1939).
  5. ↑ 2106.02 Mathematical Algorithms - 2100 Patentability Manual of Patent Examining Procedure 8th ed.
  6. ↑ Supplemental Brief of Appellee Director of the USPTO in In re Bilski, Fed. Cir. App. No. 2007-1130 Archived 2008-11-20 at the Wayback Machine , at pp. 6-14.
  7. ↑ See Petitioner’s Reply Brief on writ of certiorari in Benson, at 9 ("we submit that the cases follow such a rule—implicitly or explicitly—and that they cannot be rationalized otherwise").

Further reading

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.