Brief Fact Summary. Gottschalk (Defendant), the Acting Commissioner of Patents, appealed the reversal of his rejection of patent claims relating to the programmed conversion of numerical information.
Synopsis of Rule of Law. A mathematical formula with no substantial practical application exception in connection with a digital computer cannot be patented.
Issue. Can a mathematical formula without a substantial practical application exception in connection with a digital computer be patented?
Held. (Douglas, J.)Â No.Â A mathematical formula with no substantial practical application exception in connection with a digital computer cannot be patented.Â One may not patent an idea, which would be the result if the formula for converting binary code into pure binary were patented in this case.Â A procedure for solving a given type of mathematical problem is known as an “algorithm.”Â The procedures presented in the present claims are generalized formulations for programs to solve mathematical problems of converting one form of numbers to another.Â A patent on the formula would result in a patent on the algorithm itself.Â This would raise considerable problems that only committees of Congress can manage.Â Reversed.
Discussion. The Benson decision is the leading one on the question of whether or not computer programs can be patented.Â The history of the case reveals the typical positions which have been taken by the Defendant and the Court of Customs and Patent Appeals.Â Defendant rejected the patent claims in its usual opposition to patenting computer programs.Â The Court of Customs and Patent Appeals, typically defiant of the Patent Office, reversed.Â They even seemed to defy the Supreme Court in later decisions that attempted to gain patents for computer programs.