2 ms·
“The issued patents are published by the patent office so you can find the whole long list of them and see exactly what they say. Of course, you couldn't actual
by teddyh 6y ago
“The issued patents are published by the patent office so you can find the whole long list of them and see exactly what they say. Of course, you couldn't actually read that whole list as there are too many of them. In the US, there are hundreds of thousands of software patents.
There is no way you can keep track of what they are all about. You would have to try to search for relevant ones. Some people say that should be easy in these modern days of computers. You could search for key words and so-on. That one works to a certain extent. You will find some patents in the area. You won't necessarily find them all however. For instance, there was a software patent which may have expired by now on natural order recalculation in spread sheets. This means basically that when you make certain cells depend upon other cells, it always recalculates everything after the things it depends on, so that after one re-calculation, everything is up to date. The first spread sheets did their recalculation top-down, so if you made a cell depend on a cell lower down, and you had a few such steps, you had to recalculate several times to get the new values to propagate upwards. You were supposed to have things depend upon cells above them. Then someone realized why don't I do the recalculation so that everything gets recalculated after the things it depends upon? This algorithm is known as topological sorting. The first reference to it I could find was in 1963. The patent covered several dozen different ways you could implement topological sorting but you wouldn't have found this patent by searching for spreadsheet. You couldn't have found it by searching for natural order or topological sort. It didn't have any of those terms in it. In fact, it was described as a method of compiling formulas into object code. When I first saw it, I thought it was the wrong patent.”
— Richard Stallman, 2002 (https://www.gnu.org/philosophy/software-patents https://www.gnu.org/philosophy/software-patents)
- obviouspatents 6y agoUSPTO is only obligated to search their own database for prior art. Others must pay to invalidate patents that are obvious next steps, just math (which is indeed unpatentable even in the US), infringing other (defensive) patents, or which are invalidateable due to published prior art. It's hard to believe that topological sort (available in the GNU `tsort` and `make` apps, for example) was ever patentable. Perhaps Wikipedia contains references to published prior art? If they don't even look at everyone else's registered-as-unique ideas, how could they have been knowingly infringing? Everyone wants their cut of Progress in the Useful Arts and Sciences. Nobody will invalidate patents for everyone else; USPTO has no obligation to even check a search engine for the subject matter. And then, prove the date that published prior art was published without a distribted time-stamping blockchain. Find the nonce that makes it all worth it! Topological Sort: https://en.wikipedia.org/wiki/Topological_sorting https://en.wikipedia.org/wiki/Topological_sorting Reactive programming: https://en.wikipedia.org/wiki/Reactive_programming https://en.wikipedia.org/wiki/Reactive_programming DOM implementations typically don't repaint the whole screen. (All browsers do graph traversal in order to determine what to redraw or draw first): https://en.wikipedia.org/wiki/Document_Object_Model#Implementations https://en.wikipedia.org/wiki/Document_Object_Model#Implemen...