University of California - Berkeley & Carnegie Mellon University
It is shown how the operators in the “graph model” for calculus (which can function as a programming language for Recursive Function Theory) can be expanded to allow for “random combinators.” The result then is a semantics for a new language for random algorithms. The author wants to make a plea for finding applications.
This talk is part of the Computer Science Colloquium at the CUNY Graduate Center.
Dana Stewart Scott is the emeritus Hillman University Professor of Computer Science, Philosophy and Mathematical Logical at Carnegie Mellon University; he now lives in Berkeley California. His research career involves computer science, mathematics, and philosophy. His work on automata theory earned him the ACM Turing Award in 1976, while his collaborative work with Christopher Strachey in the 1970s laid the foundation of modern approaches to the semantics of programming languages. He has also made fundamental contributions in modal logic, topology, and category theory.