Computer science distinguished lecture

Su Mo Tu We Th Fr Sa
30 31 1 2 3 4 5
6 7 8 9 10 11 12
13 14 15 16 17 18 19
20 21 22 23 24 25 26
27 28 1 2 3 4 5
Date/Time:Thursday, 10 Feb 2011 at 3:40 pm
Location:Lee Liu Auditorium, Howe Hall
Cost:Free
Phone:515-294-6516
Channel:College of Liberal Arts and Sciences
Categories:Lectures
Actions:Download iCal/vCal | Email Reminder
"P versus NP: Approaches, Rebuttals, and Does It Matter?" Neil Immerman, University of Massachusetts, Amherst. Immerman is one of the key developers of an active research program called 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. 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. Immerman is an ACM Fellow and a Guggenheim Fellow.

Sponsors: Dept. of Computer Science, Dept. of Mathematics, Dept. of Statistics, and the F. Wendell Miller Lecture Fund.

This lecture was made possible in part by the generosity of F. Wendell Miller, who left his entire estate jointly to Iowa State University and the University of Iowa. Mr. Miller, who died in 1995 at age 97, was born in Altoona, Illinois, grew up in Rockwell City, graduated from Grinnell College and Harvard Law School and practiced law in Des Moines and Chicago before returning to Rockwell City to manage his family's farm holdings and to practice law. His will helped to establish the F. Wendell Miller Trust, the annual earnings on which, in part, helped to support this activity.