Scott tells how he discovered nondeterministic automata with Michael Rabin in a classic paper.

Dana S. Scott, winner of the Association for Computing Machinery's A.M. Turing Award, discusses the work he did with Michael Rabin during an internship at IBM Research when they were both graduate students. Their summer project of 1957 led to a classic paper, in which the class of nondeterministic automata was defined for the first time. This clip is taken from an interview conducted by Gordon Plotkin for the ACM between November 12, 2020 and February 18, 2021. Video of the full interview is available as part of Scott’s ACM profile at amturing.acm.o...