ESP Wiki is looking for moderators and active contributors!
Difference between revisions of "Software is math"
m (→External links: {{lang de}}) |
(→Related pages on {{SITENAME}}: * [http://en.wikipedia.org/wiki/Church%E2%80%93Turing_thesis Wikipedia: Church-Turing thesis]) |
||
| Line 6: | Line 6: | ||
* [[Anti-lock braking example]] - if the physical car invention is patentable, should an in-computer game-simulation be? | * [[Anti-lock braking example]] - if the physical car invention is patentable, should an in-computer game-simulation be? | ||
* Book: [[Math You Can't Use]] | * Book: [[Math You Can't Use]] | ||
| + | * [http://en.wikipedia.org/wiki/Church%E2%80%93Turing_thesis Wikipedia: Church-Turing thesis] | ||
==External links== | ==External links== | ||
Revision as of 20:38, 21 January 2010
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?
- Book: Math You Can't Use
- Wikipedia: Church-Turing thesis
