ESP Wiki is looking for moderators and active contributors!
Difference between revisions of "Software is math"
m (==Related pages on {{SITENAME}}== * Anti-lock braking example - if the physical car invention is patentable, should an in-computer game-simulation be?) |
m (markup) |
||
| Line 1: | Line 1: | ||
| − | + | '''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 mathematical formula (idea) with Church-Turing Thesis, and because mathematical | + | 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. |
==Related pages on {{SITENAME}}== | ==Related pages on {{SITENAME}}== | ||
Revision as of 16:56, 7 August 2009
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.
Related pages on ESP Wiki
- Anti-lock braking example - if the physical car invention is patentable, should an in-computer game-simulation be?
