Gottschalk v. Benson

409 U.S. 63, 93 S. Ct. 253, 34 L. Ed. 2d 273, 1972 U.S. LEXIS 129, 175 U.S.P.Q. (BNA) 673
Supreme Court of the United States·Decided November 20, 1972·No. 71-485·Published·Cited by 440 cases

Opinion

Mr. Justice Douglas

delivered the opinion of the Court.

Respondents filed in the Patent Office an application for an invention which was described as being related “to the processing of data by program and more particularly to the programmed conversion of numerical information” in general-purpose digital computers. They claimed a method for converting binary-coded decimal (BCD) numerals into pure binary numerals. The claims were not limited to any particular art or technology, to any particular apparatus or machinery, or to any particular end use. They purported to cover any use of the claimed method in a general-purpose digital computer of any type. Claims 8 and 13 1 were rejected by the Patent Office but sustained by the Court of Customs and Patent Appeals, - C. C. P. A. (Pat.) -, 441 F. 2d 682. The case is here on a petition for a writ of certiorari. 405 U. S. 915.

The question is whether the method described and claimed is a “process” within the meaning of the Patent Act. 2

*65 A digital computer, as distinguished from an analog computer, operates on data expressed in digits, solving a problem by doing arithmetic as a person would do it by head and hand. 3 Some of the digits are stored as components of the computer. Others are introduced into the computer in a form which it is designed to recognize. The computer operates then' upon both new and previously stored data. The general-purpose computer is designed to perform operations under many different programs.

The representation of numbers may be in the form of a time series of electrical impulses, magnetized spots on the surface of tapes, drums, or discs, charged spots on cathode-ray tube screens, the presence or absence of punched holes on paper cards, or other devices. The method or program is a sequence of coded instructions for a digital computer.

The patent sought is on a method of programming a general-purpose digital computer to convert signals from binary-coded decimal form into pure binary form. A procedure for solving a given type of mathematical problem is known as an “algorithm.” The procedures set forth in the present claims are of that kind; that is to say, they are a generalized formulation for programs to solve mathematical problems of converting one form of numerical representation to another. From the generic formulation, programs may be developed as specific applications.

*66 The decimal system uses as digits the 10 symbols 0, 1, 2, 3, 4, 5, 6, 7, 8, and 9. The value represented by any digit depends, as it does in any positional system of notation, both on its individual value and on its relative position in the numeral. Decimal numerals are written by placing digits in the appropriate positions or columns of the numerical sequence, i. e., “unit” (10°), “tens” (101), “hundreds” (102), “thousands” (103), etc. Accordingly, the numeral 1492 signifies (1X103) + (4X102) + (9X101) +(2X10°).

The pure binary system of positional notation uses two symbols as digits — 0 and 1, placed in a numerical sequence with values based on consecutively ascending powers of 2. In pure binary notation, what would be the tens position is the twos position; what would be hundreds position is the fours position; what would be the thousands position is the eights. Any decimal number from 0 to 10 can be represented in the binary system with four digits or positions as indicated in the following table.

Shown as the sum of powers of 2

2s 22 21

Decimal (8) (4) (2) (1) Pure Binary

0 = 0 + 0 + 0 + 0 = 0000

1 = 0 + 0 + 0 + 2° = 0001

2 = 0 + 0 + 21 + 0 = 0010

3 = 0 + 0 + 21 + 2° = 0011

4 = 0 + 22 + 0 + 0 = 0100

5 = 0 + 22 + 0 + 2° = 0101

6 = 0 + 22 + 21 + 0 = 0110

7 = 0 + 22 + 21 + 2° = 0111

8 = 23 + 0 + 0 + 0 = 1000

9 = 23 + 0 + 0 + 2° = 1001

10 = 23 + 0 + 21 + 0 = 1010

The BCD system using decimal numerals replaces the character for each component decimal digit in the decimal numeral with the corresponding four-digit binary *67 numeral, shown in the righthand column of the table. Thus decimal 53 is represented as 0101 0011 in BCD, because decimal 5 is equal to binary 0101 and decimal 3 is equivalent to binary 0011. In pure binary notation, however, decimal 53 equals binary 110101. The conversion of BCD numerals to pure binary numerals can be done mentally through use of the foregoing table. The method sought to be patented varies the ordinary arithmetic steps a human would use by changing the order of the steps, changing the symbolism for writing the multiplier used in some steps, and by taking subtotals after each successive operation. The mathematical procedures can be carried out in existing computers long in use, no new machinery being necessary. And, as noted, they can also be performed without a computer.

The Court stated in Mackay Co. v. Radio Corp., 306 U. S. 86, 94, that “[w]hile a scientific truth, or the mathematical expression of it, is not a patentable invention, a novel and useful structure created with the aid of knowledge of scientific truth may be.” That statement followed the longstanding rule that “[a]n idea of itself is not patentable.” Rubber-Tip Pencil Co. v. Howard, 20 Wall. 498, 507. “A principle, in the abstract, is a fundamental truth; an original cause; a motive; these cannot be patented, as no one can claim in either of them an exclusive right.” Le Roy v. Tatham, 14 How. 156, 175. Phenomena of nature, though just discovered, mental processes, and abstract intellectual concepts are not patentable, as they are the basic tools of scientific and technological work. As we stated in Funk Bros. Seed Co. v. Kalo Co., 333 U. S. 127, 130, “He who discovers a hitherto unknown phenomenon of nature has no claim to a monopoly of it which the law recognizes. If there is to be invention from such a discovery, it must come from the application of the law of nature to a new and useful end.” We dealt there with a “product” claim, while the *68 present case deals with a “process” claim. But we think the- same principle applies.

Here the “process” claim is so abstract and sweeping as to cover both known and unknown uses of the BCD to pure binary conversion. The end use may (1) vary from the operation of a train to verification of drivers’ licenses to researching the law books for precedents and (2) be performed through any existing machinery or future-devised machinery or without any apparatus.

Free access — add to your briefcase to read the full text and ask questions with AI

Gottschalk v. Benson, 409 U.S. 63, 93 S. Ct. 253, 34 L. Ed. 2d 273, 1972 U.S. LEXIS 129, 175 U.S.P.Q. (BNA) 673 (1972).

409 U.S. 63 (Gottschalk v. Benson) — published by Counsel Stack Legal Research, free access to 12M+ legal documents.

Related

Lockheed Martin Aeronautics Company
Armed Services Board of Contract Appeals, 2022
Ocado Innovation, Ltd., et al., v. AutoStore AS, et al.
2021 DNH 129P (D. New Hampshire, 2021)
Cardionet, LLC v. Infobionic, Inc
955 F.3d 1358 (Federal Circuit, 2020)
Illumina, Inc. v. Ariosa Diagnostics, Inc.
967 F.3d 1319 (Federal Circuit, 2020)
Rapid Litigation Management Ltd. v. CellzDirect, Inc.
827 F.3d 1042 (Federal Circuit, 2016)
Enfish, LLC v. Microsoft Corporation
822 F.3d 1327 (Federal Circuit, 2016)
Genetic Technologies Limited v. Merial L.L.C.
818 F.3d 1369 (Federal Circuit, 2016)
Thales Visionix, Inc. v. United States
122 Fed. Cl. 245 (Federal Claims, 2015)
Versata Development Group, Inc. v. SAP America, Inc.
793 F.3d 1306 (Federal Circuit, 2015)
Intellectual Ventures I LLC v. Capital One Bank (USA)
792 F.3d 1363 (Federal Circuit, 2015)
Internet Patents Corporation v. Active Network, Inc.
790 F.3d 1343 (Federal Circuit, 2015)
Kaneka Corp. v. Xiamen Kingdomway Group Co.
790 F.3d 1298 (Federal Circuit, 2015)
East Coast Sheet Metal Fabricating Corp. v. Autodesk
2015 DNH 011 (D. New Hampshire, 2015)
Planet Bingo, LLC v. Vkgs LLC
576 F. App'x 1005 (Federal Circuit, 2014)