Computerphile - Videos
Back to Channel
Temporal Networks, Where Page Rank meets Lord of the Rings - Computerphile
When considering how things connect together in a network, time can be an extremely important factor. Dr Richard G Clegg of Queen Mary University London takes us through networks using Page rank an...
Vector Search with LLMs - Computerphile
Computerphile is supported by Jane Street. Learn more about them (and exciting career opportunities) at: https://jane-st.co/computerphile This video was filmed and edited by Sean Riley. Computerp...
Coding a Guitar Sound in C - Computerphile
Signal processing is just mathematics, so lets code a guitar sound in C. Dave Domminney Fowler continues the Digital Signal Processing conversation to show how your favourite tunes all rely on DSP....
Cyclic Redundancy Check (CRC) - Computerphile
A checksum that's robust & trivial to compute with Matt Godbolt -- Check out Brilliant's courses and start for free at https://brilliant.org/computerphile/ (episode sponsor) -- More links in full d...
Bad Bot Problem - Computerphile
Following a report on the situation with Social Media and bots, Lewis Stuart of University of Nottingham is inspired to see just how easy it is to fire up his own botnet and puts them to work on a ...
Digital Signal Processing With Audio Data - Computerphile
Demonstrating that you can filter data to smooth out the numbers, but whether it's weather data, stock market information or Taylor Swift, the math is the same! David Domminney Fowler takes us thro...
Network Basics - Transport Layer and User Datagram Protocol Explained - Computerphile
Breaking the network layer model into pieces, starting top-down, Richard G Clegg of Queen Mary University London explains the 'bargain bucket' of networking! Computerphile is supported by Jane Str...
Generating 3D Models with Diffusion - Computerphile
When the 3D dataset is too small to create models of frogs on stilts we have to think of a different way - Lewis Stuart is based at the University of Nottingham and explains how you can use 2D diff...
Implementing Passkeys in Practice - Computerphile
Build your own passkey system like Mike! -- Check out Brilliant for free at https://brilliant.org/computerphile/ (30-day free trial and 20% discount on premium subscription... episode sponsor) -- M...
LLMs and Newcomb's Problem - Computerphile
Newcomb's Problem is a thought experiment which, on the surface, seems obvious, but what if you're trying it out on your identical twin? Which choice is best? Aric Floyd demonstrates it, then tries...
Do Computer Scientists Prefer Tea or Coffee? (Microphone Sound Check Question 2025) - Computerphile
Whenever we're setting up to record a video we ask a question to get the contributor to talk so we can check their microphone is working and set a level for recording. Traditionally, people ask 'wh...
The Return of Festive Flashing Lights - Computerphile
Steve gets all festive and tries to improve on the festive lights he built a mere 11 years ago... Dr Steve Bagley is based at the University of Nottingham. Computerphile is supported by Jane Str...
How Passkeys Work - Computerphile
Passkey pop up everywhere, Mike Pound explains what they are! Check out Brilliant's courses and start for free at https://brilliant.org/computerphile/ (episode sponsor) -- More links in full descri...
Gen AI & Reinforcement Learning- Computerphile
The real-world doesn't graph well. Sydney Von Arx discusses GenAI & RL -- See Jane Street’s training programs in New York, London or Hong Kong at https://jane-st.co/hkginternship26-computerphile (c...
Procedural Generation in Games - Computerphile
Procedural generation is the idea of using simple rules to generate more complicated items - used in games such as Minecraft and Elite, Zac Garby of the University of Nottingham explains with the u...
The Hard Problem of Controlling Powerful AI Systems - Computerphile
As AI systems become more capable, rule-based safeguards, hard-coded restrictions, and simple alignment strategies start to break down. Buck Shlegeris talks about some tactics we might use as detai...
Code Optimisation via Memoization - Computerphile
Learn this caching trick for faster code from Dr Mike Pound -- Check out Brilliant's courses and start for free at https://brilliant.org/computerphile/ (episode sponsor) -- More links in full descr...
Path Planning for Robotics - Computerphile
Need to get to your goal quickly? Ensure you plan the right path! Robots need to work out how to get from here to there somehow! Ayse explains some of the methods they choose. Assistant Professor A...
The Problem with A.I. Slop! - Computerphile
Researchers suggested there's more AI generated content appearing on the web than human generated content - Mike Pound from the University of Nottingham talks about why this might be a problem. F...
How Ethernet Sends Data - Computerphile
How the data flowing through your cables is organised with Matt Godbolt -- See Jane Street’s training programs in New York, London or Hong Kong at https://jane-st.co/Computerphile-programs (channel...
How IP Addresses Relate to Physical Locations - Computerphile
IP Location services almost work by accident rather than by design, Richard explains how they operate. Richard G Clegg is based at Queen Mary University of London. The video title previously menti...
How Computers Store Data Serially - Computerphile
How does data get organised to be stored or sent serially? Matt Godbolt explains some of the encoding used in old devices like floppy disks. nb At around 10:45 the illustration is inaccurate - wh...
Cloning Yourself in AI using LoRA - Computerphile
Amazing photo-realistic video generation is one thing, but being able to insert yourself in there, how does that work? Lewis Stuart from the University of Nottingham explains how a LoRA means you d...
Network Layers Model (Networking Basics) - Computerphile
"The best-laid plans of mice and men often go awry" - as the ISO team were designing a beautiful, structured layered model, people were already building their own. Dr Richard G Clegg of Queen Mary ...
What is Bootstrapping Anyway? - Computerphile
Where does it all start? How is it was say "C is written in C" - Matt Godbolt breaks it down by building it up! Find out more about Matt from his blog: https://bit.ly/C_MGodbolt Computerphile is...
Coding a SHA2 Length Extension Attack - Computerphile
Mike Pound codes up a demo of the length extension attach he explained in our previous video. Mike is based at the University of Nottingham. Code link: http://GitHub.com/mikepound/length-extension...
SHA2 Fatal Flaw? (Hash Length Extension Attack) - Computerphile
SHA2's weakness explained by Dr Mike Pound -- Check out Brilliant's courses and start for free at https://brilliant.org/computerphile/ (episode sponsor) -- More links in full description below ↓↓↓ ...
HyperLogLog Hit Counter - Computerphile
How do huge websites keep track of the traffic numbers? Buck Shlegeris outlines the probabilistic counting algorithm 'Hyperloglog.' Computerphile is supported by Jane Street. Learn more about them...
Sleeper Agents in Large Language Models - Computerphile
It's an older paper, but it checks out. Rob Miles discusses the problem of 'Sleeper Agents' - where LLMs could have hidden traits we don't know about until it's too late. Computerphile is supporte...
How Generative AI Video Works - Computerphile
Following on from 'MikeBot3000' we're delving into just how the Generative AI systems create video. Lewis Stuart is based at the University of Nottingham Computerphile is supported by Jane Street...
CPU Summary - Computerphile
Bringing together some of the concepts from the series on CPU, Memory & low level computer architecture, Matt Godbolt explains how an Operating System might work in conjunction with some of the oth...
The Next Big SHA? SHA3 Sponge Function Explained - Computerphile
Learn more about the Jane Street internship at https://jane-st.co/internship-computerphile-25 If a bug is found in SHA2, SHA3 is already waiting in the wings! Mike Pound takes us through how it w...
Gödel's Incompleteness Theorem - Computerphile
Gödel's Incompleteness Theorem explained with Pen, Paper & Lean (the proof assistant) Professor Thorsten Altenkirch is based at the University of Nottingham. Computerphile is supported by Jane St...
Writing a Text Editor - Computerphile
Writing a text editor can't be that hard can it? Surely just a case of shifting around a bunch of ASCII characters? Dr Steve Bagley is based at the University of Nottingham Computerphile is suppo...
Memory Mapping - Computerphile
Huge memory addresses mean that not every address is valid. Matt Godbolt explains how the addresses are actually used. Computerphile is supported by Jane Street. Learn more about them (and exciti...
Zip It! - Finding File Similarity Using Compression Utilities - Computerphile
Finding Genome similarity can just be a case of zipping the relevant files in the right order. Buck Shlegeris is CEO of Redwood Research Papers: https://homepages.cwi.nl/~paulv/papers/similarity....
CPU Kernel Mode - Computerphile
"If your name's not down, you're not coming in!" - How the CPU's "Bouncer" keeps some memory off-limits. Matt Godbolt continues the series on low-level computing. #computerscience #cpu #computing ...
World Foundation Models - Computerphile
Discussing World Foundation Models with TJ Galda from Nvidia. Computerphile is supported by Jane Street. Learn more about them (and exciting career opportunities) at: https://jane-st.co/computerph...
Reinforcement Learning - Computerphile
Reinforcement Learning is how robots test the water in the real world. -- Check out Brilliant's courses and start for free at https://brilliant.org/computerphile/ (episode sponsor) -- More links in...
Super Intelligence Speculation - Computerphile
Looking to the future, just how intelligent might the current crop of Large Language Models get? Daniel Kokotajlo joins us to discuss Ai2027. Find out more about the AI2027 paper here: http://bit...
CPU Interrupts - Computerphile
We're looking at how the CPU deals with the 'outside world' as Matt Godbolt continues his low-level tour of the computer! Find out more about Matt from his blog: https://bit.ly/C_MGodbolt Comp...
Monte Carlo Tree Search - Computerphile
Automating decision processes continued as Professort Nick Hawes of Oxford Robotics Institute explains how Monte Carlo Tree Search works. Computerphile is supported by Jane Street. Learn more abo...
MikeBot3000: Can We Build an AI Mike from Open Source Tools? - Computerphile
Open source tools for creating videos? Lewis decides to help Mike take a break by creating 'MikeBot3000' - an AI generated Mike Pound... The 'terminator-style' thumbnail image was created using Ch...
AI Sandbagging - Computerphile
Following the theme of AI research and safety, Aric Floyd talks about how some Large Language Models might follow the all too human trait of sandbagging - "lying" about their true capabilities. A...
'Forbidden' AI Technique - Computerphile
The so-called 'Forbidden Technique' with Chana Messinger -- Check out Brilliant's courses and start for free at https://brilliant.org/computerphile/ (episode sponsor) -- More links in full descript...
Hash Collisions & The Birthday Paradox - Computerphile
Mike Pound discusses hash collisions & the birthday paradox -- Learn more and apply to Jane Street’s WiSE program in New York, London or Hong Kong at https://jane-st.co/wise-computerphile (channel ...
Subroutines in Low Level Code - Computerphile
Bashing out low-level code, it can be annoying to re-type the same commands over and over when you need to repeat a routine. Matt Godbolt explains how we can save frequently used code as a subrouti...
AI's Version of Moore's Law? - Computerphile
This video features Sydney Von Arx --- Check out Brilliant's courses and start for free at https://brilliant.org/computerphile/ (episode sponsor) - More links in description below ↓↓↓ Research sug...
What is CUDA? - Computerphile
What is CUDA and why do we need it? An Nvidia invention, its used in many aspects of parallel computing. We spoke to Stephen Jones, one of the architects of CUDA at the recent GTC conference. Com...
Shortest Path Algorithm Problem - Computerphile
A seemingly simple problem that's "in general" incredibly difficult! CEO of Redwood Research Buck Shlegeris explains his favourite algorithmic fact! Buck wants to thank his friend Peter Schmidt-Ni...