Michael Rabin Has Died

Michael Oser Rabin (Hebrew: מִיכָאÊל עוזר רַבִּין; September 1, 1931 – April 14, 2026) was an Israeli mathematician and computer scientist who was co-recipient, with Dana Scott, of the 1976 ACM Turing Award for their work on computational complexity.

Rabin was born in 1931 in Breslau, Lower Silesia, Prussia, Germany (today Wrocław, in Poland), the son of a rabbi. In 1935, he emigrated with his family to Mandatory Palestine. As a young boy, he was very interested in mathematics and his father sent him to the best high school in Haifa, where he studied under mathematician Elisha Netanyahu, who was then a high school teacher.[1]

He graduated from the Hebrew Reali School in Haifa in 1948, and was drafted into the army during the 1948 Arab–Israeli War. The mathematician Abraham Fraenkel, who was a professor of mathematics in Jerusalem, intervened with the army command, and Rabin was discharged to study at the university in 1949.[1] Afterwards, he received an M.Sc from Hebrew University of Jerusalem. He began graduate studies at the University of Pennsylvania before receiving a Ph.D. from Princeton University in 1956.[2]

Rabin became Associate Professor of Mathematics at the University of California, Berkeley (1961–62), and MIT (1962–63). Before moving to Harvard University as Gordon McKay Professor of Computer Science in 1981, he was a professor at the Hebrew University.[3]

In the late 1950s, Rabin was invited for a summer to do research for IBM at the Lamb Estate in Westchester County, New York, with other promising mathematicians and scientists. It was there that he and Dana Scott wrote the paper "Finite Automata and Their Decision Problems".[4] Soon, using nondeterministic automata, they were able to re-prove Kleene's result that finite state machines exactly accept regular languages.[1]

As to the origins of what was to become computational complexity theory, the next summer Rabin returned to the Lamb Estate. John McCarthy posed a puzzle to him about spies, guards, and passwords, which Rabin studied and soon after he wrote an article, "Degree of Difficulty of Computing a Function and Hierarchy of Recursive Sets".[1][5]

Nondeterministic machines have become a key concept in computational complexity theory, particularly with the description of the complexity classes P and NP.[ citation needed]

He then returned to Jerusalem, researching logic, and working on the foundations of what would later be known as computer science. He was an associate professor and the head of the Institute of Mathematics at the Hebrew University at 29 years old, and a full professor by 33. Rabin recalls, "There was absolutely no appreciation of the work on the issues of computing. Mathematicians did not recognize the emerging new field".[1]

In 1960, Rabin was invited by Edward F. Moore to work at Bell Labs, where Rabin introduced probabilistic automata that employ coin tosses to decide which state transitions to take. He showed examples of regular languages that required a very large number of states, but for which you get an exponential reduction of the number of states with probabilistic automata.[1]

In 1966 (published in conference proceedings in 1967),[6] Rabin introduced the notion of polynomial time (introduced independently and very shortly before by Cobham[7] and Edmonds[8]).

In 1969, Rabin introduced infinite-tree automata and proved that the monadic second-order theory of n successors (S2S when n = 2) is decidable.[9] A key component of the proof implicitly showed determinacy of parity games, which lie in the third level of the Borel hierarchy.[ citation needed]

In 1975, Rabin finished his tenure as Rector of the Hebrew University of Jerusalem and went to the Massachusetts Institute of Technology in the USA as a visiting professor. While there, Rabin invented the Miller–Rabin primality test, a randomized algorithm that can determine very quickly (but with a tiny probability of error) whether a number is prime.[10][11] Rabin's method was based on previous work of Gary Miller that solved the problem deterministically with the assumption that the generalized Riemann hypothesis is true, but Rabin's version of the test made no such assumption. Fast primality testing is key in the successful implementation of most public-key cryptography, and in 2003 Miller, Rabin, Robert M. Solovay, and Volker Strassen were given the Paris Kanellakis Award for their work on primality testing.[ citation needed]

In 1976 Rabin was invited by Joseph Traub to meet at Carnegie Mellon University and presented the primality test, which Traub called "revolutionary".[1]

In 1978, Rabin invented the Rabin signature algorithm, the first asymmetric cryptosystem whose security was proved equivalent to the intractability of integer factorization.[12][13]

In 1981, Rabin reinvented a weak variant of the technique of oblivious transfer invented by Wiesner under the name of multiplexing,[14] allowing a sender to transmit a message to a receiver where the receiver has some probability between 0 and 1 of learning the message, with the sender being unaware whether the receiver was able to do so.[ citation needed]

In 1987, Rabin, together with Richard Karp, created one of the most well-known efficient string search algorithms, the Rabin–Karp string search algorithm, known for its rolling hash.[15]

Rabin's subsequent research concentrated on computer security. During the spring semester of 2007, he was a visiting professor at Columbia University teaching Introduction to Cryptography. He retired from full-time academic life as the Thomas J. Watson Sr. Professor of Computer Science, Emeritus at Harvard University and Professor of Computer Science (Emeritus) at Hebrew University.[ citation needed]

Rabin died on April 14, 2026, at the age of 94.[16]

His daughter, Tal Rabin, is also a distinguished computer scientist.[17]

Rabin was a foreign member of the United States National Academy of Sciences,[18] a member of the American Philosophical Society,[19] a member of the American Academy of Arts and Sciences,[20] a member of the French Academy of Sciences,[21] and a foreign member of the Royal Society.[22]

In 1976, the Turing Award was awarded jointly to Rabin and Dana Scott for a paper written in 1959, the citation for which states that the award was granted:

For their joint paper "Finite Automata and Their Decision Problems," which introduced the idea of nondeterministic machines, which has proved to be an enormously valuable concept. Their (Scott & Rabin) [sic] classic paper has been a continuous source of inspiration for subsequent work in this field.[23]

In 1995, Rabin was awarded the Israel Prize, in computer sciences.[24] In 2010, Rabin was awarded the Tel Aviv University Dan David Prize ("Future" category), jointly with Leonard Kleinrock and Gordon E. Moore, for Computers and Telecommunications.[25] Rabin was awarded an Honorary Doctor of Science from Harvard University in 2017.[26]