ComputerphileStagione 2026

Aggiungi un programma alla Watchlist

Segna come visto

Videos all about computers and computer stuff. Sister channel of Numberphile.

Dove guardare Computerphile • Stagione 2026

24 Episodi

Do Computer Scientists Prefer Tea or Coffee? (Microphone Sound Check Question 2025)
E1
Do Computer Scientists Prefer Tea or Coffee? (Microphone Sound Check Question 2025)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 'what did you have for breakfast?' - we ask something different each year!
Trying Newcomb's Problem on AI
E2
Trying Newcomb's Problem on AINewcomb'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 it on Anthropic's Claude, which doesn't always play ball!
Implementing Passkeys in Practice
E3
Implementing Passkeys in PracticeBuild your own passkey system like Mike!
Generating 3D Models with Diffusion
E4
Generating 3D Models with DiffusionWhen 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 diffusion to create 3D models.
Network Basics - Transport Layer and User Datagram Protocol Explained
E5
Network Basics - Transport Layer and User Datagram Protocol ExplainedBreaking the network layer model into pieces, starting top-down, Richard G Clegg of Queen Mary University London explains the 'bargain bucket' of networking!
Digital Signal Processing With Audio Data
E6
Digital Signal Processing With Audio DataDemonstrating 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 through it.
Bad Bot Problem
E7
Bad Bot ProblemFollowing 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 fake social media site: 'scroll hole.'
Cyclic Redundancy Check (CRC)
E8
Cyclic Redundancy Check (CRC)A checksum that's robust & trivial to compute with Matt Godbolt
Coding a Guitar Sound in C
E9
Coding a Guitar Sound in CSignal 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.
Vector Search with LLMs
E10
Vector Search with LLMs
Temporal Networks, Where Page Rank meets Lord of the Rings
E11
Temporal Networks, Where Page Rank meets Lord of the RingsWhen 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 and Lord of the Rings.
Haptic Rendering
E12
Haptic RenderingHaptics, often associated with video game controllers, are systems that provide a touch sensation for users, but how do we calculate the forces involved? Associate Professor of Robotics and Autonomous Systems Dr Ayse Kucukyilmaz is based at the University of Nottingham.
Post Quantum Cryptography
E13
Post Quantum CryptographyPrepping for Post-Quantum, Mike Pound explains why now!
Oversampling Data (Explained with Audio)
E14
Oversampling Data (Explained with Audio)If you run out of headroom with your chosen sample rate, how do you avoid the problems of unwanted harmonics? - Dave Domminney Fowler explains how oversampling can help.
Original Hello World in "B" Programming Language
E15
Original Hello World in "B" Programming LanguageB is the forerunner to C - but seemed lost - Angelo Papenhoff decided to change it and brought it back from the brink! Here he tries to recreate Brian Kernighan's original 'Hello World' with a few wrinkles!
Finding Hardware Bugs
E16
Finding Hardware BugsWhen you're setting your hardware design out using automated tools is essential, but what if the tools themselves have bugs in them? John P Wickerson is based at Imperial College London.
Hacking on the PDP1 Raspberry Pi Emulator
E17
Hacking on the PDP1 Raspberry Pi EmulatorThe PDP1 was a groundbreaking computer from the 1950's - but where does it fit into computing history and how would you use it? Thanks to Angelo Papenhoff from "Obsolescence Guaranteed" for demonstrating the PiDP1 emulator!
Why Multi-Threaded Code Can Sometimes Misbehave (Weak Memory Concurrency)
E18
Why Multi-Threaded Code Can Sometimes Misbehave (Weak Memory Concurrency)This video is about how Weak Memory Concurrency can cause multiple threads to do unexpected things!
The "Trick" that Compilers Use for Long Division
E19
The "Trick" that Compilers Use for Long DivisionLong division can be arduous - division in general is something that even computer processors try to avoid with a simple technique. Matt Godbolt demos it and then shows how a simple C program can cause a compiler to employ this trick.
Human Readable Code
E20
Human Readable CodeKnuth talked about "Literate Programming" over forty years ago, but what does it mean to have code that a developer and a client can agree on? Dr Robert Chatley of Imperial College London demonstrates how it might work.
Fuzzing Programs to Find Bugs
E21
Fuzzing Programs to Find BugsFuzzing is a technique to find programming bugs by testing with random inputs - but there are smarter ways to go about it! Professor Alastair F Donaldson leads the Multicore Programming research group at Imperial College.
TCP a : Ensuring Your Data Gets There & in the Right Order!
E22
TCP a : Ensuring Your Data Gets There & in the Right Order!Continuing the deep dive down the network stack, Richard begins the story of TCP. Richard G Clegg is based at Queen Mary University London.
TCP b : Additive Increase Multiplicative Decrease & 'Slow Start'
E23
TCP b : Additive Increase Multiplicative Decrease & 'Slow Start'Network Basics story continues with the second part of the TCP segment. Richard G Clegg is based at Queen Mary University London.
Is it Possible to Block Childrens' Access to Social Media?
E24
Is it Possible to Block Childrens' Access to Social Media?With the UK planning to follow Australia in a ban on social media for under 16s, we ask how it might work? Dr Mike Pound is an Associate Professor at the University of Nottingham.