| dbo:abstract
|
- 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 patent programs have been rejected [and] indirect attempts to obtain patents and avoid the rejection ... have confused the issue further and should not be permitted." The case was argued on October 16, 1972, and was decided November 20, 1972. (en)
|
| dbo:wikiPageExternalLink
| |
| dbo:wikiPageID
| |
| dbo:wikiPageLength
|
- 9772 (xsd:nonNegativeInteger)
|
| dbo:wikiPageRevisionID
| |
| dbo:wikiPageWikiLink
| |
| dbp:arguedate
|
- 0001-10-16 (xsd:gMonthDay)
|
| dbp:argueyear
| |
| dbp:case
|
- Gottschalk v. Benson, (en)
|
| dbp:courtlistener
| |
| dbp:decidedate
|
- 0001-11-20 (xsd:gMonthDay)
|
| dbp:decideyear
| |
| dbp:findlaw
| |
| dbp:fullname
|
- Gottschalk, Acting Commissioner of Patents v. Benson, et al. (en)
|
| dbp:googlescholar
| |
| dbp:holding
|
- Respondents' method for converting numerical information from binary-coded decimal numbers into pure binary numbers, for use in programming conventional general-purpose digital computers is merely a series of mathematical calculations or mental steps and does not constitute a patentable "process" within the meaning of the Patent Act, 35 U.S.C. 100 . Pp. 64-73. (en)
|
| dbp:joinmajority
|
- Burger, Brennan, White, Marshall, Rehnquist (en)
|
| dbp:justia
| |
| dbp:lawsapplied
|
- ยง 101 of the Patent Act of 1952 (en)
|
| dbp:litigants
|
- Gottschalk v. Benson (en)
|
| dbp:loc
| |
| dbp:majority
| |
| dbp:notparticipating
|
- Stewart, Blackmun, and Powell (en)
|
| dbp:oyez
| |
| dbp:parallelcitations
| |
| dbp:prior
| |
| dbp:subsequent
|
- Diamond v. Diehr, Diamond v. Chakrabarty (en)
|
| dbp:uspage
| |
| dbp:usvol
| |
| dbp:wikiPageUsesTemplate
| |
| dcterms:subject
| |
| rdf:type
| |
| rdfs:comment
|
- 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 patent programs have been rejected [and] indirect attempts to obtain patents and avoid the rejection ... have confused the issue further and should not be permitted." The case was argued on October 16, 1972, and was decided November 20, 1972. (en)
|
| rdfs:label
|
- Gottschalk v. Benson (en)
|
| owl:sameAs
| |
| prov:wasDerivedFrom
| |
| foaf:isPrimaryTopicOf
| |
| foaf:name
|
- (en)
- Gottschalk, Acting Commissioner of Patents v. Benson, et al. (en)
|
| is dbo:wikiPageDisambiguates
of | |
| is dbo:wikiPageRedirects
of | |
| is dbo:wikiPageWikiLink
of | |
| is foaf:primaryTopic
of | |
