A couple of months ago, I posted an accessible Numberphile episode on Zero-Knowledge Protocols with Avi Wigderson. This year he shares the Abel prize with László Lovász whose work on graph limits for large networks is rather worth looking at for those interested in computationally tractable approaches to complexity theory. Also, it is worth the listen for those interested in the rise of discrete mathematics in the age of computation.
https://www.youtube.com/watch?v=VAk0rtlKtMA&ab_channel=TheAbelPrize
.-- .- -. - / .- -.-. - .. --- -. ..--.. / -.-. --- -. .--- ..- --. .- - . FRIAM Applied Complexity Group listserv Zoom Fridays 9:30a-12p Mtn UTC-6 bit.ly/virtualfriam un/subscribe http://redfish.com/mailman/listinfo/friam_redfish.com FRIAM-COMIC http://friam-comic.blogspot.com/ archives: 5/2017 thru present https://redfish.com/pipermail/friam_redfish.com/ 1/2003 thru 6/2021 http://friam.383.s1.nabble.com/
