| 词条 | Walter Savitch |
| 释义 |
| name = Walter John Savitch | image = | birth_date = {{birth date |1943|02|21}} | death_date = | nationality = | fields = Computer science | workplaces = University of California, San Diego | alma_mater = University of California, Berkeley | thesis_title = Nondeterministic Tape Bounded Turing Machines[1] | thesis_year = 1969 | doctoral_advisor = Stephen Cook | doctoral_students = | known_for = Savitch's theorem, NL | awards = | website = {{URL|http://www-cse.ucsd.edu/users/savitch/}} }} Walter John Savitch (born February 21, 1943) is best known for defining the complexity class NL (nondeterministic logarithmic space), and for Savitch's theorem, which defines a relationship between the NSPACE and DSPACE complexity classes. His work in establishing complexity classes has helped to create the background against which non-deterministic and probabilistic reasoning can be performed. He has also done extensive work in the field of natural language processing and mathematical linguistics. He has been focused on computational complexity as it applies to genetics and biology for over 10 years. Aside from his work in theoretical computer science, Savitch has written a number of textbooks for learning to program in C/C++, Java, Ada, Pascal and others. Savitch received his PhD in mathematics from University of California, Berkeley in 1969 under the supervision of Stephen Cook. Since then he has been a professor at University of California, San Diego where he is currently a professor emeritus in the computer science department. References1. ^{{MathGenealogy|31590}} External links
5 : Living people|American computer scientists|University of California, Berkeley alumni|University of California, San Diego faculty|1943 births |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。