Neil Immerman

Neil Immerman
	Professor Neil Immerman is one of the key developers of an active research program called descriptive complexity, an approach he is currently applying to research in static analysis, database theory, and computational complexity theory. Professor Immerman is an editor 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. His book Descriptive Complexity appeared in 1999. Immerman is the winner, jointly with Róbert Szelepcsényi, of the 1995 Gödel Prize. Immerman is an ACM Fellow and a Guggenheim Fellow.

Professor Neil Immerman is one of the key developers of an active research program called descriptive complexity, an approach he is currently applying to research in static analysis, database theory, and computational complexity theory. Professor Immerman is an editor 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. His book Descriptive Complexity appeared in 1999. Immerman is the winner, jointly with Róbert Szelepcsényi, of the 1995 Gödel Prize. Immerman is an ACM Fellow and a Guggenheim Fellow.

Publications Recent Talks Professional Activities Teaching Awards CV Politics, etc. Contact Info.

Here is a diagram of the world of computability and complexity:

College of Information and Computer Sciences		Email: lastname at umass.edu
140 Governors Drive, Room 374		Fall, 2021: I am teaching Logic in Computer Science: COMPSCI 513 and 613.
University of Massachusetts Amherst		Please email me if you want to talk.
Amherst, MA 01003-9264		Here is a campus map