Case Name: In re Rene K. PARDO and Remy Landau
Court: United States Court of Customs and Patent Appeals
Jurisdiction: United States
Decision Date: 1982-08-05
Citations: 684 F.2d 912
Docket Number: Appeal No. 81-619
Parties: In re Rene K. PARDO and Remy Landau.
Judges: 
Reporter: Federal Reporter 2d Series
Volume: 684
Pages: 912–917

Head Matter:
In re Rene K. PARDO and Remy Landau.
Appeal No. 81-619.
United States Court of Customs and Patent Appeals.
Aug. 5, 1982.
Rene K. Pardo and Remy Landau, of Ontario, Canada, for appellants, pro se.
Joseph F. Nakamura, Sol., Jere W. Sears, Deputy Sol., Washington, D. C., for Patent and Trademark Office.
Before MARKEY, Chief Judge, RICH, BALDWIN, MILLER, and NIES, Associate Judges.

Opinion:
MILLER, Judge.
This is an ex parte pro se appeal from a decision of the Patent and Trademark Office ("PTO") Board of Appeals ("board") affirming the examiner's rejection of appellants' claims 26-61 under 35 U.S.C. § 101 as directed to nonstatutory subject matter and, pursuant to 37 CFR 1.196(b), entering a new rejection of the same claims for obviousness, 35 U.S.C. § 103. We reverse.
BACKGROUND
The Invention
Appellants characterize their invention as a method for controlling the internal operations of a computer. The invention converts a computer from a sequential processor (which executes program instructions in the order in which they are presented) to a processor which is not dependent on the order in which it receives program steps. This capability is important when the execution of certain program steps requires as a condition precedent the results of other program steps.
Appellants' specification describes the invention as involving an "algorithm" of a compiler program. Claims 26-43 are directed to a method of controlling the internal operations of a programmed computer, and claims 44-61 are directed to a computer controlled according to the method. Claims 30 and 48 are representative:
30. A process of operating a general purpose data processor of known type to enable the data processor to execute formulas in an object program comprising a plurality of formulas, such that the same results will be produced when using the same given data, regardless of the sequence in which said formulas are presented in said object program, comprising the steps of:
(a) examining each of said formulas in a storage area of the data processor to determine which formulas can be designated as defined;
(b) executing, in the sequence in which each formula is designated as defined, said formulas designated as defined;
(c) repeating steps (a) and (b) for at least undefined formulas as many times as required until all said formulas have been designated as defined and have been executed;
whereby to produce the same results upon execution of the formulas in the sequence recited in step (b) when using the same given data, regardless of the order in which said formulas were presented in the object program prior to said process.
48. A general purpose data processor of known type operating under the control of a stored program containing a set of instructions for enabling the data processor to execute formulas in an object program comprising a plurality of formulas, such that the same results will be produced when using the same given data, regardless of the sequence in which said formulas are presented in said object program, said data processor performing the following functions:
(a) examining each of said formulas in a storage area of the data processor to determine which formulas can be designated as defined;
(b) executing, in the sequence in which each formula is designated as defined, said formulas designated as defined;
(c) repeating steps (a) and (b) for at least undefined formulas as many times as required until all said formulas have been designated as defined and have been executed;
whereby to produce the same results upon execution of the formulas in the sequence recited in step (b) when using the same given data, regardless of the order in which said formulas were presented in the object program prior to said functions.
Prosecution History
The application was filed August 12, 1970. On July 28, 1972, the examiner indicated that all claims were allowable and that prosecution on the merits was closed. A notice of allowance, however, was not forthcoming, and subsequent to the decision in Gottschalk v. Benson, 409 U.S. 63, 93 S.Ct. 253, 34 L.Ed.2d 273, 175 USPQ 673 (1972), the PTO reopened prosecution and rejected the claims under 35 U.S.C. § 101. The Board's Decision
The board affirmed the examiner's rejection, stating:
The courts above us have consistently said that a claim directed in its entirety to an algorithm is nonstatutory. An algorithm is defined . as a procedure for solving a given type of mathematical problem.
The appellants say at page 9 of the specification that:
"The algorithm or key process of the compiler program 12 will now be described with reference to the flowchart of Figure 2."
The appellants also tell us at the bottom of page 13 of the specification that variations of the preferred embodiment still use the same basic algorithm.
Construing the claims at bar in light of the specification, which we must do, they are in their entirety directed to the algorithm of the compiler, or variations thereof, by the appellants' own admissions in their specification. Hence, the claims do not pass muster under 35 USC 101. [Citations omitted.]
Thus, the board treated appellants' use of the word "algorithm" to describe their invention as an admission that their claims are drawn to nonstatutory subject matter.
The board then entered the following new rejection under 37 CFR 1.196(b):
Claims 26 through 61 are rejected under 35 USC 103 as obvious. As we said before, the appellants' invention is directed to a method and apparatus for automatically rearranging random formulae for sequential execution by a computer. Suppose a user provides the following information:
(1) values for a, b, c and d;
(2) A = X + Y;
(3) X = a + b; and
(4) Y = c + d.
Obviously, a computer cannot execute these operations in the order presented because step (2) cannot be performed until the results of steps (3) and (4) are obtained. What the appellants' algorithm does is rearrange the order of the formulae as presented by the user so that the computer can execute the operations. Thus, using our example, the appellants' algorithmic process would rearrange the formulae as follows:
(1) values for a, b, c and d;
(2) X = a + b;
(3) Y = c + d; and
(4) A = X + Y.
These formulae, as arranged, can be executed by the computer in a logical, sequential fashion. In our opinion, this algorithmic process would have been obvious to the artisan facing the problem within the meaning of 35 USC 103.
OPINION
The issues before us are: (1) whether appellants' claims constitute statutory subject matter; and (2) whether the invention defined by the claims would have been obvious to a person of ordinary skill in the art on August 12, 1970, the date of appellants' constructive reduction to practice.
I. Statutory Subject Matter
A. No Admission
The method adopted by this court for analyzing mathematical algorithm-statutory subject matter cases in In re Freeman, 573 F.2d 1237, 197 U.S.P.Q. 464 (CCPA 1978), as modified by In re Walter, 618 F.2d 758, 205 U.S.P.Q. 397 (CCPA 1980), comprises a two part test: First, the claim is analyzed to determine whether a mathematical algorithm is directly or indirectly recited. Next, if a mathematical algorithm is found, the claim as a whole is further analyzed to determine whether the algorithm is "applied in any manner to physical elements or process steps," and, if it is, it "passes muster under § 101." 618 F.2d at 767, 205 U.S.P.Q. at 407. The second part of this test conforms to the opinion of the Supreme Court in Diamond v. Diehr, 450 U.S. 175, 101 S.Ct. 1048, 67 L.Ed.2d 155, 209 U.S.P.Q. 1 (1981). In re Abele, 684 F.2d 902 (CCPA 1982); In re Taner, 681 F.2d 787, at 790, 791 (CCPA 1982).
Appellants argue that their use of the word "algorithm" to describe their process is an insufficient basis to hold that their claims are drawn to nonstatutory subject matter. It has often been recognized that the word "algorithm" is subject to a number of definitions. The Supreme Court has defined it as a "procedure for solving a given type of mathematical problem." Diamond v. Diehr, supra 450 U.S. at 186, 101 S.Ct. at 1056, 209 U.S.P.Q. at 8; Parker v. Flook, 437 U.S. 584, 585 n.l, 98 S.Ct. 2522, 2523 n.l, 57 L.Ed.2d 451, 198 U.S.P.Q. 193, 195 n.l (1978); Gottschalk v. Benson, supra 409 U.S. at 65, 93 S.Ct. at 254, 175 U.S.P.Q. at 674 (1972). It is this type of algorithm that constitutes nonstatutory subject matter, and this court has consistently rejected attempts to enlarge the "mathematical algorithm" exception to the definition of patentable subject matter in section 101 to include nonmathematical algorithms. In In re Freeman, supra at 1246, 197 U.S.P.Q. at 471, the court said, "a refusal to recognize that Benson was concerned only with mathematical algorithms leads to the absurd view that the Court was reading the word 'process' out of the statute." Similarly, in In re Chatfield, 545 F..2d 152, 156 n.5, 191 U.S.P.Q. 730, 734 n.5 (CCPA 1976), cert. denied, 434 U.S. 875, 98 S.Ct. 226, 54 L.Ed.2d 155 (1977), this court stated: "It would be unnecessarily detrimental to our patent system to deny inventors patent protection on the sole ground that their contribution could be broadly termed an 'algorithm.' " See also In re Sarkar, 588 F.2d 1330, 1333, 200 U.S.P.Q. 132, 137 (CCPA 1978); In re Toma, 575 F.2d 872, 877, 197 U.S.P.Q. 852, 856 (CCPA 1978).
Appellants filed their patent application containing the word "algorithm" more than two years before the decision in Gottschalk v. Benson, supra, where the court used the word in a limited sense to describe nonstatutory subject matter. There is no indication that "algorithm," as used by appellants, means "mathematical algorithm" as that term has been used by the Supreme Court. Therefore, appellants' use of the term to describe their invention is not an admission that they are claiming nonstatutory subject matter and is not dis-positive of the issue before us.
B. Mathematical Algorithm
Applying the first part of the Freeman analysis to the appealed claims, we are unable to find any mathematical formula, calculation, or algorithm either directly or indirectly recited in the claimed steps of examining, compiling, storing, and executing. Indeed, the examiner acknowledged that "[t]he 'algorithm' of the present application is not 'mathematical' (although it deals with the proper sequence for performing mathematics), but it does establish the rules which are to be followed by a data processor and which appellants want to protect when so used." We perceive no essential distinction between appellants' claimed invention and the subject matter of In re Chatfield, supra, which comprised a time-sharing method for operating a computer on several programs simultaneously. Chat-field, like this case, involved a method for controlling the internal operations of a computer to govern the manner in which programs are executed.
Nevertheless, despite the absence of an expressly-recited mathematical algorithm, the solicitor argues that appellants' claims indirectly amount to mathematical calculations, because the programs subjected to appellants' process are exemplified as mathematical formulae. This court's response to a similar argument in In re Bradley, 600 F.2d 807, 812, 202 U.S.P.Q. 480, 485 (CCPA 1979), aff'd by an equally divided court, 450 U.S. 381, 101 S.Ct. 1495, 67 L.Ed.2d 311 (1981), is equally applicable here:
We see no difference in this regard, with respect to being within § 101, between appellants' claimed invention and a strictly mechanical adding machine, which is certainly statutory if claimed in a manner which does not embrace any particular calculation that the machine is capable of making.
Appellants' method claims are directed to executing programs in a computer. The method operates on any program and any formula which may be input, regardless of mathematical content. That a computer controlled according to the invention is capable of handling mathematics is irrelevant to the question of whether a mathematical algorithm is recited by the claims.
Section 101 encompasses a broad range of subject matter. "[A] claim drawn to subject matter otherwise statutory does not become nonstatutory simply because it uses a mathematical formula, computer program, or digital computer." Diamond v. Diehr, supra 450 U.S. at 187, 101 S.Ct. at 1056, 209 U.S.P.Q. at 8. Indeed, any process, machine, manufacture, or composition of matter constitutes statutory subject matter unless it falls within a judicially determined exception to section 101. In re Gelnovatch, 595 F.2d 32, 38, 201 U.S.P.Q. 136, 142 (CCPA 1979); In re Sarkar, supra at 1333, 200 U.S.P.Q. at 137. The appealed claims do not fall within any such exception.
Accordingly, we hold that appellants' claims constitute statutory subject matter, and the section 101 rejection is reversed.
II. Obviousness
The obviousness rejection made by the board is only applicable to claims 26-27, 32-33, 40-41, 44-45, 50-51, and 58-59. The remainder of the claims do not require rearrangement of the process instructions, but achieve the stated objective of nonsequential operation in a different manner.
The board cited no references in support of the rejection, but relied on its own logic to hold that the invention would have been obvious. The Solicitor cites In re Fox, 471 F.2d 1405, 176 U.S.P.Q. 340 (CCPA 1973) and In re Howard, 55 C.C.P.A. 1121, 394 F.2d 869, 157 U.S.P.Q. 615 (1968), for the proposition that citation of authority to support a rejection is not always necessary. Those cases dealt with taking judicial notice of "common practice of wide notoriety, well within the ambit of judicial cognizance." In re Howard, supra, at 1123, 394 F.2d at 870, 157 U.S.P.Q. at 616.
In the present case, the board, in entering the new rejection, exemplified a portion of one claimed method (viz., rearrangement of the order of the formulae) and expressed the opinion that it would have been obvious to one of ordinary skill in the art in 1970. However, the skill of a person of ordinary skill in either computer programming or design in 1970 is not a proper subject for judicial notice today, no matter how simple a claimed invention may seem in hindsight. Appellants point out that computers were in general use as sequential processors for 18 years prior to their filing date, and yet the PTO has been unable to cite even one reference against their claims. As this court said in In re Ahlert, 57 C.C.P.A. 1023, 1027, 424 F.2d 1088, 1091, 165 U.S.P.Q. 418, 420-21 (1970):
[Tjhis court will always construe [the rule permitting judicial notice] narrowly and will regard facts found in such manner with an eye toward narrowing the scope of any conclusions to be drawn therefrom. Assertions of technical facts in areas of esoteric technology must always be supported by citation to some reference work recognized as standard in the pertinent art and the appellant given, in the Patent Office, the opportunity to challenge the correctness of the assertion or the notoriety or repute of the cited reference. Cf. In re Cofer, 53 C.C.P.A. 830, 354 F.2d 664, 148 U.S.P.Q. 268 (1966), In re Borst, 52 C.C.P.A. 1398, 345 F.2d 851, 145 U.S.P.Q. 554 (1965). Allegations concerning specific "knowledge" of the prior art, which might be peculiar to a particular art should also be supported and the appellant similarly given the opportunity to make a challenge. See In re Spormann, 53 C.C.P.A. 1375, 363 F.2d 444, 150 U.S.P.Q. 449 (1966).
In making the obviousness rejection, the board failed to follow the three-pronged analysis required by Graham v. John Deere Co., 383 U.S. 1, 86 S.Ct. 684, 15 L.Ed.2d 545 (1966), whenever the obviousness of patent claims is in issue. The board did not determine the scope and content of the prior art or even indicate that there was any prior art; it did not determine the differences between the prior art and the claimed invention; and it did not ascertain the level of ordinary skill in the art at the time the invention was made.
Accordingly, we hold that the PTO has failed to establish that the claims would have been obvious to a person of ordinary skill in the art on August 12, 1970, and the section 103 rejection must also be reversed.
REVERSED.
. Application serial No. 63,185, filed August 12, 1970, for: "A Process and Apparatus for Converting a Source Program into an Object Program."
. Other claims achieve nonsequential operation by reordering program steps for later sequential execution or storing an indication of the order of execution.
. 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.
. The Diehr Court declined the Government's invitation to broaden its definition of nonstatu-tory algorithm, stating:
Our previous decisions regarding the patenta-bility of "algorithms" are necessarily limited to the more narrow definition employed by the Court, and we do not pass judgment on whether processes falling outside the definition previously used by this Court, but within the definition offered by the petitioner, would be patentable subject matter.
450 U.S. at 186 n.9, 101 S.Ct. at 1056 n.9, 209 U.S.P.Q. at 8 n.9.
. As the Supreme Court said regarding section 101 in Diamond v. Chakrabarty, 447 U.S. 303, 308-09, 100 S.Ct. 2204, 2207, 65 L.Ed.2d 144, 206 U.S.P.Q. 193, 197 (1980):
In choosing such expansive terms as "manufacture" and "composition of matter," modified by the comprehensive "any," Congress plainly contemplated that the patent laws would be given wide scope.
The relevant legislative history also supports a broad construction.... The Committee Reports accompanying the 1952 act inform us that Congress intended statutory subject matter to "include anything under
the sun that is made by man." S.Rep.No. 1979, 82d Cong., 2d Sess., 5 (1952); H.R.Rep. No. 1923, 82d Cong., 2d Sess., 6 (1952).
[Footnote omitted.]
. Although some of appellants' claims are drawn to a "general purpose data processor of known type operating under the control of a stored program," such claims are treated as indistinguishable from the method claims for purposes of section 101 unless it is demonstrated that the claims are drawn to specific apparatus distinct from other apparatus capable of performing the identical functions. In re Walter, supra at 768, 205 U.S.P.Q. at 407-08.