Who are you looking for?

Install Famoose

Keep Famoose on your home screen or desktop for easy access.

Open this site in Chrome or Edge and look for Install app in the browser menu or address bar. If no install option appears, you can bookmark Famoose instead.

Famoose.co
Appearance
Text size
Page width
Colour
Discover›Technology
Contents
Dana Scott
Computer scientist

Dana Scott

Famoose for

Foundations of automata theory and programming-language semantics.

Finite Automata and Their Decision Problem · Domain theory

Born
11 October 1932
Birthplace
Berkeley

More people

Ada LovelaceRecognising what a programmable machine could do beyond arithmetic.Alan TuringHelping break Enigma and laying foundations for computer science.Grace HopperHelping make computer programming readable in English-like language.

Dana Scott

American logician who shared the 1976 Turing Award with Michael Rabin.

Early life

Education

Studied at Berkeley and completed a Princeton doctorate with Alonzo Church in 1958.

Career

  1. 1957

    IBM internship

    Began collaborating with Michael Rabin.

  2. 1958–1960

    Chicago

    Taught after his doctorate.

  3. 1960–1963

    Berkeley

    Held a faculty appointment.

  4. 1976

    Turing Award

    Recognised for automata theory.

Contributions

Finite Automata and Their Decision Problem

Co-authored the paper introducing nondeterministic finite automata.

Domain theory

Developed mathematical foundations for programming-language meaning.

Beyond work

Life in Berkeley

After retiring from Carnegie Mellon, he and his wife Irene settled in Berkeley in 2005. Irene Schreier Scott was a pianist who also taught at Carnegie Mellon.

Sources & photo creditBiography and career ↗Biographical references ↗Life in Berkeley — biographical source ↗Simons Institute biography ↗

Original photograph. Cropped and displayed in monochrome.

Photo: Logos Semantikos. CC0 · Original image. Cropped and displayed in monochrome.