|
Authored by: greed on Monday, June 11 2012 @ 12:05 PM EDT |
Right; we still don't have a polynomial time solution to Travelling Salesman.
But our satnav systems work well enough... most of the time. Why?
Because an approximation algorithm that took two days on a Commodore
64--assuming you could feed it enough storage--runs in about 17 seconds on a 2.5
GHz quad-core CPU. (Assuming there's enough parallelism to keep all cores
running and similar work-per-clock rates.)
[ Reply to This | Parent | # ]
|
|
Authored by: mrisch on Monday, June 11 2012 @ 01:04 PM EDT |
Agreed - that's why I say that most software patents are a
specific solution to a specific problem with specific resource
constraints - and that within those constraints they might be
inventive. The question is whether you get the broad solution
when the constraints are lessened. The 20 year patent term is
part of the problem.[ Reply to This | Parent | # ]
|
|
|
|
|