description Neil Immerman Overview
Neil Immerman is a computer scientist at UMass Amherst known for his work in descriptive complexity theory, establishing connections between logic and computational complexity. He independently proved that NL equals co-NL, a result in complexity theory. Immerman has researched the relationship between computational complexity and logical definability, showing that complexity classes can be characterized by specific logics.
insights Ranking position
Neil Immerman ranks #119 of 185 in the Computer Scientist ranking, behind Andries van Dam, ahead of Scott Aaronson.
help Neil Immerman FAQ
What university is Neil Immerman affiliated with?
Neil Immerman is a computer scientist and professor at the University of Massachusetts Amherst (UMass Amherst). His research focuses heavily on database theory and formal verification.
What famous complexity theory result was proven by Neil Immerman?
He is famous for proving that the complexity classes NL (Nondeterministic Logarithmic space) and co-NL are equal. This important discovery is known as the Immerman–Szelepcsényi theorem.
What major award did Neil Immerman win?
He won the 1999 Gödel Prize in theoretical computer science for his work on the Immerman–Szelepcsényi theorem. He also later received the 2017 Alonzo Church Award for his foundational work in descriptive complexity.
What is descriptive complexity theory?
Descriptive complexity theory is a branch of computer science that Neil Immerman helped establish. It explores the direct connections between formal logic and computational complexity classes.
explore Explore More
Similar to Neil Immerman
See all arrow_forward
Reviews & Comments
Write a Review
Be the first to review
Share your thoughts with the community and help others make better decisions.
