Gottschalk v. Benson
id:
gottschalk-v-benson-320-15970388
title:
Gottschalk v. Benson
text:
Gottschalk v. Benson, 409 U.S. 63 (1972), was a United States Supreme Court case in which the Court ruled that a process claim directed to a numerical algorithm, as such, was not patentable because "the patent would wholly pre-empt the mathematical formula and in practical effect would be a patent on the algorithm itself." That would be tantamount to allowing a patent on an abstract idea, contrary to precedent dating back to the middle of the 19th century. The ruling stated "Direct attempts to p
brand slug:
wiki
category slug:
encyclopedia
description:
1972 United States Supreme Court case
original url:
https://en.wikipedia.org/wiki/Gottschalk_v._Benson
date created:
date modified:
2023-12-13T05:38:38Z
main entity:
{"identifier":"Q5588088","url":"https://www.wikidata.org/entity/Q5588088"}
image:
fields total:
13
integrity:
14