|
Authored by: PolR on Sunday, October 14 2012 @ 06:36 PM EDT |
Software cannot be reduced to boolean circuits in the sense of logic gates. You
also need to add conventions on how to interpret the symbols, their syntax and
you also need to define the meanings of the symbols. This is one of the major
points of the article.
[ Reply to This | Parent | # ]
|
|
Authored by: scav on Monday, October 15 2012 @ 06:17 AM EDT |
Although you could construct a pure-hardware equivalent of
any specific computer program, it would be at the very least
extremely inflexible and difficult to upgrade. It might not
be patentable then for the reason that it wouldn't be as
useful as what is currently available. But even if it were
patented, it would be the hardware itself that was the
patentable machine, not the abstract mathematical algorithm,
(and nobody would bother to build an infringing equally
useless device.)
A hardware device that implemented a universal algorithm
would be very useful of course. That's why we have been
building them for several decades, and using them to perform
entirely mathematical computations written in mathematical
notation.
---
The emperor, undaunted by overwhelming evidence that he had no clothes,
redoubled his siege of Antarctica to extort tribute from the penguins.[ Reply to This | Parent | # ]
|
|
|
|
|