Dana Scott, born in 1932, is an American logician and computer scientist whose research established the mathematical foundations for programming languages. His work across formal semantics and automata theory transformed how machines interpret complex instructions, bridging the divide between abstract mathematical logic and the practical application of computer programming within the twentieth-century engineering landscape.
Early Research and Automata Theory
Scott began his academic path at the University of California, Berkeley, and Princeton University, where he earned a Doctor of Philosophy. During a 1957 internship at IBM, he collaborated with Michael O. Rabin. Their joint research introduced the concept of nondeterministic finite automata, a breakthrough in automata theory that earned them the 1976 Turing Award.
Twenty questions, eight minutes on the clock, and a percentile measured against everyone who has taken it. No sign-up.
Take the IQ test →Logic and Set Theory Contributions
During his tenure at the University of Chicago and later at Berkeley, Scott focused on mathematical logic and set theory. He proved the incompatibility of the axiom of constructibility with measurable cardinals. His 1967 publication regarding the independence of the continuum hypothesis utilized Boolean-valued models, research that resulted in the 1972 Leroy P. Steele Prize.
Denotational Semantics and Domain Theory
While serving as a professor at the University of Oxford from 1972 to 1981, Scott collaborated with Christopher Strachey to develop denotational semantics. He formulated domain theory to provide a mathematical foundation for recursive functions and control constructs. This work, which extended Tarskian semantic paradigms to programming languages, was further recognized through the 1997 Rolf Schock Prize.
Academic Appointments and Affiliations
Scott held teaching positions at numerous institutions, including Stanford University, the University of Amsterdam, Princeton University, and Johannes Kepler University Linz. He concluded his formal academic career at Carnegie Mellon University, where he served from 1981 until 2003. He maintains memberships in prestigious organizations such as the British Academy, the National Academy of Sciences, and the American Mathematical Society.
Fast facts
- Born: 1932, Berkeley
- Education: University of California, Berkeley; Princeton University
- Primary Field: Mathematical Logic and Computer Science
- Turing Award Recipient: 1976
- Notable Theory: Domain Theory
- Key Collaborator: Michael O. Rabin
- Notable Award: Rolf Schock Prize (1997)
- Academic Tenure: Carnegie Mellon University (1981-2003)
Questions readers ask
What is Dana Scott most known for?
He is best known for creating domain theory and establishing the mathematical foundations for the semantics of programming languages, often working in collaboration with Christopher Strachey.
For what research did Scott receive the Turing Award?
He received the 1976 Turing Award alongside Michael O. Rabin for their joint 1959 paper introducing the concept of nondeterministic finite automata.
Achievements
- Turing Award — 1976
- Affiliated with University of California, Berkeley, University of Chicago and Carnegie Mellon University
- Educated at Princeton University and University of California, Berkeley
- Worked as mathematician, computer scientist and engineer
.jpg)