|
Authored by: albert on Thursday, June 14 2012 @ 08:24 PM EDT |
The RSA or ANY algorithm should NOT be patentable. It's MATH.
Your problem is thinking that ANYTHING that's not obvious and
useful is patentable. I don't see a connection between
patentability and 'problems and solutions'. Please give an
example of a 'good' software patent.[ Reply to This | Parent | # ]
|
|
Authored by: Anonymous on Tuesday, June 19 2012 @ 02:47 PM EDT |
You make a very good point that no matter how non-obvious the problem is, the
problem cannot be patented only a non-obvious invention that solves the stated
problem.
Clearly stating a problem often requires significant and insightful work, but a
statement of a problem can't be patented. If once the problem is clearly stated
the solution is non-obvious then the invention that implements that solution may
be patentable. However, often the solution is obvious when the problem is
clearly stated.
Given the multiple layers of abstraction that are a part of computer
programming, it is not always clear when you stop clarifying the problem and
start presenting the solution.[ Reply to This | Parent | # ]
|
|
|
|
|