Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Mathematician

Walter Savitch

Modern

Walter John Savitch (1943-2021) was a computer scientist and mathematician best known for defining the complexity class NL, nondeterministic logarithmic space, and for Savitch's theorem, which relates the NSPACE and DSPACE complexity classes by showing that nondeterminism costs at most a squaring of space. His work establishing complexity classes helped create the background against which non-deterministic and probabilistic reasoning can be performed. He also did extensive work on natural language processing and mathematical linguistics, and for over ten years studied computational complexity as it applies to genetics and biology. He wrote a number of textbooks for learning to program in C and C++, Java, Ada and Pascal. He received his PhD in mathematics from the University of California, Berkeley in 1969 under Stephen Cook and was afterwards a professor of computer science at the University of California, San Diego.

Facts
Biography
Gender
Male 1
Birth Year
1943 1
Connections

In Branch

Source Walter Savitch (Wikipedia)

Mentored By

Source Walter Savitch (Wikipedia)

Principal Result

Source Walter Savitch (Wikipedia)

Proofs Credited

Source Savitch's theorem, Wikipedia
In the Other Atlases

Same As

Also in Computing Atlas: the same subject.

Sources
1. Walter Savitch (Wikipedia)
  • Lead, birth date
    Walter John Savitch (February 21, 1943, February 1, 2021)
  • Lead, pronoun
    He also did extensive work in the field of natural language processing and mathematical linguistics
  • In Branch: Computational Complexity Theory, Lead, complexity class NL
    was best known for defining the complexity class NL
  • Mentored By: Stephen Cook, Lead, PhD
    under the supervision of Stephen Cook
  • Principal Result: Savitch's Theorem, Lead, Savitch's theorem
    and for Savitch's theorem, which defines a relationship between the NSPACE and DSPACE complexity classes
View the Source
Savitch's theorem, Wikipedia
Proofs Credited: Savitch's Theorem, Lead sentence
Quote, Proofs Credited: Savitch's Theorem, Lead sentence
In computational complexity theory, Savitch's theorem, proved by Walter Savitch in 1970, gives a relationship between deterministic and non-deterministic space complexity.
View the Source

Take a Related Quiz

Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.