Difference between revisions of "Software is math"
m (→External links: remove double attribution) |
(→External links: * [http://arstechnica.com/tech-policy/news/2011/08/appeals-court-says-only-complicated-math-is-patentable.ars Does not compute: court says only hard math is patentable], Aug 2011,) |
||
Line 56: | Line 56: | ||
* [http://en.wikipedia.org/wiki/Church%E2%80%93Turing_thesis Church-Turing thesis], '''Wikipedia''' | * [http://en.wikipedia.org/wiki/Church%E2%80%93Turing_thesis Church-Turing thesis], '''Wikipedia''' | ||
* [http://en.wikipedia.org/wiki/Curry%E2%80%93Howard_correspondence Curry–Howard isomorphism], '''Wikipedia''' | * [http://en.wikipedia.org/wiki/Curry%E2%80%93Howard_correspondence Curry–Howard isomorphism], '''Wikipedia''' | ||
+ | * [http://arstechnica.com/tech-policy/news/2011/08/appeals-court-says-only-complicated-math-is-patentable.ars Does not compute: <nowiki>[US]</nowiki> court says only hard math is patentable], Aug 2011, '''[[Timothy B. Lee]]''' | ||
===Counter arguments=== | ===Counter arguments=== |
Revision as of 06:49, 5 January 2012
Mathematical formulas are generally recognised as non-patentable because math is not patentable subject matter.
Since the logic (idea) of software can be reduced to a mathematical formula (idea) with Church-Turing Thesis, and because mathematical formulas (idea) are not patentable, patent applications for software ideas should be rejected.
Respected computer scientist Donald Knuth makes the argument:
To a computer scientist, this makes no sense, because every algorithm is as mathematical as anything could be. An algorithm is an abstract concept unrelated to physical laws of the universe.[1]
Contents
Math is not patentable
Case law in the USA
In the USA, math is unpatentable because it is a "law of nature", that is to say a "scientific truth", and as such it can never be "invented", only "discovered", and patents are not granted for discoveries.
The non-patentability of math was confirmed in the case Parker v. Flook (1978, USA):
Respondent's method for updating alarm limits during catalytic conversion processes, in which the only novel feature is a mathematical formula, held not patentable under 101 of the Patent Act.
Also, in the 1948 case Funk Bros. v. Kalo Inoculant:
He who discovers a hitherto unknown phenomenon of nature has no claim to a monopoly of it which the law recognizes. If there is to be invention from such a discovery, it must come from the application of the law of nature to a new and useful end.[2]
Ideas which use math can be patentable, but this is not controversial:
While a scientific truth, or the mathematical expression of it, is not patentable invention, a novel and useful structure created with the aid of knowledge of scientific truth may be.[3]
Church-Turing Thesis or Curry-Howard isomorphism?
There are two mathematical bases that can be used to make this argument.Can you help? This page was written by a non-specialist. Any help would be appreciated.
The Church-Turing Thesis is the more commonly used based. It is discussed by some documents linked in the #External links section.
Another approach would be the Curry-Howard isomorphism, which demonstrates that computer programs are equivalent to mathematical proofs. If proofs are unpatentable, then computer programs must be too.
Related pages on ESP Wiki
- Anti-lock braking example - if the physical car invention is patentable, should an in-computer game-simulation be?
- Books:
- Software does not make a computer a new machine
- Australia#Case law - patents on math might be valid in Australia
External links
- (in German) http://www.users.sbg.ac.at/~jack/legal/swp/tech-turing-lambda.pdf
- The Rise Of The Information Processing Patent, by Ben Klemens (Church-Turing is discussed on page 8)
- An Explanation of Computation Theory for Lawyers, Groklaw, 11 Nov 2009
- A Simpler Explanation of Why Software is Mathematics, Groklaw, 8 Sep 2011
- Physical Aspects of Mathematics (An Open Response to the USPTO), 27 Sep 2010, PolR (Groklaw) (submission to USPTO 2010 consultation - deadline 27 sept)
- 1 + 1 (pat. pending) — Mathematics, Software and Free Speech, 26 Apr 2011, PolR (Groklaw)
- Church-Turing thesis, Wikipedia
- Curry–Howard isomorphism, Wikipedia
- Does not compute: [US] court says only hard math is patentable, Aug 2011, Timothy B. Lee
Counter arguments
- Computer Software is Not Math
- On Abstraction and Equivalence in Software Patent Doctrine: A Response to Bessen, Meurer, and Klemens (challenging, inter alia, Klemens's "repeated mischaracterizations of the Church-Turing Thesis")