| dbo:abstract
|
- Alan Belmont Cobham (4 November 1927 – 28 June 2011) was an American mathematician and computer scientist known for (with Jack Edmonds) inventing the notion of polynomial time and the complexity class P, for Cobham's thesis stating that the problems that have practically-usable computer solutions are characterized by having polynomial time, and for Cobham's theorem on the sets of numbers that can be recognized by finite automata. He also did foundational work on automatic sequences, invented priority queues and studied them from the point of view of queueing theory, and wrote a program for playing contract bridge that was at the time (in the mid-1980s) one of the best in the world. Cobham was a student at Oberlin College, the University of Chicago, the University of California, Berkeley, and the Massachusetts Institute of Technology, but did not complete a doctorate. He became an operations researcher for the United States Navy, a researcher for IBM Research at the Thomas J. Watson Research Center, and a professor and founding department chair of the computer science department at Wesleyan University. (en)
- Alan Belmont Cobham, né le 4 novembre 1927 à San Francisco en Californie, et mort le 28 juin 2011 à Middletown au Connecticut, est un mathématicien et informaticien théoricien américain. Il est connu pour ses travaux conduisant à la définition de la classe de complexité P, et la thèse de Cobham, et à la définition et l'étude de ce qui est appelé maintenant les suites automatiques, écrits qui ont eu un impact prolongé. (fr)
|
| dbo:birthDate
| |
| dbo:birthYear
| |
| dbo:deathDate
| |
| dbo:deathYear
| |
| dbo:knownFor
| |
| dbo:occupation
| |
| dbo:wikiPageID
| |
| dbo:wikiPageLength
|
- 5820 (xsd:nonNegativeInteger)
|
| dbo:wikiPageRevisionID
| |
| dbo:wikiPageWikiLink
| |
| dbp:birthDate
| |
| dbp:deathDate
| |
| dbp:knownFor
|
- Defining the class P, Cobham's thesis, Cobham's theorem, inventing priority queues, writing a program to play contract bridge (en)
|
| dbp:name
| |
| dbp:nationality
| |
| dbp:occupation
| |
| dbp:wikiPageUsesTemplate
| |
| dcterms:subject
| |
| rdf:type
| |
| rdfs:comment
|
- Alan Belmont Cobham, né le 4 novembre 1927 à San Francisco en Californie, et mort le 28 juin 2011 à Middletown au Connecticut, est un mathématicien et informaticien théoricien américain. Il est connu pour ses travaux conduisant à la définition de la classe de complexité P, et la thèse de Cobham, et à la définition et l'étude de ce qui est appelé maintenant les suites automatiques, écrits qui ont eu un impact prolongé. (fr)
- Alan Belmont Cobham (4 November 1927 – 28 June 2011) was an American mathematician and computer scientist known for (with Jack Edmonds) inventing the notion of polynomial time and the complexity class P, for Cobham's thesis stating that the problems that have practically-usable computer solutions are characterized by having polynomial time, and for Cobham's theorem on the sets of numbers that can be recognized by finite automata. He also did foundational work on automatic sequences, invented priority queues and studied them from the point of view of queueing theory, and wrote a program for playing contract bridge that was at the time (in the mid-1980s) one of the best in the world. (en)
|
| rdfs:label
|
- Alan Cobham (mathematician) (en)
- Alan Cobham (informaticien) (fr)
|
| owl:sameAs
| |
| prov:wasDerivedFrom
| |
| foaf:isPrimaryTopicOf
| |
| foaf:name
| |
| is dbo:wikiPageWikiLink
of | |
| is foaf:primaryTopic
of | |
