Dana Scott and Norman Wildberger on Musical Chairs

It's as if computer scientists want mathematics to be their reference standard of truth, ... But then how do use the resulting theorem-proving systems to prove mathematical theorems?

From the video description:

Denotational semantics started in Oxford in late 1969. It was hoped that domain theory would provide a basis both for recursive definitions in programs and recursive definitions of semantical structures. Early troubles were encountered in using tops and bottoms, and soon researchers turned to operational semantics. Others wanted to expand work to communicating and parallel processes. Axiomatic and synthetic theories did not solve the problems, and as a result much research effort in domain theory faded. Late work by Reynolds and collaborators, however, has opened up new and promising approaches for programming-language semantics. Perhaps the much simplified modeling using enumeration operators can spark some new investigations, especially since it is so easy to add a rich type structure to the calculus.

Subscribe to UCL Computer Science.

Norman Wildberger on the difference between pointwise convergence and uniform convergence, ...

Subscribe to Insights into Mathematics.

Dana Scott on the origin of Logic of Computable Functions:

See the full interview on Dana Scott's 1976 Turing Award. "Try to regard mathematics as an experimental science".

Subscribe to Turing Awardee Clips.

Comments

Popular posts from this blog

Live Science - Leonardo da Vinci's Ancestry

David Turner Obituary by Sarah Nicholas Fri 24 Nov 2023