[%TAGS (074db819ec% %074db819ec) %]
(074db819ec% IF user.email && action == 'arc' %074db819ec)
(074db819ec% END %074db819ec)
- From: Xuan Baldauf baldauf@medium.net
- Subject: [Patents] Re: [Patents] wide realm of future patentability
- Date: Sat, 30 Oct 1999 00:29:39 +0200
PILCH Hartmut wrote:
> A current tendency of the patent system is to formulate the principles
> that
>
> - anything "technical", e.g. anything that makes use of
> natural laws to perform a certain function, is patentable
> - a Turing machine is a device that makes use of natural laws
[snap]
AFAIK a turing machine is a kind of virtual computer. Virtual computer
processing (like processing a turing machine) can be done without any
knowledge of natural law, only simple math is needed. (e.g. you could
simulate
a turing machine using a sheed of paper and a pen) Patent guidelines
currently
say that math (including mathematical proof) is not patentable. So any
given
turing machine cannot be patentable.
=3D> every process of executing a computer program is not patentable
Please tell me that (and where) I am wrong.
cu,
Xu=E2n Baldauf.
- [Patents] Re: [Patents] wide realm of future patentability, Xuan Baldauf baldauf
(074db819ec%|loc%074db819ec)Archive powered by(074db819ec%END%074db819ec) MhonArc 2.6.16.
(074db819ec%TAGS [% %]%074db819ec)