Shor's Algorithm for Quantum Computing - Computerphile
We brought a computer scientist and a physicist together to talk about Shor's algorithm - a famous factorisation algorithm for that can break some currently used encryption techniques if implemented in the quantum realm. Phil's accompanying blog post: https://muircheartblog.wpcomstaging.c... 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. Computerphile is a sister project to Brady Haran's Numberphile. More at https://www.bradyharanblog.com

▶︎
Why AI Tokens are so Expensive - Computerphile

▶︎
Physicist: "It Was Hiding in Plain Sight"

▶︎
There’s a Problem with Quantum Mechanics – with Jim Al-Khalili

▶︎
RCA and the Vacuum Tube's Last Stand

▶︎
Physics doesn't explain the universe. Computation does | Stephen Wolfram: Full Interview

▶︎
Vector Search with LLMs - Computerphile

▶︎
21 Yr Old Disproves 4 Decades Old Belief in Computing

▶︎
Greatest Mysteries of Gravity | Brian Greene & Kip Thorne | World Science Festival

▶︎
The World's Most Important Machine

▶︎
Post Quantum Cryptography - Computerphile

▶︎
Cracking Enigma in 2021 - Computerphile

▶︎
Creator of C++: Bell Labs, Negative Overhead Abstraction, Mistakes | Bjarne Stroustrup

▶︎
Incredible Ancient Things that We Have Recently Translated

▶︎
What rebuilding AlphaGo teaches us about self-play, RL, and future of LLMs - Eric Jang

▶︎
The Next Big SHA? SHA3 Sponge Function Explained - Computerphile

▶︎
The Hardest Questions in Physics | World Science Festival

▶︎
DeepSeek is a Game Changer for AI - Computerphile

▶︎
Fuzzing Programs to Find Bugs - Computerphile

▶︎
There Is Something Faster Than Light

▶︎
