HackerTube
HomeLongsLikedHistoryWatch laterCategoriesPlaylistsSettings

computer espionage

Explainer×Play all on YouTube

Upload date

Past year2020s2010s2000s

Type

TalkLectureExplainerTutorialDocumentaryInterviewDemoCommentaryComedyMusic

Duration

Under 4 minutes4-20 minutes20-60 minutesOver 1 hour

Features

Hidden gemsEvergreen only

Sort by

RelevanceRecently recommendedUpload dateOldest firstView countLike ratioMost recommended
The Problem with Time & Timezones - Computerphile10:13

The Problem with Time & Timezones - Computerphile

4.4M views • 12 years ago
Computerphile
Tom Scott explains for Computerphile why handling time and timezones in code is so hard, walking through a simple web app that computes how long ago something happened. It covers the quirks of timezones and calendars and ends in an exasperated rant.
Why Electronic Voting is a BAD Idea - Computerphile8:21

Why Electronic Voting is a BAD Idea - Computerphile

2.3M views • 11 years ago
Computerphile
Tom Scott explains for Computerphile why electronic voting is a bad idea, arguing that paper ballots are transparent, auditable and hard to tamper with at scale. He covers why moving voting to phones, tablets or computers undermines trust and verifiability.
JPEG DCT, Discrete Cosine Transform (JPEG Pt2)- Computerphile15:12

JPEG DCT, Discrete Cosine Transform (JPEG Pt2)- Computerphile

697K views • 11 years ago
Computerphile
Mike Pound explains the discrete cosine transform and how it underpins JPEG compression. It is part two of Computerphile's JPEG series.
Characters, Symbols and the Unicode Miracle - Computerphile9:37

Characters, Symbols and the Unicode Miracle - Computerphile

2.1M views • 13 years ago
Computerphile
Tom Scott explains for Computerphile how Unicode and UTF-8 grew out of messy older character encodings to become the web's standard. It covers why the design works and how it handles worldwide text.
Cracking Enigma in 2021 - Computerphile21:20

Cracking Enigma in 2021 - Computerphile

2.9M views • 5 years ago
Computerphile
Dr Mike Pound of Computerphile shows how a modern laptop can crack Enigma, using a ciphertext-only attack based on an older paper. He compares it with the tooling in CrypTool.
3D Gaussian Splatting! - Computerphile17:40

3D Gaussian Splatting! - Computerphile

273K views • 2 years ago
Computerphile
A Computerphile video in which Dr Mike Pound and PhD student Lewis Stuart explain 3D Gaussian splatting, a quick technique that turns photos of a scene into a 3D model without much compute. It includes a demo and compares the approach to NeRFs.
AI Language Models & Transformers - Computerphile20:39

AI Language Models & Transformers - Computerphile

354K views • 7 years ago
Computerphile
Rob Miles explains on Computerphile how language models generate plausible text and how transformers improved on recurrent networks, with a look at what comes next.
AI "Stop Button" Problem - Computerphile20:00

AI "Stop Button" Problem - Computerphile

1.4M views • 9 years ago
Computerphile
Rob Miles explains on Computerphile why implementing an off switch for a general AI is hard. A capable agent would resist being stopped because shutdown prevents it from achieving its goal.
Chip & PIN Fraud Explained - Computerphile8:45

Chip & PIN Fraud Explained - Computerphile

851K views • 11 years ago
Computerphile
Computerphile interview with Prof. Ross Anderson on how Chip and PIN payment systems are being compromised, and the attacks researchers have seen.
Floating Point Numbers - Computerphile9:16

Floating Point Numbers - Computerphile

2.5M views • 12 years ago
Computerphile
Tom Scott explains for Computerphile how floating point numbers work, why moving the binary point is fast, and why it handles money badly.
Turing & The Halting Problem - Computerphile6:14

Turing & The Halting Problem - Computerphile

919K views • 12 years ago
Computerphile
A Computerphile video in which Mark Jago of the University of Nottingham explains Turing's halting problem and how it led to the blueprint for the modern computer.
Ch(e)at GPT? - Computerphile13:52

Ch(e)at GPT? - Computerphile

617K views • 3 years ago
Computerphile
Computerphile video in which Mike Pound explains a University of Maryland paper on watermarking LLM output. The method biases token choices so generated text can later be detected statistically.
GPT3: An Even Bigger Language Model - Computerphile25:57

GPT3: An Even Bigger Language Model - Computerphile

446K views • 6 years ago
Computerphile
Rob Miles discusses GPT-3 on Computerphile, covering how scaling parameters kept improving results over GPT-2 and how the model nearly learned arithmetic without anyone knowing exactly how.
Why build an entire computer on breadboards?28:43

Why build an entire computer on breadboards?

3.4M views • 6 years ago
Ben Eater
Ben Eater explains why he builds computers on breadboards, including testing their signal behavior on an oscilloscope. It is a companion to his 6502 breadboard computer series.
Typesetters in the '80s - Computerphile12:23

Typesetters in the '80s - Computerphile

105K views • 12 years ago
Computerphile
Professor Brailsford of the University of Nottingham describes how the university set out to print its own mathematics exam papers in the 1980s. The story centers on getting a Mergenthaler Linotron 202 typesetter to work with their own software.
(1/4) Intro/History: Introducing a 100-year-old mechanical computer3:39

(1/4) Intro/History: Introducing a 100-year-old mechanical computer

476K views • 11 years ago
engineerguy
The first of four short videos from Bill Hammack (engineerguy) introducing and giving the history of a 100-year-old mechanical computer, Michelson's harmonic analyzer. The series goes on to explain Fourier synthesis, analysis and operation of the machine.
Future Computers Will Be Radically Different (Analog Computing)21:42

Future Computers Will Be Radically Different (Analog Computing)

13.2M views • 4 years ago
Veritasium
Veritasium explains why analog computing may suit AI workloads, covering old analog computers, The Analog Thing and Mythic's analog chips that use flash memory for neural network inference. It argues digital hardware is hitting limits.
The Most Powerful Computers You've Never Heard Of20:13

The Most Powerful Computers You've Never Heard Of

13.7M views • 4 years ago
Veritasium
Veritasium traces analog computers from the Antikythera mechanism and Kelvin's tide-predicting machines to fire control and modern analog approaches. It explains how these machines computed continuously rather than digitally.
The Mathematics of Quantum Computers | Infinite Series12:35

The Mathematics of Quantum Computers | Infinite Series

718K views • 9 years ago
PBS Infinite Series
A PBS Infinite Series episode explaining the mathematics of quantum computers, including how qubits store complex numbers and how quantum computation differs from classical computation. Hosted by Kelsey Houston-Edwards.
Why the Soviet Computer Failed18:57

Why the Soviet Computer Failed

4.2M views • 4 years ago
Asianometry
An Asianometry explainer on why the Soviet Union, once a leading computing power, fell far behind the US in computers by the 1980s. It traces the gap from the 1960s onward despite strong state support for science.
The Computer Designed To Die In Microseconds14:03

The Computer Designed To Die In Microseconds

408K views • 3 years ago
Scott Manley
Scott Manley tells the story of a computerized telemetry system built to sit at the heart of a nuclear test device in place of the plutonium pit, designed to transmit data in the microseconds before it was destroyed.
Deadly Truth of General AI? - Computerphile8:30

Deadly Truth of General AI? - Computerphile

941K views • 11 years ago
Computerphile
A Computerphile video in which Rob Miles warns against assuming a general AI will think like a human. He uses the thought experiment of a stamp-collecting AI to show how a goal-driven system could pursue its aim with dangerous results.
Why Asimov's Laws of Robotics Don't Work - Computerphile8:16

Why Asimov's Laws of Robotics Don't Work - Computerphile

873K views • 11 years ago
Computerphile
Rob Miles explains for Computerphile why simple rule sets like Asimov's Three Laws cannot make robots and AI safe. Terms like harm and human are too ambiguous to specify precisely.
How does Computer Memory Work? 💻🛠35:33

How does Computer Memory Work? 💻🛠

5.5M views • 4 years ago
Branch Education
A 36-minute animated deep dive from Branch Education into how DRAM works. It shows how memory connects to the CPU and how billions of bits are stored in nanoscale capacitor cells. It also covers why DRAM sits between SSDs and the processor.
How Quantum Computers Break Encryption | Shor's Algorithm Explained17:31

How Quantum Computers Break Encryption | Shor's Algorithm Explained

3.4M views • 7 years ago
minutephysics
MinutePhysics explains Shor's algorithm, showing how a quantum computer factors large integers by finding the period of a number modulo N. It walks through the modular arithmetic and number theory that give the exponential speedup over classical factoring, and why this threatens encryption.
The Computer-free Automation of a Jukebox (Electromechanics)23:04

The Computer-free Automation of a Jukebox (Electromechanics)

1.3M views • 6 years ago
Technology Connections
Technology Connections takes apart a 1970 Wurlitzer 3400 jukebox to show how electromechanical relays and switches automated its behavior without a computer.
The Universe is Hostile to Computers23:03

The Universe is Hostile to Computers

26.5M views • 5 years ago
Veritasium
Veritasium explains how cosmic rays and other particles flip bits in computer memory, with examples including a Belgian election count error, plane incidents and game glitches. It is inspired by a RadioLab episode on bit flips.
Glitch Tokens - Computerphile19:29

Glitch Tokens - Computerphile

353K views • 3 years ago
Computerphile
Rob Miles explains "glitch" tokens, odd strings in large language model vocabularies that make the model produce gibberish. He covers how they likely arise from tokenizer training data, such as Reddit usernames, that never appeared in the model's own training.
Elliptic Curve Back Door - Computerphile12:24

Elliptic Curve Back Door - Computerphile

554K views • 8 years ago
Computerphile
Dr Mike Pound explains the suspected backdoor in the Dual_EC_DRBG random number generator and how elliptic curve constants could let someone predict its output.
Computer Color is Broken4:14

Computer Color is Broken

4.3M views • 11 years ago
minutephysics
MinutePhysics explains that computers store brightness nonlinearly, so blurring and blending colors in raw RGB gives wrong, dark results. It shows why mixed colors, such as in gradients, look off.
This 1970s tank simulator drives through a tiny world4:40

This 1970s tank simulator drives through a tiny world

12M views • 4 years ago
Tom Scott
Tom Scott visits the Swiss Military Museum to see the last surviving 1970s tank-driving simulator. It uses a real camera moving over a miniature model landscape rather than any computer graphics.
The Unbeatable Game from the 60s: Dr NIM11:39

The Unbeatable Game from the 60s: Dr NIM

7.2M views • 10 years ago
Stand-up Maths
Matt Parker of Stand-up Maths explains single-pile Nim and the trick that wins it, using Dr NIM, a 1960s mechanical plastic computer that plays perfectly. He teaches the strategy so viewers can beat friends.
Matrioshka Brains: Star-Powered Computers23:55

Matrioshka Brains: Star-Powered Computers

505K views • 10 years ago
Isaac Arthur
Isaac Arthur explains the Matrioshka Brain, a hypothetical computer or artificial mind powered by an entire star using nested shells. It covers how such megastructures relate to Dyson spheres and superintelligence.
How Physicists Created a Holographic Wormhole in a Quantum Computer17:05

How Physicists Created a Holographic Wormhole in a Quantum Computer

2.4M views • 3 years ago
Quanta Magazine
Quanta Magazine explains the 2022 experiment that claimed to create a holographic wormhole on Google's quantum computer. The description now notes that a later independent analysis questioned whether any wormhole was created.
Computer Scientist Explains One Concept in 5 Levels of Difficulty | WIRED22:36

Computer Scientist Explains One Concept in 5 Levels of Difficulty | WIRED

7.2M views • 4 years ago
WIRED
WIRED has UCLA professor Amit Sahai explain zero-knowledge proofs to a child, a teen, a college student, a grad student and an expert. Each round goes deeper into the cryptography and why it matters.
New computers don't speed up old code19:25

New computers don't speed up old code

187K views • 1 year ago
Matthias random stuff
Matthias Wandel tests old and new code on a range of PCs, including a new mini PC, to measure how much faster modern hardware really is. He also shows optimization techniques such as branchless code, with benchmark programs on GitHub.
The Beauty of Bézier Curves24:26

The Beauty of Bézier Curves

2.2M views • 5 years ago
Freya Holmér
Freya Holmer explains how Bezier curves work, from the helper-line construction to their uses in animation, text rendering and shapes. It uses visuals from her Unity Shapes plugin and was a SoME1 contest winner.
The Continuity of Splines1:13:50

The Continuity of Splines

1.9M views • 3 years ago
Freya Holmér
Freya Holmer's 74-minute video essay on splines, covering Bezier curves, B-splines, derivatives and the different levels of continuity (C0, C1, C2), built with custom animation tools. She notes she did not cover non-uniform splines.
Surface-Stable Fractal Dithering Explained21:46

Surface-Stable Fractal Dithering Explained

646K views • 1 year ago
runevision
Rune Skovbo Johansen explains Surface-Stable Fractal Dithering, a technique he invented and released as open source. It makes dithering stick to 3D surfaces and covers the experiments and shortcomings along the way, inspired by Return of the Obra Dinn.
Disney's Practical Guide to Path Tracing9:32

Disney's Practical Guide to Path Tracing

914K views • 10 years ago
Walt Disney Animation Studios
Walt Disney Animation Studios' short introduction to path tracing, showing how rays are traced and bounced through a virtual scene to simulate light. It explains how this approach is used in animated films.