ESP Wiki is looking for moderators and active contributors!

Difference between revisions of "Infringement is unavoidable and clearance is impossible"

m (Even a company with a lot of funding and a large legal team (who who supports of software patents), namely Microsoft, cannot avoid patent infringement. See: [[Microsoft#Microsoft's patent infring)
 
Line 2: Line 2:
  
 
Even a company with a lot of funding and a large legal team (who who supports of software patents), namely [[Microsoft]], cannot avoid patent infringement.  See: [[Microsoft#Microsoft's patent infringements]].
 
Even a company with a lot of funding and a large legal team (who who supports of software patents), namely [[Microsoft]], cannot avoid patent infringement.  See: [[Microsoft#Microsoft's patent infringements]].
 +
 +
Searching for patents in order to avoid infringement is in practice impossible, partly because of the sheer number of them, and partly because there is no standardization of the vocabulary that is used. A system in which "components" send "messages" to each other can be technically identical to one in which "agents" transmit "documents".
 +
 +
Not only is infringement unavoidable, it is also undecidable. In computer science there is no objective way of deciding whether two programs are equivalent, and therefore whether one program violates a claim made on behalf of the other.
  
 
==External links==
 
==External links==

Revision as of 15:53, 30 November 2009

Avoiding software patents is difficult or impossible.

Even a company with a lot of funding and a large legal team (who who supports of software patents), namely Microsoft, cannot avoid patent infringement. See: Microsoft#Microsoft's patent infringements.

Searching for patents in order to avoid infringement is in practice impossible, partly because of the sheer number of them, and partly because there is no standardization of the vocabulary that is used. A system in which "components" send "messages" to each other can be technically identical to one in which "agents" transmit "documents".

Not only is infringement unavoidable, it is also undecidable. In computer science there is no objective way of deciding whether two programs are equivalent, and therefore whether one program violates a claim made on behalf of the other.

External links