# Difference between revisions of "Talk:State Street Bank & Trust Co. v. Signature Financial Group, Inc., 149 F.3d 1368 (1998)"

(Created page with '==Courtney== The “Mathematical Algorithm” Exception The Supreme Court has identified three categories of subject matter that are unpatentable, namely “laws of nature, nat…') |
(→Maura: new section) |
||

Line 12: | Line 12: | ||

If Signature's invention were patentable, any financial institution desirous of implementing a multi-tiered funding complex modelled (sic) on a Hub and Spoke configuration would be required to seek Signature's permission before embarking on such a project. This is so because the '056 Patent is claimed [sic] sufficiently broadly to foreclose virtually any computer-implemented accounting method necessary to manage this type of financial structure. | If Signature's invention were patentable, any financial institution desirous of implementing a multi-tiered funding complex modelled (sic) on a Hub and Spoke configuration would be required to seek Signature's permission before embarking on such a project. This is so because the '056 Patent is claimed [sic] sufficiently broadly to foreclose virtually any computer-implemented accounting method necessary to manage this type of financial structure. | ||

+ | |||

+ | == Maura == | ||

+ | |||

+ | Today, we hold that the transformation of data, representing discrete dollar amounts, by a machine through a series of mathematical calculations into a final share price, constitutes a practical application of a mathematical algorithm, formula, or calculation, because it produces "a useful, concrete and tangible result"--a final share price momentarily fixed for recording and reporting purposes and even accepted and relied upon by regulatory authorities and in subsequent trades. | ||

+ | |||

+ | The district court erred by applying the Freeman-Walter-Abele test to determine whether the claimed subject matter was an unpatentable abstract idea. The Freeman-Walter-Abele test was designed by the Court of Customs and Patent Appeals, and subsequently adopted by this court, to extract and identify unpatentable mathematical algorithms in the aftermath of Benson and Flook. See In re Freeman, 573 F.2d 1237, 197 USPQ 464 (CCPA 1978) as modified by In re Walter, 618 F.2d 758, 205 USPQ 397 (CCPA 1980). The test has been thus articulated: | ||

+ | 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." | ||

+ | |||

+ | The test determines the presence of, for example, an algorithm. Under Benson, this may have been a sufficient indicium of nonstatutory subject matter. However, after Diehr and Alappat, the mere fact that a claimed invention involves inputting numbers, calculating numbers, outputting numbers, and storing numbers, in and of itself, would not render it nonstatutory subject matter, unless, of course, its operation does not produce a "useful, concrete and tangible result." Alappat, 33 F.3d at 1544, 31 USPQ2d at 1557.7 After all, as we have repeatedly stated, every step-by-step process, be it electronic or chemical or mechanical, involves an algorithm in the broad sense of the term. Since § 101 expressly includes processes as a category of inventions which may be patented and § 100(b) further defines the word "process" as meaning "process, art or method, and includes a new use of a known process, machine, manufacture, composition of matter, or material," it follows that it is no ground for holding a claim is directed to nonstatutory subject matter to say it includes or is directed to an algorithm. This is why the proscription against patenting has been limited to mathematical algorithms.... | ||

+ | |||

+ | If Signature's invention were patentable, any financial institution desirous of implementing a multi-tiered funding complex modelled (sic) on a Hub and Spoke configuration would be required to seek Signature's permission before embarking on such a project. This is so because the '056 Patent is claimed [sic] sufficiently broadly to foreclose virtually any computer-implemented accounting method necessary to manage this type of financial structure. | ||

+ | |||

+ | MPEP § 706.03(a) (1994). This acknowledgment is buttressed by the U.S. Patent and Trademark 1996 Examination Guidelines for Computer Related Inventions which now read: | ||

+ | Office personnel have had difficulty in properly treating claims directed to methods of doing business. Claims should not be categorized as methods of doing business. Instead such claims should be treated like any other process claims. | ||

+ | |||

+ | FOOTNOTE 10 | ||

+ | As Judge Newman has previously stated, | ||

+ | [The business method exception] is ... an unwarranted encumbrance to the definition of statutory subject matter in section 101, that [should] be discarded as error-prone, redundant, and obsolete. It merits retirement from the glossary of section 101.... All of the "doing business" cases could have been decided using the clearer concepts of Title 35. Patentability does not turn on whether the claimed method does "business" instead of something else, but on whether the method, viewed as a whole, meets the requirements of patentability as set forth in Sections 102, 103, and 112 of the Patent Act. | ||

+ | In re Schrader, 22 F.3d 290, 298, 30 USPQ2d 1455, 1462 (Fed.Cir.1994) (Newman, J., dissenting). |

## Revision as of 16:54, 2 March 2010

## Courtney

The “Mathematical Algorithm” Exception

The Supreme Court has identified three categories of subject matter that are unpatentable, namely “laws of nature, natural phenomena, and abstract ideas.” Diehr, 450 U.S. at 185, 101 S.Ct. 1048. Of particular relevance to this case, the Court has held that mathematical algorithms are not patentable subject matter to the extent that they are merely abstract ideas. See Diehr, 450 U.S. 175, 101 S.Ct. 1048, passim; Parker v. Flook, 437 U.S. 584, 98 S.Ct. 2522, 57 L.Ed.2d 451 (1978); Gottschalk v. Benson, 409 U.S. 63, 93 S.Ct. 253, 34 L.Ed.2d 273 (1972). In Diehr, the Court explained that certain types of mathematical subject matter, standing alone, represent nothing more than abstract ideas until reduced to some type of practical application, i.e., “a useful, concrete and tangible result.” Alappat, 33 F.3d at 1544, 31 USPQ2d at 1557.[4]

Unpatentable mathematical algorithms are identifiable by showing they are merely abstract ideas constituting disembodied concepts or truths that are not “useful.” From a practical standpoint, this means that to be patentable an algorithm must be applied in a “useful” way. In Alappat, we held that data, transformed by a machine through a series of mathematical calculations to produce a smooth waveform display on a rasterizer monitor, constituted a practical application of an abstract idea (a mathematical algorithm, formula, or calculation), because it produced “a useful, concrete and tangible result”-the smooth waveform.

Similarly, in Arrhythmia Research Technology Inc. v. Corazonix Corp., 958 F.2d 1053, 22 USPQ2d 1033 (Fed.Cir.1992), we held that the transformation of electrocardiograph signals from a patient's heartbeat by a machine through a series of mathematical calculations constituted a practical application of an abstract idea (a mathematical algorithm, formula, or calculation), because it corresponded to a useful, concrete or tangible thing-the condition of a patient's heart.

Today, we hold that the transformation of data, representing discrete dollar amounts, by a machine through a series of mathematical calculations into a final share price, constitutes a practical application of a mathematical algorithm, formula, or calculation, because it produces “a useful, concrete and tangible result”-a final share price momentarily fixed for recording and reporting purposes and even accepted and relied upon by regulatory authorities and in subsequent trades.

## Maura

Today, we hold that the transformation of data, representing discrete dollar amounts, by a machine through a series of mathematical calculations into a final share price, constitutes a practical application of a mathematical algorithm, formula, or calculation, because it produces "a useful, concrete and tangible result"--a final share price momentarily fixed for recording and reporting purposes and even accepted and relied upon by regulatory authorities and in subsequent trades.

The district court erred by applying the Freeman-Walter-Abele test to determine whether the claimed subject matter was an unpatentable abstract idea. The Freeman-Walter-Abele test was designed by the Court of Customs and Patent Appeals, and subsequently adopted by this court, to extract and identify unpatentable mathematical algorithms in the aftermath of Benson and Flook. See In re Freeman, 573 F.2d 1237, 197 USPQ 464 (CCPA 1978) as modified by In re Walter, 618 F.2d 758, 205 USPQ 397 (CCPA 1980). The test has been thus articulated: 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."

The test determines the presence of, for example, an algorithm. Under Benson, this may have been a sufficient indicium of nonstatutory subject matter. However, after Diehr and Alappat, the mere fact that a claimed invention involves inputting numbers, calculating numbers, outputting numbers, and storing numbers, in and of itself, would not render it nonstatutory subject matter, unless, of course, its operation does not produce a "useful, concrete and tangible result." Alappat, 33 F.3d at 1544, 31 USPQ2d at 1557.7 After all, as we have repeatedly stated, every step-by-step process, be it electronic or chemical or mechanical, involves an algorithm in the broad sense of the term. Since § 101 expressly includes processes as a category of inventions which may be patented and § 100(b) further defines the word "process" as meaning "process, art or method, and includes a new use of a known process, machine, manufacture, composition of matter, or material," it follows that it is no ground for holding a claim is directed to nonstatutory subject matter to say it includes or is directed to an algorithm. This is why the proscription against patenting has been limited to mathematical algorithms....

MPEP § 706.03(a) (1994). This acknowledgment is buttressed by the U.S. Patent and Trademark 1996 Examination Guidelines for Computer Related Inventions which now read: Office personnel have had difficulty in properly treating claims directed to methods of doing business. Claims should not be categorized as methods of doing business. Instead such claims should be treated like any other process claims.

FOOTNOTE 10 As Judge Newman has previously stated, [The business method exception] is ... an unwarranted encumbrance to the definition of statutory subject matter in section 101, that [should] be discarded as error-prone, redundant, and obsolete. It merits retirement from the glossary of section 101.... All of the "doing business" cases could have been decided using the clearer concepts of Title 35. Patentability does not turn on whether the claimed method does "business" instead of something else, but on whether the method, viewed as a whole, meets the requirements of patentability as set forth in Sections 102, 103, and 112 of the Patent Act. In re Schrader, 22 F.3d 290, 298, 30 USPQ2d 1455, 1462 (Fed.Cir.1994) (Newman, J., dissenting).