or galvanic current, without using any part of
the process or combination set forth in the
plaintiff’s specification. His invention may be
less complicated — less liable to get out of
order — less expensive in construction, and in
its operation. But yet if it is covered by this
patent the inventor could not use it, nor the
public have the benefit of it without the permis-
sion of this patentee” [1].
I do not propose to limit myself to the specific machinery, or parts of
machinery, described in the foregoing specifications and claims; the essence
of my invention being, the use of the motive power of the electric or galvanic
current, which I call electro-magnetism, however developed, for making or
printing intelligible characters, letters or signs, at any distances, being a
new application of that power of which I claim to be the first inventor or
discoverer.
ꢀ Figure 1. Samuel Morse patent claim – rejected by the U.S. Supreme Court
as overreaching.
DEMISE OF THE MATHEMATICAL ALGORITHM
The Supreme Court’s decision in Morse set the
tone for later decisions that held certain subject
matter — laws of nature, natural phenomena,
and abstract ideas — to be forbidden ground,
on which the patent system was not to tread.
Particularly noteworthy was the 1972 Supreme
Court decision in Gottschalk v. Benson [2]. In
that case one Bell Laboratories inventor, named
Benson, sought to patent a computer algorithm
for converting binary coded decimal numbers
(BCD) into binary numbers. Figure 2 shows a
representative Benson claim in which he recites
his basic conversion algorithm. The Supreme
Court struck down the patent. Following the
precedent in Morse, the Court ruled that Ben-
son’s algorithm was simply a mathematical for-
mula, and hence it was an inherently
nonpatentable abstract idea.
The 1972 Benson decision brought the advance-
ment of software patents to a grinding stop. It was
as if the tectonic plate on which software patent
law had been advancing suddenly collided with the
plate on which Morse’s patent had rested. In the
years after Benson, software programs were dis-
missed as being mere mathematical algorithms.
Relying on the Benson decision, the Patent Office
refused to grant software patents, and most appli-
cants either quit seeking them, or disguised them
as computer hardware patents.
and thus also arguably proper subject matter
for patent. Indeed, just one year after
Chakrabarty, the Supreme Court in Diamond v.
Diehr [4] ruled-without denigrating Benson-that
computer programs directed to performing
practical applications are proper subject matter
for patent. In that case, the computer program
performed a mathematical calculation to deter-
mine when to open the press in a precision rub-
ber molding process. One can distinguish the
Diehr decision from Benson. Whereas the patent
applicant in Benson had sought to appropriate
the abstract mathematical algorithm in its
entirety, the applicant in Diehr had simply
sought to appropriate an algorithm for operat-
ing a rubber mold press.
This distinction between Benson and Diehr was
not easy for the Patent Office to administer. The
decisions suggested that if a computer program
employed a mathematical algorithm-which
arguably many of them did-the patent examiner
had to struggle with whether the applicant’s
patent claim was, in effect, preempting the under-
lying abstract idea embodied in that algorithm [5].
Such esoteric analysis was fraught with difficulty.
Many examiners erred on the side of caution and
deemed all software inventions to be preempting
an abstract idea, leaving the patent applicant to
convince the courts otherwise.
Then in 1980, a tremor occurred along the fault
line, and the software patent plate broke free. Curi-
ously, at the epicenter was not a computer pro-
gram, but a tiny bioengineered microorganism.
Finally, in 1995, the Federal Circuit Court of
Appeals ruled in In re Alappat [6] that the former
preoccupation with the mathematical algorithm
was misplaced. Dismissing the mathematical algo-
rithm analysis as unhelpful, the Court outlined a
simpler plan. It looked to the basic patent statute,
which had been on the books since 1952 and is
LIFE WILL FIND A WAY
Scientists at General Electric had genetically
engineered a clever microorganism that had an
appetite for petroleum. That made the tiny
organism ideal for cleaning up oil spills in the
ocean. GE sought a patent, which the Patent
Office refused to grant. This microorganism was,
after all, a life form. Life was a natural phe-
nomenon, and the Patent Office simply refused
to acknowledge that it might constitute
patentable subject matter.
Remarkably, the Supreme Court saw things
differently. It ruled in Diamond v. Chakrabarty
[3] that, life form or not, Congress had intended
the patent laws to extend to “anything under the
sun that is made by man.” This genetically
altered microorganism did not exist in nature.
Hence GE’s patent claim, the Court reasoned,
“is not to a hitherto unknown natural phe-
nomenon, but to a non-naturally occurring man-
ufacture or composition of matter — a product
of human ingenuity.”
A data processing method for converting binary coded decimal number repre-
sentations into binary number representations comprising the steps of
(1) testing each binary digit position ‘1,’ beginning with the least significant
binary digit position, of the most significant decimal digit representation for a
binary ‘0’ or a binary ‘1’;
(2) if a binary ‘0’ is detected, repeating step (1) for the next least significant
binary digit position of said most significant decimal digit representation;
(3) if a binary ‘1’ is detected, adding a binary ‘1’ at the (i + 1)th and (i +
3)th least significant binary digit positions of the next lesser significant deci-
mal digit representation, and repeating step (1) for the next least significant
binary digit position of said most significant decimal digit representation;
(4) upon exhausting the binary digit positions of said most significant deci-
mal digit representation, repeating steps (1) through (3) for the next lesser
significant decimal digit representation as modified by the previous execution
of steps (1) through (3); and
(5) repeating steps (1) through (4) until the second least significant decimal
digit representation has been so processed.
After the Chakrabarty decision, it took little
time for many to recognize that computer soft-
ware was also a product of human ingenuity,
ꢀ Figure 2. Example: the Benson BCD to binary conversion claim — rejected
by the Supreme Court as unlawfully preempting a mathematical algorithm.
IEEE Communications Magazine • July 2000
99