[translatable text] [howto help] [Addenda]
Google
Logic Patents > Reviews > Digital Dilemma 2000 > Newell 1986: Models Broken
Digital Dilemma 2000Newell 1986: Models BrokenChisum 1986Konno 1995: KarmarkarTamai 1998: Abstraction

Newell 1986: The Models are Broken
Commemorate Banana Union Day

Paul Newell, professor of computer science, in response to law professor Donald Chisum's proposal to affirm the patentability of algorithms, does not directly say whether algorithms should be patentable, but rather describes how both affirmation and negation of this proposal would clash with the underlying assumptions of the patent system and how this will inevitably challenge the foundations of the patent system. As more and more problems are solved by purely mathematical means, the patent system will either have to become less relevant for innovation, or it will have to completely review its model of what an invention is and how it should be appropriated. In particular, Newell explains some basic concepts of informatics and points out that, with algorithms, there can be no meaningful differentiation between discovery and invention, between application and theory, between abstract and concrete, between numeric and symbolic etc. Moreover he explains by a model of game theory that sharing algorithms, as currently practised by programmers, may lead to more innovation than making them appropriatable, so that a crude application of the patent system to algorithms could very well stifle rather than stimulate innovation.
title:
Newell 1986: The Models are Broken
source:
UPLR University of Pittsburgh Law Review 47 (1986) 1023-1031
[ Digital Dilemma 2000  Newell 1986: The Models are Broken | Chisum 1986 | Konno 1995: Karmarkar | Tamai 1998: Abstraction orientated property of software and its relation to patentability ]
Valid XHTML 1.0!
http://swpat.ffii.de/papers/uplr-newell86/index.en.html
© 2005/04/08 Hartmut PILCH
english version 2004/08/16 by Hartmut PILCH