Michael Rabin Has Died

It has been reported that Michael Oser Rabin (September 1, 1931 – April 14, 2026), the Israeli mathematician and computer scientist, has died. He was co-recipient, with Dana Scott, of the 1976 ACM Turing Award for their foundational work on computational complexity. A giant in theory, his name appears in footnotes and textbooks the world over. Quiet, relentless influence — the kind that hums beneath modern computing.

Career and influence

Rabin helped shape how computer scientists think about what can be computed and how efficiently. His Turing Award recognized work that drove the early formalization of complexity theory — the scaffolding for everything from compilers to cryptography. Over decades his ideas echoed into automata theory, randomized algorithms and beyond; even when the jargon changed, the core questions he posed kept returning. Who hasn’t, in one way or another, stood on the shoulders of those questions?

Community reaction and legacy

It has been reported that tributes and condolences have appeared across academic and engineering communities online. The emotional moment here is simple but sharp: a member of the generation that turned computation into a formal science is gone. The Turing Award—the field’s “Nobel”—was only one marker. His real legacy is hands-on: concepts and proofs that quietly power research, industry, and education.

For a concise overview of his life and work, his public biography on Wikipedia collects dates, honors and selected publications. The field lost a foundational thinker today; his theorems and questions will stick around long after the headlines fade.

Sources: wikipedia.org, Hacker News