paj@uk.co.gec-mrc (Paul Johnson) (02/01/91)
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. Does anyone think that this might be possible? The possibility of producing such diagrams rests on Turing's work on his machines. He proved that any turing machine can be emulated by a universal turing machine. I assume the converse holds, so that any UTM program can be emulated by a specific non-UTM (anyone actually know?) The legal side might require some pushing, particularly when patent applications start being measured by the ton :-) Paul. Paul Johnson UUCP: <world>!mcvax!ukc!gec-mrc!paj --------------------------------!-------------------------|------------------- GEC-Marconi Research is not | Telex: 995016 GECRES G | Tel: +44 245 73331 responsible for my opinions. | Inet: paj@uk.co.gec-mrc | Fax: +44 245 75244
mitchell@MDI.COM (Bill Mitchell) (02/03/91)
In article <820@puck.mrcu> 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. > > [remaindier deleted] Some time ago I saw a copy of Dennis Richie's patent for the "set uid" bit. This sounds like a description of what I remember from that. -- mitchell@mdi.com (Bill Mitchell)
berggren@eecs.cs.pdx.edu (Eric Berggren) (03/01/91)
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! -