Both examples you gave are algorithms that can be applied with pencil and paper.

Software is just a particular implementation of the algorithms.

Ergo: the algorithms may have been quite tough to develop - much like the proof for E=MC² - however, the application of that algorithm to the computer in the form of software is obvious to any software developer.

All algorithms can be applied as software. There is no exception. And the moment you learn that concept, applying any other algorithm as software is obvious. It's only to those who think you can't apply an algorithm (any algorithm) to software that it would become non-obvious.

Granted... the tool(s) used to develop the algorithms may very well have been a computer with software.... that doesn't change the fact the algorithms themselves are algorithms that can be applied to data via pencil and paper.

[ Reply to This | Parent | # ]

• & the algorithms are unpatentable because pure math, therefore abstract - Authored by: Anonymous on Friday, July 20 2012 @ 06:59 PM EDT