Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Carolyn Talcott

Software And Its Engineering

Carolyn Talcott is an American computer scientist born on June 14, 1941, in Caldwell, Idaho, known for her work in formal reasoning, especially as it relates to computers, cryptanalysis and systems biology. She earned her doctorate at Stanford University in 1985 with a dissertation supervised by the logician Solomon Feferman, titled The Essence of RUM: A Theory of the Intensional and Extensional Aspects of LISP-Type Computation, which places her early research in the theory of LISP-style programming languages. She later worked at SRI International, where she is program director of the Symbolic Systems Biology group, and she is co-editor-in-chief of the journal Higher-Order and Symbolic Computation. SRI named her an SRI Fellow in 2011, and she is a member of the Association for Computing Machinery and the Association for Symbolic Logic. She married John McCarthy, the computer scientist, and had a son.

Facts
Birth Year
1941 1
Birth Date
1941-06-14 1
Connections

In Field

Formal Methods, Fields
Source Carolyn Talcott (Wikipedia)
In the Other Atlases

Nationality

Also in Geography Atlas: the nationality of this subject.

Source Carolyn Talcott (Wikipedia)Lead sentence [nationality]
Quote, Lead sentence [nationality]
is an American computer scientist
Sources
1. Carolyn Talcott (Wikipedia)
  • Lead sentence
    Carolyn Talcott (born June 14, 1941) is an American computer scientist
  • Lead sentence [nationality]
    is an American computer scientist
  • In Group: Formal Methods and Verification, Lead sentence [in-group]
    known for work in formal reasoning, especially as it relates to computers, cryptanalysis and systems biology
  • In Field: Formal Methods, Lead sentence [in-group]
    known for work in formal reasoning, especially as it relates to computers, cryptanalysis and systems biology
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.