Skip to content
PodSubs
ShowsPeopleGuestsJobsNewsEvents
More
BlogPodCred
Menu
ShowsPeopleGuestsJobsNewsEventsBlogPodCredNetworksSign in
Join nowSign in
  • Shows
  • People
  • Jobs
  • News
  • More
    • Guests
    • Events
    • Blog
    • PodCred
    • Networks
    Join nowSign in

ADSP: Algorithms + Data Structures = Programs

ADSP: Algorithms + Data Structures = Programs artwork

Episode 222: From Stepanov to Euler to Shawshank

Feb 21, 202537 minAudio
ShareXLinkedInFacebookWhatsAppEmail

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 Website Discuss this episode, leave a comment, or ask a question (on GitHub) Socials ADSP: The Podcast: Twitter Conor Hoekstra: Twitter | BlueSky | Mastodon Ben Deane: Twitter | BlueSky About the Guest Tristan 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 Notes Date Generated: 2025-02-17 Date Released: 2025-02-21 Mazes for Programmers by Jamis Buck Maze Demo from C++Now 2019: Ben Deane “Identifying Monoids: Exploiting Compositional Structure in Code” A Very General Method of Computing Shortest Paths From Mathematics to Generic Programming Spoils of the Eqyptians All A9 Playlists Elements of Programming FM2GP Programming Languages Virtual Meetup (Next One) A Tribute to Euler - William Dunham Perfect Numbers Amicable Numbers Countdown Clip James Acaster Clip James Acaster's Classic Scrapes Chariots of Fire Brief Encounter House's Stalker Clip Casablanca Intro Song Info Miss You by Sarah Jansen https://soundcloud.com/sarahjansenmusic Creative Commons - Attribution 3.0 Unported - CC BY 3.0 Free Download / Stream: http://bit.ly/l-miss-you Music promoted by Audio Library https://youtu.be/iYYxnasvfx8

Audio and video play straight from the show's own hosting. PodSubs stores and serves no media.

Transcript

From the show. Tap a time to play from there.

Alexander Stepanov (Clip)We want to learn to compute the shortest path. And again, it could be done using matrix multiplication over a tropical semi-ring. This is something you could use on a date.

Countdown (Clip)And you are the weakest link. Goodbye.

James Acaster (Clip)Right, let's start with the headlines. I swear now.

Dr. House (Clip)If you're not with someone your age, you'll regret it. Maybe not today, maybe not tomorrow, but soon. And for the rest of your life.

BenI had a couple of thoughts on your graph algorithms discussion with Bryce. What is what is that?

ConorThis forgrammers.

BenIs a book that if you like graph algorithms, you should read. Yeah, this is Mazes for Programmers by Giamis Book. That does sound pretty cool. It covers all the because because you know, constructing minimum spanning trees is the same problem as making mazes. If you think about a like a grid of cells, you want to construct a minimum spanning tree across those cells, that is a maze. And there are various ways to do that. There are like, I don't know, 20 different algorithms in here.

BenCrimson Kruskals, just uh what they say? Prims and cruscals uh just scratch the surface. Um there's all kinds of interesting algorithms. One of the interesting ones is called Ellers, and Ellers algorithm is interesting because each successive row of the maze is constructed from the previous row only.

ConorUm which means that This is the one you showed in a C now talk, yeah?

BenYeah, which means that it's an iterative process. Um you can iterate until you've had enough constructing each next row from the previous one. For for a given width of maze, obviously. But that's a really good book. And um the other thing I wanted to draw your attention to for your consideration is this blog post from a while ago. It's called A Very General Method of Computing Shortest Paths. And it covers uh it covers a an algorithm, the Gauss-Jordan, Floyd, Warsaw, Clainey algorithm.

ConorWell, that's four hyphens for those of you that didn't pick up. I did complain about the hyphenation of these uh you know specific algorithms. That's four hyphens, five names in this algorithm.

BenWell, because I mean that algorithm is uh it's an amalgamation of other algorithms, right? But it it's a it's a method of computing transitive closures with using a mathematical structure called the Tropical Star Semiring, which you may have heard of.

ConorSo this is crazy. We we gotta pause here for a second. So I'm not exactly sure where I start the edit of part one of this probably three-part uh you know end-part conversation, but we we do have a guest with us, Tristan, uh, who I think is our second uh most frequent guest behind Sean Parent. And I think Ben, I don't know how we count you anymore because you've been upgraded.

Trinstan BrindleYeah, so if if Ben's now like an official co-host, does that mean I move up in the middle of the year?

ConorYeah, I think uh after this, you might already be in second because all of his co-host episodes don't count towards his guest count. So I think you might be, we'll just call you the second most frequent. And uh we're gonna be talking about a bunch of stuff over the next uh couple slices of this conversation. But so we're gonna start off, I guess, on follow-ups to the graph algorithms conversation. It is crazy. Like the uh what do you call it? Like the conflagration. Is that the correct word when you've got like ideas that pop up?

BenConflagration is a big fire, if that's what you meant. Okay.

ConorIt's definitely not conflagration. It might be conflation, but I I'm pretty sure that's that's when you confuse things or put them in the same idea. But uh, you just said tropical semiring, and I literally yesterday was working through uh one of the exercises from the spoils of Egyptians journey one from Stepanov's uh lecture series that corresponds to FM uh to GP from mathematics to generic programming. And at one point he um assigns the exercise of uh determining shortest path using a tropical semi-ring with matrix exponentiation.

ConorAnd then he I have I can't I have to implore the listener. If you have not listened to this lecture series, it is like 50% C and math and proofs. The other 50% is just listening to one of the world's most passionate people talk about history and mathematics and like stories of Pythagoras and Tales of Miletus, and it is just like half of these lectures you can literally watch as like a form of entertainment. And he and when he mentions the tropical semiring, he says, and of course, this is obviously amazing date material, something you have to bring up on your next date, and you say, Oh, I'm implementing shortest path with the tropical semi-ring and uh matrix multiplication.

Alexander Stepanov (Clip)Mathematicians sometimes love to introduce really hot concepts. So recently they introduced the notion of a tropical semi-ring. It comes from Brazil. Um indeed, I mean it was sort of it existed in computer science, by the way, for decades. And they paid no attention. And then a Brazilian mathematician uh started using this thing for algebraic geometry.

Alexander Stepanov (Clip)And obviously, you know, computer science application is just nobody cares. The moment they start applying it to algebraic geometry, it became very cool. And they named, since he was from Brazil, they uh invented this concept of a tropical semi-rig. So you should feel really some bow, whatever they do there. We want to learn to compute shortest path. And again, it could be done using matrix multiplication over a tropical semi-rig.

Alexander Stepanov (Clip)This is something you could use on a date.

ConorAnd then uh, you know, I end up doing this in APL, which is like it has an inner product primitive, which you can just replace each binary operation and it works on matrixes, and it's like a one-liner. Anyways, back to you. Sorry, is this the A9 lecture series? Yes, yes, on YouTube. Have you seen them, Tristan? I know you know of them.

Trinstan BrindleI have I uh no. Uh it's the short, the short version. I've watched bits uh here and there, but no, I have not sat down and watched the whole thing. But I always feel like I should. So um I mean it's it's a hundred hours of material easily.

BenBecause between there's one, there's this there's uh efficient programming with components is one of the series. Um the one Connor's talking about is the uh spoils of the Egyptians, it's the algorithmic journeys, right? Algorithmic journeys.

ConorYeah, four algorithmic journeys, and it's three journeys. The first one is the spoils of Egyptians, and we haven't gotten to number two and number three. Um, like one of them is the successors of piano. It's I don't think that one is only a portion of the like the ones you're mentioning are other series, but I think this one grand total is probably gonna be less than 30 or 40 hours. So it's I mean that sounds like a lot, but at if you're putting them on at two-point time speed, because a lot of them is just like story time with Stepanov. Like it's just it's just like you'll be I have to now tell you the story of Galois, you know, the most romantic of the mathematicians, and then he's always commenting, this mathematician had a sword, this mathematician didn't have a sword, and it's uh he is it is and he does it all off the cuff.

ConorLike this guy's capacity for memorizing like the history of stuff, it's unbelievable. Back to you though. Galois died in the jewel, though, right?

BenThat's right.

Trinstan BrindleHe uh famously like 21 years old, and he like wrote down the entirety of group theory like the night before because he thought he was gonna die in the duel, which he did.

BenThat is the story, yes. That's apparently story. But uh um Stepanov does the same thing with with programming languages as well. Um not only is he a great mathematical historian, he's also a historian of our field, of the field of programming. So he talks about in in some of the other lecture series, he talks about the history of Fortran and Lisp and and and you know languages from the 60s, I guess we would say. Which I think more people should be aware of, you know, we because we we think that lots of things lots of things do get discovered in computer science still, but but a a lot, a lot of what we use day-to-day in computer science was was already known by sort of 1975.

BenUm and our field is young enough that people can easily study the history. And it it really helps to put things in context, I find.

ConorYeah, he his anecdotes, and yeah, I just can't even like I feel like there someone should go and like edit out the math and C stuff and just stitch together the history parts as as just like a podcast, because it is his anecdotes are and he's he's like ha he's almost like part comedian. Um, because like I find myself laughing when he's like, you know, the three rules of namings, and of course, you know, I made the mistake myself and it is tragedy because uh, you know, Vector, I I violated rule number three, and you know, sometimes mistakes they last a long time.

ConorAnd of course, like all of us used to Vector today, and uh yeah, he is he is one of the best storytellers, if not the best storyteller, in terms of like his know his knowledge that he's reaching from, his own kind of comedic, but like edutainment, like doesn't do it service. It is it it is so good. Yeah, even even the proof stuff. If you're not there for C or for the math stuff, uh it's worth just like going through that for like the stories that he tells. And he's like, oh, now I've I've I promised you a story about Euler, and now I will finally uh tell it.

ConorAnd then like 30 minutes later, it's like, alright, it's the end of the lecture, uh, we'll get back to C in the next one. Um yeah, it's it's fantastic. Anyways, I've totally derailed Ben's um talking about what is it, the four years.

BenWe should say um that lecture series uh four algorithmic journeys is the lecture series of really of the book from mathematics to generic programming. So that book some people view as a sort of sequel to Elements of Programming. Um I don't know, it's not really a sequel, but it is another book by Stepanov after Elements of Programming.

ConorSo yeah, I I haven't actually mentioned, I think I did mention at one point uh in our conversation a while ago, Ben, that I was going to be starting uh a meetup working through this book. Uh but it's been like a month since we actually started it. So, I mean, tonight, which will be in the past when this comes out, is meeting number three. But at the beginning of the meetup, uh in watching the lecture, Stepanov says that uh there's kind of a corresponding text, but not really, and that's EOP. But EOP was published before the Four Algorithmic Journeys was recorded, and from Mathematics to Generic Programming was published afterwards.

ConorSo at the time he was recording it, he didn't mention from Mathematics to Generic Programming, but it is completely clear after having like looked at both sources that they like one-to-one, not in the same order, but they one-to-one map to each other. Like the diagrams in his slides are like copy and pasted to the textbook. So yeah, it's I think it's a great idea to work through both together. And if you're listening to this, feel free, whatever, I'll leave a link in the show notes. Although we're already partially way through the book. But yeah, it is I feel bad leaving it and not having gotten to it for so long because it's been on my list of things to do since like 2018 or 19 or something.

ConorAnd um, just for like not even the education educational value, just for the entertainment value, it is worth like going to and uh and watching. Yeah, uh I plan on going through everything now that I can find. Um it's it's probably the same thing. Like, I feel very sad that Ken Iverson like passed away before the age of online YouTube videos and stuff, because I feel like he would have probably been the same kind of character in terms of his passion for his topic. Um yeah. Right. Anyways. Links in the show notes for everything we just mentioned.

ConorBack to uh what we were talking about before.

Trinstan BrindleI still don't know what a tropical subring is, though.

ConorOh, so alright, Ben, you want to describe it or should I describe it?

BenLet's see. It's so it's a ring or semi-ring, right? So semiring is uh another one of these mathematical structures, like a group, except it's it's adding on more stuff. So are you familiar with a ring? So maybe for the listeners, if you're not.

Trinstan BrindleUm It's uh I I do I I I did study this stuff, but uh quite a long time ago.

BenThink of multiply and plus, right? That's the canonical example. So you've got two operations.

Trinstan BrindleIt's like a it's like a group with two operations, right? And you've got uh like an additive identity, multiplicative identity, yeah.

BenYeah.

Trinstan BrindleSo I don't know the semi-bits.

BenUh I forget what makes a semi-ring versus a full ring. But it's similar to what makes a semi-group versus a group, I expect. Yeah. A tropical semi-ring, I think is a ring that uses uh plus and min, is it, as as the operations?

ConorYeah.

BenUm it's called tropical, I think, because the mathematician who introduced it was Brazilian or working in Brazil, and mathematicians who just have the sense of humor where they say, oh, let's call it tropical. Something something of that nature. Um so you can plus and min. So if you think of min and plus and you think of their application to a graph, maybe you can sort of intuit that you know plus is adding up the weights between nodes, and min is finding the minimum path length. And so this ring structure, uh, when applied to uh graphs, weighted graphs or otherwise, um, allows you to compute shortest paths among among other things.

BenTransitive closures also come into it.

Trinstan BrindleI will I will have to take your word for that. It's not uh not I can't intuit that.

ConorIt it's it sounds like overwhelmingly complicated, especially given the fact that it's a tropical semi-ring with matrix multiplication. But and I was like, uh, I put it off for like a few days for the homework that uh I was doing. But then when I went to do it, literally in APL, an inner product is spelled plus dot for the inner product, and then times. So your first operation is the multiplication and then plus is the second one. Literally for doing uh shortest path with a quote unquote tropical semi-ring, I don't know why it's in quote unquote.

ConorIt just sounds very fancy. You replace the plus with a minimum glyph, and you replace the times with a plus glyph, and then that's it. And so you put a matrix, you put the same matrix on either side of that, and then that's a single step of the calculation of shortest path. And then if you do that for any equal to the number of steps that you need to get uh from you know your starting point to your end point, in the matrix that is a representation of your graph, is the shortest path from that point to that point. Like it's incredibly simple in a language where you have an inner a uh generic inner product where you can pass any two custom binary operations in.

ConorUm but yeah, it does sound rather fancy uh when he's explaining it. Um and then in the lectures he doesn't actually give an example or anything, he just explains it in the abstract and is like, oh, and go do it for homework.

Trinstan BrindleYeah, it sounds like I've got some homework to do.

BenYeah, so you can do things like um, you know, if you have an adjacency matrix, uh so I've I've done a few of these things um to to try them out. If you have an adjacency, just the just an unweighted graph, you have an adjacency matrix, that is basically a square, you can represent as a square matrix of bits, right? Which you can represent as just an integral type if if you have if your if your graph is small enough, um or or like you know, uh n integral types, right?

BenBecause it's bits. Um you can compute if you take that as a matrix and you raise it to the nth power, basically it it computes the transitive closure where where n is enough, basically until you stop, until it stops changing, kind of right because at that point you've computed the transitive closure of the graph. You can then there are various things you can do. I think you can use that to extract a topological sort of the nodes, among other things.

BenUm and you know, when we say a graph, also it this this link I put in the chat, you know, a graph is very general. A graph, for example, this this can be applied to regular expressions. Right? The the Klainy star in the regular expression is the same thing as transitive closure. The idea of transitive closure.

ConorBen's just, you know, he operates in the clouds when us mere mortals operate down on Earth. I I will say as well, like one of the exercises in FM to GP is you know working up to calculating Fibonacci numbers in log n time using also matrix multiplication or exponentiation. And you know, I follow the lectures, it makes sense. I nod my head along, and then once again I go to APL, which has the matrix multiplication primitive. And so it's super straightforward. You build up this two by two matrix, put it to the nth power, and there's a you know, kind of uh log n calculation where if it's even, you know, you you divide by two, if it's odd, you minus one.

ConorAnd I I implemented it. Do I fully understand, like at an intuitive level, how you get, you know, log n, like I I get it. We're splitting, dividing, and conquer. I see it, but the math behind it, you know, I can say now that I can, you know, once again, uh if I'm ever ever on a date with my fiance, I'll say, ah, I can do uh Fibonacci calculations in log n time is pretty impressive. Um but you know, if if you actually ask me to explain the mathematics behind it um or the intuition behind it, I think it's very non-intuitive. I mean Stepanov said himself, he was like, he didn't believe it when uh he came across, you know, this statement said, Oh, you can do it in log n 10.

ConorHe's like, of course you can't, you know, it's uh it's dependent on the previous two things. Like, how could you possibly do that in log n time? Um I'm not sure if you have an intuitive explanation, Ben uh No, I don't think I do for that one.

BenBut but yes, if you just play with like you say, if you play with the matrices, you sort of get the get the hang of it, get the idea of it. And so, you know, like you said, it's fairly easy to understand how raising a matrix to the nth power can be done in log n steps rather than n. Right? Because when you're raising to the power, if the power is even, you can you can halve it and do that multiplication after the divine and conquer. I just dropped in the chat talking of um enjoying history of mathematics, I dropped a link into a YouTube video in the chat which is about um about Leonard Euler.

BenIt's called A Tribute to Euler by by William Dunham. This is also, I think, a book, I think he's written a book on Euler, but Euler is Euler was amazing. You know, it it may or may not surprise you to learn that all of Euler's work has not yet been published. Um wow. There are there are there are folks still going through his papers and publishing them, and it's going to be a while before they all get published. He he has I'm not sure if it's if he's second to Gauss, because but uh he might be first in a number of things that are named after him in mathematics.

ConorHow does how does Euler rank uh compared to von Neumann in terms of his uh I don't know what you call that, like polymath status or uh uh poly well, I couldn't say.

BenBut it's certainly true that Euler just blew the lid off multiple fields of mathematics. Um, you know. For example, uh perfect numbers and amicable numbers. Right? So if you amicable numbers so a perfect number is a number where the the the proper divisors sum to the number, right? Like six, twenty-eight, four ninety-six, I think. You know, so we know up until Euler we had known a few of those were known to the ancients, right? And amicable numbers are numbers where uh it's a pair of numbers where each number's divisors sum to the other number.

ConorWait, say that again? Amicable is when a pair of numbers oh sum to each other. So, you know, the sum of the A's divisors.

BenThe divisors of A sum to B, and the divisors of B sum to A. Okay. The proper divisors. So 220 and 284 is the uh is the canonical example of a pair of amicable numbers. Euler, you know, so so basically there were a handful of these perfect numbers and amicable numbers known since antiquity. And I mean like two or three in the case of amicable numbers. I forget the exact Euler comes along, does a bit of work in this area, and he's like, oh here I've generated another two dozen.

BenYou know, the kind of impact he had on multiple areas of mathematics.

ConorAnyway, we need some Apple TV or Netflix shows on you know the greats. There's a TV show that just came out on uh is it Apple? I don't know. Called uh Prime Target. And it's uh it's based in Cambridge partly. Yeah, so I'm not it might it may or may not be of interest to you. Uh did uh you do uh where did you go to school, Tristan? I think I should know this, but is it uh Cambridge as well? Gasworks Polly.

Trinstan BrindleNo, no, no. I uh an ordinary university for me. I was uh I was uh an undergraduate of Southampton in the UK and I did a postgrad at Bath.

BenOh Bath is a nice university. Bath is nice.

Trinstan BrindleYeah, yeah, it's uh it's a good place. Yeah. And uh the city itself is is amazing. Um the university is kind of uh a 1960s modern thing at the top of the hill outside the uh outside the city itself. But yeah, Bath is uh Bath is a fantastic place. You were gonna say something, Connor?

ConorOh no, I was I was gonna say I thought I got recommendations from from both of you of where to go uh when I was there. So maybe that's maybe I'm just misremembering Cambridge. Um spent spent time in Cambridge because anyways, it's it's this uh TV show that it's about this you know genius math guy that is trying to find a prime finder and everybody's worried that you know supposedly all the NSA and all these organizations are killing off math people because uh I think I've seen a trailer for that.

Trinstan BrindleIt's on like Apple TV.

ConorYeah, yeah. Anyways, we need more shows like that with less killing and more just like the the true story of uh, you know, because you know you could probably uh I don't know, in this day and age, there's a lot of tech people that I'm sure would be interested, and math people that would be interested. Who knows though? Not everybody's favorite show when they were a kid was numbers like me.

Trinstan BrindleTalking of TV shows, I don't know, maybe this isn't for uh this won't be so interesting for the for the listeners, maybe. But uh I had um before Christmas I was I was thinking um we you you should do a Christmas special of this uh of this podcast. Right. So we're we're now gonna have to wait until December again. But uh um Connor, have you ever heard of a a TV show called Countdown? British TV show.

ConorCountdown. Uh I don't think so, although I I have watched a bunch of I know Ben, you've recommended me some quiz shows. Uh I'm not sure it's the big quiz of the year. There's and there's other ones that are like what some of them are funny, and some of them are actually like mathly Olympiad. Countdown does not ring a bell though.

Trinstan BrindleUm so Countdown's like uh it's it's been on TV since I think 1980 or something. It's a very long time.

BenWasn't it the first show on telephone? I think it was the first show on Channel 4.

Trinstan BrindleAnd um like it's deliberately very like they haven't moved with the times at all. Like it's deliberately really old-fashioned, and it's kind of like an institution on British TV. But anyway, um the goal of of Countdown, they have two, they have letters rounds and numbers rounds, and letters rounds you have um uh nine letters. Oh uh you select nine letters, vowels and consonants, and you have to make the longest word you can. So two contestants, each one tries to get the the uh the longest word. Um and numbers rounds, you pick uh six numbers, and uh you're given a three-digit target, and you have to use um the usual four hour paradigm operations uh yeah, uh to reach that target.

Trinstan BrindleUm so I thought this would be right up your street, uh, and I thought it would actually make quite good, you know, I suppose quite a fun thing to do on the on the podcast, but um but you know, uh December's a busy target.

ConorThis sounds amazing, and I just finished cutting in the inception, uh the audio from the inception movie uh when they were dream building, which people may or may not have gotten the reference. I am definitely going to find the clip. I don't think it's countdown, because this was like a comedy show, uh, and I'm not gonna remember the comedian's name. Uh his name's I think Richard Richard Iowani.

BenYeah, yeah I think is it from the IT crowd where he's on countdown?

ConorUh I'm not sure, but it's it's this uh old uh grumpy lady who's like hosting this quiz show, I think. And uh and you have to like unscramble the word, which sounds exactly like it is, and then he supposedly finishes it in like three seconds flat, but like you can clearly tell that these nine letters are not forming a whole word. And uh and so then he just starts humming a little jingle, like uh, and and he's making fun of this lady being like, I can't remember if it's like don't be grumpy or whatever, and then she's telling him to be quiet.

ConorAnd it is it one of the funniest clips I've seen. Uh, anyways, I'm not sure if this sounds familiar at all. Um I will find it once we're done recording, and I'll send it to you in advance so you guys Hello and welcome to Campbell.

Countdown (Clip)I'm only on count now. Don't interrupt me. Tell Rachel your letters. Send them in Rachel, um couple of B's, Q's, and J. Just pick a letter. A bit serious on this show, isn't it? I'll tell you what, we'll have um put putting your one up there. All right. Okay, we've got um like a pick a mix. C, L. No. L. Rumpy, is you, D, B, and T. A and T. Okay.

Countdown (Clip)Start the clock. Well, start the clock. Mr. Gleezer, put the kids in the freezer. And Robinson. M Robinson. Emma Breezer. Okay, okay. Okay. We don't do that. Well, what are you doing? No. Put them in the freezer. Shirley and Lisa. We're gonna have a pizza. We're gonna read her. You don't know Rita? We're gonna have a pizza. Oi, okay.

Countdown (Clip)Okay. Fantastic, okay. Boom, I've got all the letters, Susie. Blood clot. Fantastic. So I win, eh? Um, that's not a word. That's a word? You're a bit moody, ain't ya? Come on, give us a smile. That's not a word. And you are the weakest link. Goodbye.

ConorDon't need to wait. Uh don't do that. Okay. Okay. But um, I mean some of the I think my favorite comedian right now. Oh, what's his name? Oh no. He's a very skinny, nerdy James A. Castor. Yes. Uh, he is hilarious.

BenYes, he he is great. James A. Castor. His uh special on Netflix was very funny.

ConorIs that the one where he comes out and he starts swearing for the first time? Oh my god. Because he's this very straight-laced guy, and all his comed uh com uh comedy stand-ups or whatever are very kind of, you know, yeah, straight lace doesn't swear, and then in this one, he comes out and just starts cursing, and he's like, I found out all my all my viewers and fans or old moms and young, you know, Harry Potter readers, and he's like, I'm done with this, you know?

James Acaster (Clip)And it is uh Right, let's start with the headlines. Swimming out Started swimming in my stand-up comedy. Ten years in the game, I've been a pretty clean comedian. I'm F and Jeff that much, and as a result, I've attracted a demographic who, to be frank, I hate. A bunch of old people encretions every goddamn joke and sick of it. Got addicted Chris Osap. Seriously, man, after every single gig, some mum comes up to me.

James Acaster (Clip)Oh, me and my daughter love that one. Might as well quit now then. You and your daughter enjoying it on the same level. What's my doing?

ConorYeah, he's he's hilarious. I think he's my favorite comedian right now. Um anyway, so the I I do find uh the UK humor and uh a lot of that a lot of it's I don't want to say classier, but just uh more intelligent than some of the stuff going on in in North America.

BenYou should read uh I read his book. It's called James Acastor's Classic Scrapes. And is that good? It's worth a reading. It's worth it's worth it. If you like James A. Castor, you will laugh out loud when you read that book.

ConorAny other any other uh well while we're off topic, uh TV show recommendations, book recommendations, movie recommendations.

Trinstan BrindleI've been watching the midway through the the second season of Severance. If you haven't seen on Apple TV. I'm up to date as well. Yeah, it is uh, you know, I I just think it's it's some of the the the best TV that's around uh at the moment. Very, very weird, but uh yeah. Great program. Sorry, you were gonna say.

BenI I was gonna say um I made some movie recommendations to you, Connor, a while back because you had said that you and Shima were going through uh the AFI Top 100.

ConorI I will say uh here, I'll pull it up right now if I can find it. Um we did watch Chariots of Connor, do you have a spreadsheet of these AF 100 films? Not only do I have a spreadsheet, I have a spreadsheet that is uh conditionally formatted because I let I gave it access to my sister and her partner, or one of my sisters and her partner, because they're big movie buffs. And we put our after uh Shima and I watch it, we each rate it, and then uh based on whether there's a rating there, because some of us, you know, before we met each other had seen it and others.

ConorSo there's you know, both have seen it. One of us has seen it, the other has seen it, and then there's a very fancy um, you know, rating. Chariots of Fire was on the recommendation list. Uh we were not a big fan of Chariots of Fire uh as a running movie.

BenI can't remember Well, it's not a running movie. It's a movie that contains runners, but but Yeah. It's a r it's a movie about running. Uh I suppose. You could look at it that way.

ConorBut I can't remember why. It was we watched it a few months ago. Uh maybe it was just uh you know, we weren't born in the right uh in the right decade.

BenMaybe.

ConorWhat was because it was you said it was one of your favorites of all time.

BenOh absolutely. Absolutely top top five, no doubt about it. I can watch it any weekend.

ConorOh yeah, I no, I think I did tell you uh Oh no, I didn't I didn't give you the remove uh the review. You had just uh mentioned it. Yeah, you said number one chariots of fire, the story of two athletes competing in nineteen twenty-four. Brief Encounter, the UK's equivalent of Casablanca. Yeah. I have not seen that one yet.

BenWell, so again, Brief Encounter and Casablanca, you need to see both because they are referenced so so much in other media. Like, like, I guess it's sort of waning these days, but um there was a time when you know you can't you can't reason reasonably digest pop culture without running into references to to both of these both of these movies, or respectively, sort of US and UK. Um and it's still somewhat the case.

ConorI think I'm terrible just when it comes to pop culture. Like in general, I don't do great at trivia like pub quizzes and stuff, unless if it's like a math or science category. And like uh for instance, I was just telling uh Shima this uh yesterday, is that uh we watched the or me and my buddies watched the Super Bowl a week ago and Kendrick Lamar performed at the halftime show. I thought it was okay, but I like to go and watch these like um breakdowns of like everything you missed and like what it meant. I did not pick up on a single like cultural political reference in that halftime.

ConorLike apparently it was just littered with them, and I didn't I didn't understand any of it. So like when it comes to understanding like the cultural significance of like, you know, oh this is a reference to that, or this is a reference, or like this had this uh I'm like the most ignorant. I'm just watching it like at surface level, being like, oh, does this song sound good? It's like yeah, this is pretty catchy. Did anybody do a flip? So I'm just uh yeah, I think maybe that's the problem though, is I haven't seen enough of these. Um my brain just doesn't work that way. I'm not able to stitch things together.

ConorYeah. One of my weakest it's probably what makes me bad at cryptics as well, too. Uh it it comes up less than but there was there was an episode of House which referenced Casablanca. I've seen all of House. Never well, it was years ago though, so I'm not gonna remember if I remember.

BenUm there was an episode of House where there was like a 17-year-old girl who was coming on to him. Um she ended up having something wrong in her brain that he diagnosed the end, but the end scene of that, he came into the office to to talk to her, and he was basically recreating um Humphrey Bogart's speech from the end of Casablanca.

Dr. House (Clip)If you're not with someone your age, you'll regret it. Maybe not today, maybe not tomorrow, but soon, and for the rest of your life.

BenRight. Which which to anyone who has seen Casablanca was was a great reference. And if you hadn't seen it, it would just totally pass you by.

ConorI was one of the people that had passed by for sure.

Trinstan BrindleThe The Simpsons does that with so many things, right? Right. You can um you can watch an episode of the Simpsons of The Simpsons as a kid, right? And then years later you'll watch a uh a a movie and you're like, oh, that's what they were referring to. It's like yeah now I get it.

BenI I was just gonna say you didn't like Chariot Safire. You you you may or may not like my other top my top three movies. Chariot Safire, The Sting. It's a great it's a great American movie. Um Shawshank Redemption. That's that's one that's a good thing. Oh I love Shawshank. I love Shawshank. Yeah, yeah. That's a recognized classic, I think. Yeah.

Trinstan BrindleI was wondering if the third one was gonna have like an incredible soundtrack as well, like an iconic soundtrack, because the first two. Yes. Oh yeah. The music is such an important part of both of those films.

ConorI mean, I would argue it's the same for Shawshank. Like I can I can like hum in my head, I won't do it on the podcast, but like that final scene, uh in case someone hasn't seen Shawshank, I won't ruin anything. But there's a final epic scene where uh one of the main characters kind of does something significant, we'll say. And like that scene when it's raining, I can like uh the the soundtrack for that is just um fantastic. Fantastic. Love Shawshank. I and I love watching Sha Shank with people that haven't seen Shawshank.

ConorI've probably seen it like six times because like anytime I find out that someone hasn't seen Sha Shank, I'm just like, well, we gotta watch Sha Shank. It's like one of the most enjoyable movies to watch uh with the people that haven't seen it. Um and that haven't haven't uh like don't know the plot of it, um, obviously. Anyways, alright, well tie a bow. I'll let uh uh for the listener, I will watch uh Ben's other favorites and uh we will let you know. Um there's hope though, because I do like Shawshank. Be sure to check these show notes either in your podcast app or at adspthepodcast.com for links to anything we mentioned in today's episode, as well as a link to a GitHub discussion where you can leave thoughts, comments, and questions.

ConorThanks for listening. We hope you enjoyed and have a great day. I am the anti price.

Countdown (Clip)Um

Open the transcript file

Hosts and Guests

Guests

  • Tristan Brindle Guest Inferred

Credit the people on this episode

Be the first to rate this episode

More episodes

All episodes
  1. Episode 313: C++26 Reflection vs CRTP, AI, Kids & More with Zach Laine

    Nov 20, 202647 minAudio

    In this episode, Conor and Bryce chat with Zach Laine about C++26 Reflection vs CRTP, AI, kids & more. Link to Episode 313 on Website Discuss this episode, leave a comment, or ask a question (on GitHub) Socials ADSP:...

    • Apple Podcasts

    Credit the people on this episode

  2. Episode 312: The C++26 Contracts Fiasco

    Nov 13, 202652 minAudio

    In this episode, Conor and Bryce chat with Zach Laine about the C++26 contracts fiasco. Link to Episode 312 on Website Discuss this episode, leave a comment, or ask a question (on GitHub) Socials ADSP: The Podcast:...

    • Apple Podcasts

    Credit the people on this episode

  3. Episode 311: Career Changes, GPUs & More with Zach Laine

    Nov 6, 202628 minAudio

    In this episode, Conor and Bryce talk with Zach Laine about his career and the career changes he has made. Link to Episode 311 on Website Discuss this episode, leave a comment, or ask a question (on GitHub) Socials...

    • Apple Podcasts

    Credit the people on this episode

  4. Episode 310: Leaving NVIDIA for... ?

    Oct 30, 202624 minAudio

    In this episode, Conor and Bryce talk about Bryce's next chapter and where he is leaving NVIDIA for. Link to Episode 310 on Website Discuss this episode, leave a comment, or ask a question (on GitHub) Socials ADSP: The...

    • Apple Podcasts

    Credit the people on this episode

  5. Episode 309: Default Construction & CppCon 2026 with Jason Turner

    Oct 23, 202629 minAudio

    In this episode, Conor and Ben chat with Jason Turner about default construction in C++. Link to Episode 309 on Website Discuss this episode, leave a comment, or ask a question (on GitHub) Socials ADSP: The Podcast:...

    • Apple Podcasts

    Credit the people on this episode