When determining whether a claim integrates a judicial exception, into a practical application in Step 2A Prong Two and whether a claim recites significantly more than a judicial exception in Step 2B, examiners should consider whether the judicial exception is applied with, or by use of, a particular machine. "The machine-or-transformation test is a useful and important clue, and investigative tool” for determining whether a claim is patent eligible under § 101. Bilski v. Kappos, 561 U.S. 593, 604, 95 USPQ2d 1001, 1007 (2010).

It is important to note that a general purpose computer that applies a judicial exception, such as an abstract idea, by use of conventional computer functions does not qualify as a particular machine. Ultramercial, Inc. v. Hulu, LLC, 772 F.3d 709, 716-17, 112 USPQ2d 1750, 1755-56 (Fed. Cir. 2014). See also TLI Communications LLC v. AV Automotive LLC, 823 F.3d 607, 613, 118 USPQ2d 1744, 1748 (Fed. Cir. 2016) (mere recitation of concrete or tangible components is not an inventive concept); Eon Corp. IP Holdings LLC v. AT&T Mobility LLC, 785 F.3d 616, 623, 114 USPQ2d 1711, 1715 (Fed. Cir. 2015) (noting that Alappat ’s rationale that an otherwise ineligible algorithm or software could be made patent-eligible by merely adding a generic computer to the claim was superseded by the Supreme Court’s Bilski and Alice Corp. decisions). If applicant amends a claim to add a generic computer or generic computer components and asserts that the claim recites significantly more because the generic computer is 'specially programmed' (as in Alappat, now considered superseded) or is a 'particular machine' (as in Bilski), the examiner should look at whether the added elements integrate the exception into a practical application or provide significantly more than the judicial exception. Merely adding a generic computer, generic computer components, or a programmed computer to perform generic computer functions does not automatically overcome an eligibility rejection. Alice Corp. Pty. Ltd. v. CLS Bank Int’l, 573 U.S. 208, 223-24, 110 USPQ2d 1976, 1983-84 (2014). See In re Alappat, 33 F.3d 1526, 1545, 31 USPQ2d 1545, 1558 (Fed. Cir. 1994); In re Bilski, 545 F.3d 943, 88 USPQ2d 1385 (Fed. Cir. 2008)

It is important to note that a general purpose computer that applies a judicial exception, such as an abstract idea, by use of conventional computer functions does not qualify as a particular machine. Ultramercial, Inc. v. Hulu, LLC, 772 F.3d 709, 716-17, 112 USPQ2d 1750, 1755-56 (Fed. Cir. 2014). See also TLI Communications LLC v. AV Automotive LLC, 823 F.3d 607, 613, 118 USPQ2d 1744, 1748 (Fed. Cir. 2016) (mere recitation of concrete or tangible components is not an inventive concept); Eon Corp. IP Holdings LLC v. AT&T Mobility LLC, 785 F.3d 616, 623, 114 USPQ2d 1711, 1715 (Fed. Cir. 2015) (noting that Alappat ’s rationale that an otherwise ineligible algorithm or software could be made patent-eligible by merely adding a generic computer to the claim was superseded by the Supreme Court’s Bilski and Alice Corp. decisions). If applicant amends a claim to add a generic computer or generic computer components and asserts that the claim recites significantly more because the generic computer is 'specially programmed' (as in Alappat, now considered superseded) or is a 'particular machine' (as in Bilski), the examiner should look at whether the added elements integrate the exception into a practical application or provide significantly more than the judicial exception. Merely adding a generic computer, generic computer components, or a programmed computer to perform generic computer functions does not automatically overcome an eligibility rejection. Alice Corp. Pty. Ltd. v. CLS Bank Int’l, 573 U.S. 208, 223-24, 110 USPQ2d 1976, 1983-84 (2014). See In re Alappat, 33 F.3d 1526, 1545, 31 USPQ2d 1545, 1558 (Fed. Cir. 1994); In re Bilski, 545 F.3d 943, 88 USPQ2d 1385 (Fed. Cir. 2008)

It is important to note that a general purpose computer that applies a judicial exception, such as an abstract idea, by use of conventional computer functions does not qualify as a particular machine. Ultramercial, Inc. v. Hulu, LLC, 772 F.3d 709, 716-17, 112 USPQ2d 1750, 1755-56 (Fed. Cir. 2014). See also TLI Communications LLC v. AV Automotive LLC, 823 F.3d 607, 613, 118 USPQ2d 1744, 1748 (Fed. Cir. 2016) (mere recitation of concrete or tangible components is not an inventive concept); Eon Corp. IP Holdings LLC v. AT&T Mobility LLC, 785 F.3d 616, 623, 114 USPQ2d 1711, 1715 (Fed. Cir. 2015) (noting that Alappat ’s rationale that an otherwise ineligible algorithm or software could be made patent-eligible by merely adding a generic computer to the claim was superseded by the Supreme Court’s Bilski and Alice Corp. decisions). If applicant amends a claim to add a generic computer or generic computer components and asserts that the claim recites significantly more because the generic computer is 'specially programmed' (as in Alappat, now considered superseded) or is a 'particular machine' (as in Bilski), the examiner should look at whether the added elements integrate the exception into a practical application or provide significantly more than the judicial exception. Merely adding a generic computer, generic computer components, or a programmed computer to perform generic computer functions does not automatically overcome an eligibility rejection. Alice Corp. Pty. Ltd. v. CLS Bank Int’l, 573 U.S. 208, 223-24, 110 USPQ2d 1976, 1983-84 (2014). See In re Alappat, 33 F.3d 1526, 1545, 31 USPQ2d 1545, 1558 (Fed. Cir. 1994); In re Bilski, 545 F.3d 943, 88 USPQ2d 1385 (Fed. Cir. 2008)

All claims must be evaluated for eligibility using the two-part test from Alice/Mayo. If a claim passes the Alice/Mayo test (i.e., is not directed to an exception at Step 2A, or amounts to significantly more than any recited exception in Step 2B), then the claim is eligible even if it fails the machine-or-transformation test ("M-or-T test"). Bilski v. Kappos, 561 U.S. 593, 604, 95 USPQ2d 1001, 1007 (2010) (explaining that a claim may be eligible even if it does not satisfy the M-or-T test); McRO, Inc. v. Bandai Namco Games Am. Inc., 837 F.3d 1299, 1315, 120 USPQ2d 1091, 1102 (Fed. Cir. 2016) (“[T]here is nothing that requires a method ‘be tied to a machine or transform an article’ to be patentable”). And if a claim fails the Alice/Mayo test (i.e., is directed to an exception at Step 2A and does not amount to significantly more than the exception in Step 2B), then the claim is ineligible even if it passes the M-or-T test. DDR Holdings, LLC v. Hotels.com, L.P., 773 F.3d 1245, 1256, 113 USPQ2d 1097, 1104 (Fed. Cir. 2014) (“[I]n Mayo, the Supreme Court emphasized that satisfying the machine-or-transformation test, by itself, is not sufficient to render a claim patent-eligible, as not all transformations or machine implementations infuse an otherwise ineligible claim with an 'inventive concept.'”).

All claims must be evaluated for eligibility using the two-part test from Alice/Mayo. If a claim passes the Alice/Mayo test (i.e., is not directed to an exception at Step 2A, or amounts to significantly more than any recited exception in Step 2B), then the claim is eligible even if it fails the machine-or-transformation test ("M-or-T test"). Bilski v. Kappos, 561 U.S. 593, 604, 95 USPQ2d 1001, 1007 (2010) (explaining that a claim may be eligible even if it does not satisfy the M-or-T test); McRO, Inc. v. Bandai Namco Games Am. Inc., 837 F.3d 1299, 1315, 120 USPQ2d 1091, 1102 (Fed. Cir. 2016) (“[T]here is nothing that requires a method ‘be tied to a machine or transform an article’ to be patentable”). And if a claim fails the Alice/Mayo test (i.e., is directed to an exception at Step 2A and does not amount to significantly more than the exception in Step 2B), then the claim is ineligible even if it passes the M-or-T test. DDR Holdings, LLC v. Hotels.com, L.P., 773 F.3d 1245, 1256, 113 USPQ2d 1097, 1104 (Fed. Cir. 2014) (“[I]n Mayo, the Supreme Court emphasized that satisfying the machine-or-transformation test, by itself, is not sufficient to render a claim patent-eligible, as not all transformations or machine implementations infuse an otherwise ineligible claim with an 'inventive concept.'”).

All claims must be evaluated for eligibility using the two-part test from Alice/Mayo. If a claim passes the Alice/Mayo test (i.e., is not directed to an exception at Step 2A, or amounts to significantly more than any recited exception in Step 2B), then the claim is eligible even if it fails the machine-or-transformation test ("M-or-T test"). Bilski v. Kappos, 561 U.S. 593, 604, 95 USPQ2d 1001, 1007 (2010) (explaining that a claim may be eligible even if it does not satisfy the M-or-T test); McRO, Inc. v. Bandai Namco Games Am. Inc., 837 F.3d 1299, 1315, 120 USPQ2d 1091, 1102 (Fed. Cir. 2016) (“[T]here is nothing that requires a method ‘be tied to a machine or transform an article’ to be patentable”). And if a claim fails the Alice/Mayo test (i.e., is directed to an exception at Step 2A and does not amount to significantly more than the exception in Step 2B), then the claim is ineligible even if it passes the M-or-T test. DDR Holdings, LLC v. Hotels.com, L.P., 773 F.3d 1245, 1256, 113 USPQ2d 1097, 1104 (Fed. Cir. 2014) (“[I]n Mayo, the Supreme Court emphasized that satisfying the machine-or-transformation test, by itself, is not sufficient to render a claim patent-eligible, as not all transformations or machine implementations infuse an otherwise ineligible claim with an 'inventive concept.'”).

It is important to note that a general purpose computer that applies a judicial exception, such as an abstract idea, by use of conventional computer functions does not qualify as a particular machine. Ultramercial, Inc. v. Hulu, LLC, 772 F.3d 709, 716-17, 112 USPQ2d 1750, 1755-56 (Fed. Cir. 2014). See also TLI Communications LLC v. AV Automotive LLC, 823 F.3d 607, 613, 118 USPQ2d 1744, 1748 (Fed. Cir. 2016) (mere recitation of concrete or tangible components is not an inventive concept); Eon Corp. IP Holdings LLC v. AT&T Mobility LLC, 785 F.3d 616, 623, 114 USPQ2d 1711, 1715 (Fed. Cir. 2015) (noting that Alappat ’s rationale that an otherwise ineligible algorithm or software could be made patent-eligible by merely adding a generic computer to the claim was superseded by the Supreme Court’s Bilski and Alice Corp. decisions). If applicant amends a claim to add a generic computer or generic computer components and asserts that the claim recites significantly more because the generic computer is 'specially programmed' (as in Alappat, now considered superseded) or is a 'particular machine' (as in Bilski), the examiner should look at whether the added elements integrate the exception into a practical application or provide significantly more than the judicial exception. Merely adding a generic computer, generic computer components, or a programmed computer to perform generic computer functions does not automatically overcome an eligibility rejection. Alice Corp. Pty. Ltd. v. CLS Bank Int’l, 573 U.S. 208, 223-24, 110 USPQ2d 1976, 1983-84 (2014). See In re Alappat, 33 F.3d 1526, 1545, 31 USPQ2d 1545, 1558 (Fed. Cir. 1994); In re Bilski, 545 F.3d 943, 88 USPQ2d 1385 (Fed. Cir. 2008)

Integral use of a machine to achieve performance of a method may integrate the recited judicial exception into a practical application or provide significantly more, in contrast to where the machine is merely an object on which the method operates, which does not integrate the exception into a practical application or provide significantly more. See CyberSource v. Retail Decisions, 654 F.3d 1366, 1370, 99 USPQ2d 1690, 1694 (Fed. Cir. 2011) ("We are not persuaded by the appellant's argument that the claimed method is tied to a particular machine because it ‘would not be necessary or possible without the Internet.’… Regardless of whether "the Internet" can be viewed as a machine, it is clear that the Internet cannot perform the fraud detection steps of the claimed method"). For example, as described in MPEP § 2106.05(f), additional elements that invoke computers or other machinery merely as a tool to perform an existing process will generally not amount to significantly more than a judicial exception. See, e.g., Versata Development Group v. SAP America, 793 F.3d 1306, 1335, 115 USPQ2d 1681, 1702 (Fed. Cir. 2015) (explaining that in order for a machine to add significantly more, it must “play a significant part in permitting the claimed method to be performed, rather than function solely as an obvious mechanism for permitting a solution to be achieved more quickly”).

Integral use of a machine to achieve performance of a method may integrate the recited judicial exception into a practical application or provide significantly more, in contrast to where the machine is merely an object on which the method operates, which does not integrate the exception into a practical application or provide significantly more. See CyberSource v. Retail Decisions, 654 F.3d 1366, 1370, 99 USPQ2d 1690, 1694 (Fed. Cir. 2011) ("We are not persuaded by the appellant's argument that the claimed method is tied to a particular machine because it ‘would not be necessary or possible without the Internet.’… Regardless of whether "the Internet" can be viewed as a machine, it is clear that the Internet cannot perform the fraud detection steps of the claimed method"). For example, as described in MPEP § 2106.05(f), additional elements that invoke computers or other machinery merely as a tool to perform an existing process will generally not amount to significantly more than a judicial exception. See, e.g., Versata Development Group v. SAP America, 793 F.3d 1306, 1335, 115 USPQ2d 1681, 1702 (Fed. Cir. 2015) (explaining that in order for a machine to add significantly more, it must “play a significant part in permitting the claimed method to be performed, rather than function solely as an obvious mechanism for permitting a solution to be achieved more quickly”).

Integral use of a machine to achieve performance of a method may integrate the recited judicial exception into a practical application or provide significantly more, in contrast to where the machine is merely an object on which the method operates, which does not integrate the exception into a practical application or provide significantly more. See CyberSource v. Retail Decisions, 654 F.3d 1366, 1370, 99 USPQ2d 1690, 1694 (Fed. Cir. 2011) ("We are not persuaded by the appellant's argument that the claimed method is tied to a particular machine because it ‘would not be necessary or possible without the Internet.’… Regardless of whether "the Internet" can be viewed as a machine, it is clear that the Internet cannot perform the fraud detection steps of the claimed method"). For example, as described in MPEP § 2106.05(f), additional elements that invoke computers or other machinery merely as a tool to perform an existing process will generally not amount to significantly more than a judicial exception. See, e.g., Versata Development Group v. SAP America, 793 F.3d 1306, 1335, 115 USPQ2d 1681, 1702 (Fed. Cir. 2015) (explaining that in order for a machine to add significantly more, it must “play a significant part in permitting the claimed method to be performed, rather than function solely as an obvious mechanism for permitting a solution to be achieved more quickly”).

Integral use of a machine to achieve performance of a method may integrate the recited judicial exception into a practical application or provide significantly more, in contrast to where the machine is merely an object on which the method operates, which does not integrate the exception into a practical application or provide significantly more. See CyberSource v. Retail Decisions, 654 F.3d 1366, 1370, 99 USPQ2d 1690, 1694 (Fed. Cir. 2011) ("We are not persuaded by the appellant's argument that the claimed method is tied to a particular machine because it ‘would not be necessary or possible without the Internet.’… Regardless of whether "the Internet" can be viewed as a machine, it is clear that the Internet cannot perform the fraud detection steps of the claimed method"). For example, as described in MPEP § 2106.05(f), additional elements that invoke computers or other machinery merely as a tool to perform an existing process will generally not amount to significantly more than a judicial exception. See, e.g., Versata Development Group v. SAP America, 793 F.3d 1306, 1335, 115 USPQ2d 1681, 1702 (Fed. Cir. 2015) (explaining that in order for a machine to add significantly more, it must “play a significant part in permitting the claimed method to be performed, rather than function solely as an obvious mechanism for permitting a solution to be achieved more quickly”).

All claims must be evaluated for eligibility using the two-part test from Alice/Mayo. If a claim passes the Alice/Mayo test (i.e., is not directed to an exception at Step 2A, or amounts to significantly more than any recited exception in Step 2B), then the claim is eligible even if it fails the machine-or-transformation test ("M-or-T test"). Bilski v. Kappos, 561 U.S. 593, 604, 95 USPQ2d 1001, 1007 (2010) (explaining that a claim may be eligible even if it does not satisfy the M-or-T test); McRO, Inc. v. Bandai Namco Games Am. Inc., 837 F.3d 1299, 1315, 120 USPQ2d 1091, 1102 (Fed. Cir. 2016) (“[T]here is nothing that requires a method ‘be tied to a machine or transform an article’ to be patentable”). And if a claim fails the Alice/Mayo test (i.e., is directed to an exception at Step 2A and does not amount to significantly more than the exception in Step 2B), then the claim is ineligible even if it passes the M-or-T test. DDR Holdings, LLC v. Hotels.com, L.P., 773 F.3d 1245, 1256, 113 USPQ2d 1097, 1104 (Fed. Cir. 2014) (“[I]n Mayo, the Supreme Court emphasized that satisfying the machine-or-transformation test, by itself, is not sufficient to render a claim patent-eligible, as not all transformations or machine implementations infuse an otherwise ineligible claim with an 'inventive concept.'”).

It is important to note that a general purpose computer that applies a judicial exception, such as an abstract idea, by use of conventional computer functions does not qualify as a particular machine. Ultramercial, Inc. v. Hulu, LLC, 772 F.3d 709, 716-17, 112 USPQ2d 1750, 1755-56 (Fed. Cir. 2014). See also TLI Communications LLC v. AV Automotive LLC, 823 F.3d 607, 613, 118 USPQ2d 1744, 1748 (Fed. Cir. 2016) (mere recitation of concrete or tangible components is not an inventive concept); Eon Corp. IP Holdings LLC v. AT&T Mobility LLC, 785 F.3d 616, 623, 114 USPQ2d 1711, 1715 (Fed. Cir. 2015) (noting that Alappat ’s rationale that an otherwise ineligible algorithm or software could be made patent-eligible by merely adding a generic computer to the claim was superseded by the Supreme Court’s Bilski and Alice Corp. decisions). If applicant amends a claim to add a generic computer or generic computer components and asserts that the claim recites significantly more because the generic computer is 'specially programmed' (as in Alappat, now considered superseded) or is a 'particular machine' (as in Bilski), the examiner should look at whether the added elements integrate the exception into a practical application or provide significantly more than the judicial exception. Merely adding a generic computer, generic computer components, or a programmed computer to perform generic computer functions does not automatically overcome an eligibility rejection. Alice Corp. Pty. Ltd. v. CLS Bank Int’l, 573 U.S. 208, 223-24, 110 USPQ2d 1976, 1983-84 (2014). See In re Alappat, 33 F.3d 1526, 1545, 31 USPQ2d 1545, 1558 (Fed. Cir. 1994); In re Bilski, 545 F.3d 943, 88 USPQ2d 1385 (Fed. Cir. 2008)

When determining whether a claim integrates a judicial exception, into a practical application in Step 2A Prong Two and whether a claim recites significantly more than a judicial exception in Step 2B, examiners should consider whether the judicial exception is applied with, or by use of, a particular machine. "The machine-or-transformation test is a useful and important clue, and investigative tool” for determining whether a claim is patent eligible under § 101. Bilski v. Kappos, 561 U.S. 593, 604, 95 USPQ2d 1001, 1007 (2010).

It is important to note that a general purpose computer that applies a judicial exception, such as an abstract idea, by use of conventional computer functions does not qualify as a particular machine. Ultramercial, Inc. v. Hulu, LLC, 772 F.3d 709, 716-17, 112 USPQ2d 1750, 1755-56 (Fed. Cir. 2014). See also TLI Communications LLC v. AV Automotive LLC, 823 F.3d 607, 613, 118 USPQ2d 1744, 1748 (Fed. Cir. 2016) (mere recitation of concrete or tangible components is not an inventive concept); Eon Corp. IP Holdings LLC v. AT&T Mobility LLC, 785 F.3d 616, 623, 114 USPQ2d 1711, 1715 (Fed. Cir. 2015) (noting that Alappat ’s rationale that an otherwise ineligible algorithm or software could be made patent-eligible by merely adding a generic computer to the claim was superseded by the Supreme Court’s Bilski and Alice Corp. decisions). If applicant amends a claim to add a generic computer or generic computer components and asserts that the claim recites significantly more because the generic computer is 'specially programmed' (as in Alappat, now considered superseded) or is a 'particular machine' (as in Bilski), the examiner should look at whether the added elements integrate the exception into a practical application or provide significantly more than the judicial exception. Merely adding a generic computer, generic computer components, or a programmed computer to perform generic computer functions does not automatically overcome an eligibility rejection. Alice Corp. Pty. Ltd. v. CLS Bank Int’l, 573 U.S. 208, 223-24, 110 USPQ2d 1976, 1983-84 (2014). See In re Alappat, 33 F.3d 1526, 1545, 31 USPQ2d 1545, 1558 (Fed. Cir. 1994); In re Bilski, 545 F.3d 943, 88 USPQ2d 1385 (Fed. Cir. 2008)

Integral use of a machine to achieve performance of a method may integrate the recited judicial exception into a practical application or provide significantly more, in contrast to where the machine is merely an object on which the method operates, which does not integrate the exception into a practical application or provide significantly more. See CyberSource v. Retail Decisions, 654 F.3d 1366, 1370, 99 USPQ2d 1690, 1694 (Fed. Cir. 2011) ("We are not persuaded by the appellant's argument that the claimed method is tied to a particular machine because it ‘would not be necessary or possible without the Internet.’… Regardless of whether "the Internet" can be viewed as a machine, it is clear that the Internet cannot perform the fraud detection steps of the claimed method"). For example, as described in MPEP § 2106.05(f), additional elements that invoke computers or other machinery merely as a tool to perform an existing process will generally not amount to significantly more than a judicial exception. See, e.g., Versata Development Group v. SAP America, 793 F.3d 1306, 1335, 115 USPQ2d 1681, 1702 (Fed. Cir. 2015) (explaining that in order for a machine to add significantly more, it must “play a significant part in permitting the claimed method to be performed, rather than function solely as an obvious mechanism for permitting a solution to be achieved more quickly”).