Neil Immerman
American theoretical computer scientist (b.1953)
≈ 2 min read
Names in other languages
- DeutschNeil Immerman
- DeutschNeil Immerman
- EnglishNeil Immerman
- EnglishNeil Immerman
- EnglishNeil Immerman
- EspañolNeil Immerman
- FrançaisNeil Immerman
- PolskiNeil Immerman
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
Neil Immerman (born 24 November 1953, Manhasset, New York) is an American theoretical computer scientist, a professor of computer science at the University of Massachusetts Amherst. He is one of the key developers of descriptive complexity, an approach he is currently applying to research in model checking, database theory, and computational complexity theory.
Professor Immerman is an editor of the SIAM Journal on Computing and of Logical Methods in Computer Science. He received B.S. and M.S. degrees from Yale University in 1974 and his Ph.D. from Cornell University in 1980 under the supervision of Juris Hartmanis, a Turing Award winner at Cornell. His book Descriptive Complexity appeared in 1999.
Immerman is the winner, jointly with Róbert Szelepcsényi, of the 1995 Gödel Prize in theoretical computer science for proof of what is known as the Immerman–Szelepcsényi theorem, the result that nondeterministic space complexity classes are closed under complementation. Immerman is an ACM Fellow and a Guggenheim Fellow.
External links
Immerman's home page at U. Mass. Amherst
Text derived from https://en.wikipedia.org/w/index.php?oldid=1334544364 under CC BY-SA 4.0; modifications have been made.
References
1 claim could not be tied to a specific sentence and is listed in the table below instead.