Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!helios!bcm!dimacs.rutgers.edu!seismo!uunet!ogicse!pdxgate!eecs!berggren
From: berggren@eecs.cs.pdx.edu (Eric Berggren)
Newsgroups: comp.misc
Subject: Re: Software Patents
Message-ID: <1804@pdxgate.UUCP>
Date: 28 Feb 91 20:07:06 GMT
References: <820@puck.mrcu>
Sender: news@pdxgate.UUCP
Lines: 38

paj@uk.co.gec-mrc (Paul Johnson) writes:

>I am of the opinion that any non-recursive algorithm can be patented.
>Here is what you do (note: I have no legal or patent expertise
>whatsoever).

>First, write down your algorithm in C or Pascal without using
>recursion.

>Second, translate the code into a diagram with every variable
>represented by a register and every operation represented by a piece
>of hardware (e.g. adders, multipliers).  Write text describing each
>stage of the computation.  You now have a description of a machine
>which executes your algorithm.

>Apply for a patent.  If someone implements your algorithm in software,
>you can point to memory locations where variables are stored and
>alledge that these correspond to the registers, and state that the ALU
>is doing the work of the adders and multipliers.

>Of course this is a lot of work, but a program to produce such a set
>of diagrams and descriptions could be written.  It might even be
>possible as a back end to gcc.

> ...  ...


  Well... well... well... It's nice to see we're all exercising our legal
rights. I never knew something as ridiculous as this even existed until
X Windows became property of AT&T.
  Oh well, if anyone ever uses software, we can always sue Sue SUE!!!!

-unhappy..

==============================================================================
  Eric Berggren             |  "The force of the 'Dark Side' eminates from 
  Computer Science/Eng.     |    the ominous DeathStar looming overhead." 
  berggren@eecs.cs.pdx.edu  |            - Down with AT&T! -