Gottschalk v. Benson | |
---|---|
Argued October 16, 1972 Decided November 20, 1972 | |
Full case name | Gottschalk, Acting Commissioner of Patents v. Benson, et al. |
Citations | 409 U.S. 63 (more) |
Case history | |
Prior | Application 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 | |
| |
Case opinion | |
Majority | Douglas, 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.