Episode 222: From Stepanov to Euler to Shawshank

In this episode, Conor and Ben chat with Tristan Brindle about graph algorithm resources, tropical semirings, Stepanov stories, FM2GP, EOP, and veer off into a chat about TV shows, movies and more!Link to Episode 222 on WebsiteDiscuss this episode, leave a comment, or ask a question (on GitHub)SocialsADSP: The Podcast: TwitterConor Hoekstra: Twitter | BlueSky | MastodonBen Deane: Twitter | BlueSkyAbout the GuestTristan Brindle a freelance programmer and trainer based in London, mostly focussing on C++. He is a member of the UK national body (BSI) and ISO WG21. Occasionally I can be found at C++ conferences. He is also a director of C++ London Uni, a not-for-profit organisation offering free beginner programming classes in London and online. He has a few fun projects on GitHub that you can find out about here.Show NotesDate Generated: 2025-02-17Date Released: 2025-02-21Mazes for Programmers by Jamis BuckMaze Demo from C++Now 2019: Ben Deane “Identifying Monoids: Exploiting Compositional Structure in Code”A Very General Method of Computing Shortest PathsFrom Mathematics to Generic ProgrammingSpoils of the EqyptiansAll A9 PlaylistsElements of ProgrammingFM2GP Programming Languages Virtual Meetup (Next One)A Tribute to Euler - William DunhamPerfect NumbersAmicable NumbersCountdown ClipJames Acaster ClipJames Acaster's Classic ScrapesChariots of FireBrief EncounterHouse's Stalker ClipCasablancaIntro Song InfoMiss You by Sarah Jansen https://soundcloud.com/sarahjansenmusicCreative Commons — Attribution 3.0 Unported — CC BY 3.0Free Download / Stream: http://bit.ly/l-miss-youMusic promoted by Audio Library https://youtu.be/iYYxnasvfx8

There are no comments yet.

Please log in to write the first comment.