Richard Edwin Stearns (1936 to 2026) was an American computer scientist who, with Juris Hartmanis, received the 1993 ACM Turing Award in recognition of the seminal paper that established the foundations of computational complexity theory. He earned a B.A. in mathematics from Carleton College in 1958 and a Ph.D. in mathematics from Princeton University in 1961, with a dissertation titled Three person cooperative games without side payments written under Harold W. Kuhn. He later became Distinguished Professor Emeritus of Computer Science at the University at Albany, part of the State University of New York, and was inducted as a Fellow of the Association for Computing Machinery in 1994. His 1965 paper with Hartmanis on the computational complexity of algorithms contains the time hierarchy theorem. His other notable work includes a 1963 study of operations that preserve regular languages, a 1967 regularity test for pushdown machines showing that it is decidable whether a deterministic pushdown automaton accepts a regular language, and a 1968 paper with P. M. Lewis II that introduced LL parsers, which matter in compiler design.
Facts
Connections
Conjectures Posed
Source Hartmanis-Stearns Conjecture (Wikipedia)
In Branch
Source Richard E. Stearns (Wikipedia)
Mentored By
Source Richard E. Stearns (Wikipedia)
Principal Result
Source Richard E. Stearns (Wikipedia)
In the Other Atlases
Same As
Also in Computing Atlas: the same subject.
Nationality
Also in Geography Atlas: the nationality of this subject.
Source Richard E. Stearns (Wikipedia)LeadQuote, Lead
was an American computer scientist
Sources
1. Richard E. Stearns (Wikipedia)
Lead, dates
Richard Edwin Stearns (July 5, 1936
Lead
was an American computer scientist
In Branch: Computational Complexity Theory, Lead, Turing Award citation
foundations for the field of computational complexity theory
Principal Result: Time Hierarchy Theorem, Bibliography, 1965 paper
Contains the time hierarchy theorem
Mentored By: Harold W. Kuhn, Life and career, Princeton Ph.D.
under the supervision of Harold W. Kuhn
View the SourceHartmanis-Stearns Conjecture (Wikipedia)
Conjectures Posed: Hartmanis-Stearns Conjecture, Lead sentenceQuote, Conjectures Posed: Hartmanis-Stearns Conjecture, Lead sentence
In theoretical computer science and mathematics, the Hartmanis-Stearns conjecture is an open problem named after Juris Hartmanis and Richard E.
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.