University of Cambridge > > Formalisation of mathematics with interactive theorem provers  > The leanest automata

The leanest automata

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Angeliki Koutsoukou-Argyraki.

Hybrid talk (please see abstract for link) Note: different room, MR20 this time

A presentation of my idiosyncratic journey to Lean, which includes: back-and-forths within modal logic and information distance measures; a paper that was formalized before it was published; financial math and an unexpected sponsor; and an effort to formalize automatic complexity, the number of states of a smallest finite automaton accepting only one particular word of a given length.

WATCH ONLINE HERE : Meeting ID: 379 992 884 209 Passcode: TYR8 Sh

This talk is part of the Formalisation of mathematics with interactive theorem provers series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity