ESP Wiki is looking for moderators and active contributors!

Difference between revisions of "Particular machine or transformation"

(182.636363636364)
m (Reverted edits by 213.30.209.82 (Talk) to last revision by Ciaran)
Line 1: Line 1:
−
pfOXfZ  <a href="http://yhclpzzycnhj.com/">yhclpzzycnhj</a>, [url=http://upgswztkosiv.com/]upgswztkosiv[/url], [link=http://tbkehixvspvv.com/]tbkehixvspvv[/link], http://dpyidggnvevu.com/
+
{{navbox}}The '''particular machine or transformation''' test refers to the test described by the 2008 ruling of the [[USA]]'s CAFC in the case [[in re Bilski]].
 +
 
 +
:''A claimed process is surely patent-eligible under § 101 if: (1) it is tied to a particular machine or apparatus, or (2) it transforms a particular article into a different state or thing. See Benson, 409 U.S. at 70 ("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.'' Diehr, 450 U.S. at 192 (quoted in the CAFC's Bilski ruling)
 +
 
 +
==Processes and machines==
 +
 
 +
Legislation in the USA allows the USPTO to grant patents for ''"any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof"''.<ref>http://www.law.cornell.edu/patent/35uscs101.html</ref>
 +
 
 +
The particular-machine-or-transformation test only applies to "processes".  Thus, it seems that if a programmed computer was claimed as a "machine", it wouldn't have to pass the particular-machine-or-transformation test.  This issue was discussed, and there was either confusion or disagreement about it at the [[US Supreme Court|Supreme Court]]'s hearing of [[Bilski v. Kappos (2009, USA)|Bilski v. Kappos]] in 2009. ([http://news.swpat.org/2009/11/bilski-hearing-transcript/ hearing transcript])
 +
 
 +
==External links==
 +
* Wikipedia: [http://en.wikipedia.org/wiki/Machine-or-transformation_test Machine-or-transformation test]
 +
* http://www.cafc.uscourts.gov/opinions/07-1130.pdf - the 2008 CAFC Bilsk ruling
 +
* [http://www.ip-watch.org/weblog/2009/10/16/how-the-machine-or-transformation-test-in-bilski-is-failing/ How The “Machine-Or-Transformation” Test In Bilski Is Failing]
 +
 
 +
===Court rulings based on the test===
 +
* http://legalpad.typepad.com/my_weblog/2009/12/while-supremes-ponder-bilski-is-still-slayin-at-the-local-level.html
 +
 
 +
==References==
 +
<references />
 +
 
 +
 
 +
{{footer}}
 +
[[Category:Bilski]]

Revision as of 00:42, 25 May 2010

The particular machine or transformation test refers to the test described by the 2008 ruling of the USA's CAFC in the case in re Bilski.

A claimed process is surely patent-eligible under § 101 if: (1) it is tied to a particular machine or apparatus, or (2) it transforms a particular article into a different state or thing. See Benson, 409 U.S. at 70 ("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. Diehr, 450 U.S. at 192 (quoted in the CAFC's Bilski ruling)

Processes and machines

Legislation in the USA allows the USPTO to grant patents for "any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof".[1]

The particular-machine-or-transformation test only applies to "processes". Thus, it seems that if a programmed computer was claimed as a "machine", it wouldn't have to pass the particular-machine-or-transformation test. This issue was discussed, and there was either confusion or disagreement about it at the Supreme Court's hearing of Bilski v. Kappos in 2009. (hearing transcript)

External links

Court rulings based on the test

References

  1. ↑ http://www.law.cornell.edu/patent/35uscs101.html
Retrieved from "https://wiki.endsoftwarepatents.org/w/index.php?title=Particular_machine_or_transformation&oldid=13291"