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.) -,
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.,
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.
In
O’Reilly
v.
Morse,
In
The Telephone Cases,
In
Corning
v.
Burden,
Cochrane
v.
Deener,
“That a process may be patentable, irrespective of the particular form of the instrumentalities used, *70 cannot be disputed. If one of the steps of a process be that a certain substance is to be reduced to a powder, it may not be at all material what instrument or machinery is used to effect that object, whether a hammer, a pestle and mortar, or a mill. Either may be pointed out; but if the patent is not confined to that particular tool or machine, the use of the others would be an infringement, the general process being the same. A process is a mode of treatment of certain materials to produce a given result. It is an. act, or a series of acts, performed upon the subject-matter to be transformed and reduced to a different state or thing.” Id., at 787-788.
Transformation and reduction of an article “to a different state or thing” is the clue to the patentability of a process claim that does not include particular machines. So it is that a patent in the process of “manufacturing fat acids and glycerine from fatty bodies by the action of water at a high temperature and pressure” was sustained in
Tilghman
v.
Proctor,
Expanded Metal Co.
v.
Bradford,
Smith
v.
Snow,
“By the use of materials in a particular manner he secured the performance of the function by a means which had never occurred in nature, and had not been anticipated by the prior art; this is a patentable method or process. ... A method, which may be patented irrespective of the particular form of the mechanism which may be availed of for carrying it into operation, is not to be rejected as ‘functional,’ merely because the specifications show a machine capable of using it.”294 U. S., at 22 .
It is argued that a process patent must either be tied to a particular machine or apparatus or must operate to change articles or materials to a “different state or thing.” We do not hold that no process patent could ever qualify if it did not meet the requirements of our prior precedents. It is said that the decision precludes a patent for any program servicing a computer. We do not so hold. It is said that we have before us a program for a digital computer but extend our holding to programs for analog computers. We have, however, made clear from the start that we deal with a program only for digital computers. It is said we freeze process patents to old technologies, leaving no room for the revelations of the new, onrushing technology. Such is not our purpose. What we come down to in a nutshell is the following.
It is conceded that one may not patent an idea. But in practical effect that would be the result if the formula for converting BCD numerals to pure binary numerals were patented in this case. The mathematical formula involved here has no substantial practical application except in connection with a digital computer, which *72 means that if the judgment below is affirmed, the patent would wholly pre-empt the mathematical formula and in practical effect would be a patent on the algorithm itself.
It may be that the patent laws should be extended to cover these programs, a policy matter to which we are not competent to speak. The President’s Commission on the Patent System 4 rejected the proposal that these programs be patentable: 5
“Uncertainty now exists as to whether the statute permits a valid patent to be granted on programs. Direct attempts to patent programs have been rejected on the ground of nonstatutory subject matter. Indirect attempts to obtain patents and avoid the rejection, by drafting claims as a process, or a machine or components thereof programmed in a given manner, rather than as a program itself, have confused the issue further and should not be permitted.
“The Patent Office now cannot examine applications for programs because of a lack of a classification technique and the requisite search files. Even if these were available, reliable searches would not be feasible or economic because of the tremendous volume of prior art being generated. Without this search, the patenting of programs would be tantamount to mere registration and the presumption of validity would be all but nonexistent.
“It is noted that the creation of programs has undergone substantial and satisfactory growth in the absence of patent protection and that copyright protection for programs is presently available.”
*73 If these programs are to be patentable, 6 considerable problems are raised which only committees of Congress can manage, for broad powers of investigation are needed, including hearings which canvass the wide variety of views which those operating in this field entertain. The technological problems tendered in the many briefs before us 7 indicate to us that considered action by the Congress is needed.
Reversed.
Mr. Justice Stewart, Mr. Justice Blackmun, and Mr. Justice Powell took no part in the consideration or decision of this case.
APPENDIX TO OPINION OF THE COURT
Claim 8 reads:
“The method of converting signals from binary coded decimal form into binary which comprises the steps of
“(1) storing the binary coded decimal signals in a re-entrant shift register,
“(2) shifting the signals to the right by at least three places, until there is a binary '1' in the second position of said register,
“(3) masking out said binary T in said second position of said register,
“(4) adding a binary 1’ to the first position of said register,
“(5) shifting the signals to the left by two positions,
*74 “(6) adding a T to said first position, and
“(7) shifting the signals to the right by at least three positions in preparation for a succeeding binary 1’ in the second position of said register.”
Claim 13 reads:
“A data processing method for converting binary coded decimal number representations into binary number representations comprising the steps of
“(1) testing each binary digit position '1/ beginning with the least significant binary digit position, of the most significant decimal digit representation for a binary ‘O’ or a binary T;
“(2) if a binary ‘O’ is detected, repeating step (1) for the next least significant binary digit position of said most significant decimal digit representation;
“(3) if a binary ‘V is detected, adding a binary '1’ at the (i+l)th and (i+3)th least significant binary digit positions of the next lesser significant decimal digit representation, and repeating step (1) for the next least significant binary digit position of said most significant decimal digit representation;
“(4) upon exhausting the binary digit positions of said most significant decimal digit representation, repeating steps (1) through (3) for the next lesser significant decimal digit representation as modified by the previous execution of steps (1) through (3); and
“(5) repeating steps (1) through (4) until the second least significant decimal digit representation has been so processed.”
Notes
They are set forth in the Appendix to this opinion.
Title 35 U. S. C. § 100 (b) provides:
“The term ‘process’ means process, art or method, and includes a *65 new use of a known process, machine, manufacture, composition of matter, or material.”
Title 35 U. S. C. § 101 provides:
“Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefor, subject to the conditions and requirements of this title.”
See R. Benrey, Understanding Digital Computers 4 (1964).
“To Promote the Progress of . . . Useful Arts,” Report of the President's Commission on the Patent System (1966).
Id., at 13.
See Wild, Computer Program Protection: The Need to Legislate a Solution, 54 Corn. L. Rev. 586, 604-609 (1969); Bender, Computer Programs: Should They Be Patentable?, 68 Col. L. Rev. 241 (1968); Buckman, Protection of Proprietory Interest in Computer Programs, 51 J. Pat. Off. Soc. 135 (1969).
Amicus briefs of 14 interested groups have been filed on the merits in this case.
