Show Notes
Does anyone program just for fun anymore? This episode we're talking about recreational programming, with a focus on A.K. Dewdney's Computer Recreations column from the 1980s. Also, taco shops. https://cs.stanford.edu/~knuth/recreational-cs.pdf FUN 2026 The New Turing Omnibus Send us Fan Mail
More from Picture Me Coding
This week we conclude our discussion of dynamic memory allocation with a discussion of the history and implementation of garbage collectors. There are no mentions of raccoons. Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I Uniprocessor Garbage Collection Techniques? cpython/InternalDocs/garbage_collector.md at main Generation Scavenging: A Non-disruptlve High Perfornm.nce Storage Reclamation Algorithm 1. Introduction 2. The Relationship Betw Sen...
This week we present the first of two episodes on dynamic memory allocation. We were going to talk about garbage collection, but realized we should probably discuss allocators first. Turns out they are complicated, and there are many different strategies. Dynamic Storage Allocation: A Survey and Critical Review (Wilson) Hoard: a scalable memory allocator for multithreaded applications mimalloc: A new, high-performance, scalable memory allocator for the modern era - Microso...
In this episode we interview Alan Dyke, a colleague of Erik's who got his Ph.D from the University of Wales, Aberystwyth, where he did research on Computer-Aided Software Engineering. We talk about Alan's unique journey in software development, going from the academic environment to the defense industry, embedded software, and biotech. We also learn about the crucial importance of calibrating your software for hurricanes. Send us Fan Mail
This week we're talking about Mike's visit to DataCon LA 26. We talk about the conference, various talks he was able to see, and his own experience giving a talk. Compression Represents Intelligence Linearly [2602.17127] The Emergence of Lab-Driven Alignment Signatures: A Psychometric Framework for Auditing Latent Bias and Compounding Risk in Generative AI Instructor spaCy John Snow Labs Hierarchical Navigable Small Worlds (HNSW) | Pinecone Lance Video is a demonstration platform ...
In this episode we discuss the Monte Carlo method, both the technique and its place in the history of computing. The Monte Carlo method is a set of tools that use probability to solve problems that are otherwise intractable. Programs using Monte Carlo were among the first programs created on digital computers. The Monte Carlo Method Nicholas Metropolis; S. Ulam Journal of the American Statistical Association, Vol. 44, No. 247. (Sep. Equation of State Calculations by Fast Computi...