Michael Rabin has died (en.wikipedia.org)

Article summary

Michael O. Rabin, a renowned computer scientist, has passed away at the age of 94. He made significant contributions to the field of computer science, including the development of nondeterministic finite automata and the Rabin-Karp string search algorithm. Rabin was also a pioneer in cryptography and was awarded the Turing Award in 1976 for his work on computational complexity. He held various academic positions throughout his career, including at Harvard University and the Hebrew University of Jerusalem.

Main themes

• Michael O. Rabin's contributions to computer science
• Cryptography and public-key cryptography
• Nondeterministic finite automata
• Rabin-Karp string search algorithm
• Turing Award and awards
• Academic career and legacy

What commenters say

• Michael O. Rabin's contributions to cryptography are more significant than those of the RSA team, despite the latter's greater commercial success.
• The RSA algorithm is not as important as it is often made out to be, and Rabin's work on public-key cryptography is more fundamental.
• Rabin's work on nondeterministic finite automata is more practical and significant than his work on cryptography.
• The importance of Rabin's contributions to computer science cannot be overstated, and his legacy will continue to inspire future generations of researchers.
• Anti-semitic vandalism on Wikipedia is a significant problem that needs to be addressed, and the article on Michael O. Rabin is a recent example of this issue.
• Wikipedia's lack of consistency across language editions can lead to politically motivated edits and a loss of credibility.
• Rabin's lectures and teaching style were highly engaging and memorable, and he was a master of explaining complex concepts in a clear and concise manner.
• The Rabin-Karp algorithm is a fun and clever solution to string searching, and implementing it can be a enjoyable and educational experience.