Computer

It’s absolutely everywhere, but what is TLS and where did it come from? Dr Mike Pound explains the background behind this ubiquitous Internet security protocol. Heartbleed, Running the Code: https://www.youtube.com/watch?v=1dOCHwf8zVQ Secure Web Browsing: https://www.youtube.com/watch?v=E_wX40fQwEA Network Stacks & The Internet: https://www.youtube.com/watch?v=PG9oKZdFb7w&t=2s https://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley. Computer Science
0 Comments
A google researcher was put on leave because he apparently believed his AI project had become sentient. Dr Mike Pound discusses. https://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: https://bit.ly/nottscomputer Computerphile is a sister project to Brady Haran’s Numberphile. More at http://www.bradyharan.com
0 Comments
You don’t just ‘run a cipher’ – you need a mode of operation. Dr Mike Pound explains some relative to the Feistel cipher. **This video was filmed before any social distancing guidelines came into effect** EXTRA BITS: https://youtu.be/0abs6qfuLpg Feistel Cipher Video: https://www.youtube.com/watch?v=FGhj3CGxl8I Mike’s code: github.com/mikepound/feistel https://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited
0 Comments
How well sorted is your algorithm? Choosing the right method to sort numbers has a huge effect on how quickly a computer can process a task. Alex Pinkney talks about two popular sorting algorithms and how they ‘scale up.’ Follow up film “Quick Sort”: http://youtu.be/XE4VP_8Y0BU Alex’s code that generated the data for the tests: https://github.com/apinkney97/Sorts
0 Comments
Why all the confusion, surely SGML, HTML & XML are just different versions of the same thing? Professor Brailsford on the perils of ‘*ML’ Problems with Omitted End Tags: https://youtu.be/Ngi8Iv7mAVA http://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: http://bit.ly/nottscomputer Computerphile is a sister
0 Comments
We’ve been asking “What’s your favourite (favorite) shortcut key?” as a soundcheck question (this slightly overlapped the “What’s your favourite programming language” question) for the last year. Contributors (in order of appearance) Mike Pound Matt Denton Lorraine Underwood Charles Arthur Rob Miles Adrian Page-Mitchell Derek McAuley Michel Valstar Steven Ceron Stephen Howe Steve Bagley Henry
0 Comments
In the early days the UK had its own thoughts on how email addresses should look. Dr Julian Onions was there! https://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: https://bit.ly/nottscomputer Computerphile is a sister project to Brady Haran’s Numberphile. More at http://www.bradyharan.com
0 Comments
How does instant messaging encryption protect against attack? Dr Mike Pound on the double ratchet. Diffie Hellman Key Exchange Explained: https://youtu.be/NmM9HA2MQGI Signal Protocol: https://youtu.be/DXv1boalsDI Endianness Explained with an Egg: https://youtu.be/NcaiHcBvDR4 https://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: https://bit.ly/nottscomputer Computerphile is a sister
0 Comments
Hear Brian Kernighan on how he got into programming, the successors of C and the biggest challenges… Watch Part 2 before it’s live!: https://youtu.be/VVpRj3Po6K4 https://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: https://bit.ly/nottscomputer Computerphile is a sister project to Brady Haran’s Numberphile. More
0 Comments
Improve the efficiency of recursive code by re-writing it to be tail recursive. Professor Graham Hutton explains. EXTRA BITS: https://youtu.be/eoi3s_4mAAc https://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: https://bit.ly/nottscomputer Computerphile is a sister project to Brady Haran’s Numberphile. More at http://www.bradyharan.com
0 Comments
ISPs don’t always get it right – they gamble that all of their subscribers won’t use all of their bandwidth all of the time. Dr Richard Mortier explains Statistical Multiplexing. Routing & YouTube Offline: http://youtu.be/AkxqkoxErRk Network Stacks & The Internet: http://youtu.be/PG9oKZdFb7w Punch Card Programming: http://youtu.be/KG2M4ttzBnY Undecidability Series: http://www.youtube.com/playlist?list=PLzH6n4zXuckpIQPv8hiHpJkSyv0fmXEYr http://www.facebook.com/computerphile Tweets by computer_phile This video was
0 Comments
Professor Brailsford points his parsing program towards a galaxy far, far away…. EXTRA BITS https://youtu.be/gahrebvOAtY The Professor’s Files: https://bit.ly/2sWx9Vp  https://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: https://bit.ly/nottscomputer Computerphile is a sister project to Brady Haran’s Numberphile. More at http://www.bradyharan.com
0 Comments
One of the cleanest ways to cut down a search space when working out point proximity! Mike Pound explains K-Dimension Trees. EXTRA BITS: https://youtu.be/uP20LhbHFBo https://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: https://bit.ly/nottscomputer Computerphile is a sister project to Brady Haran’s Numberphile. More
0 Comments
Websites can still be hacked using SQL injection – Tom explains how sites written in PHP (and other languages too) can be vulnerable and have basic security issues. More from Tom Scott: http://www.youtube.com/user/enyay and https://twitter.com/tomscott Follow the Cookie Trail: http://www.youtube.com/watch?v=LHSSY8QNvew CERN Computing Centre & Mouse Farm: http://www.youtube.com/watch?v=S0MgJFGL5jg http://www.facebook.com/computerphile Tweets by computer_phile This video was filmed
0 Comments
Taking edges one step further with Hysteresis Thresholding – The Canny Operator explained by Image Analyst Dr Mike Pound Finding the Edges (Sobel Operator): https://youtu.be/uihBwtPIBxM How Blurs & Filters work: https://youtu.be/C_zFhWdM4ic Why Asimov’s Three Laws Don’t Work: https://youtu.be/7PKx3kS7f4A Geometric Face Recognition: https://youtu.be/BCBZPtZCI7w http://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley.
0 Comments
We look at and run the code that exploits the Heartbleed bug. Dr. Steven Bagley takes us through the code and shows us how it works. Relevant RFC Document: http://bit.ly/heartbleed-rfc Domino Addition: http://youtu.be/lNuPy-r1GuQ YouTube’s Secret Algorithm: http://youtu.be/BsCeNCVb-d8 http://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University
0 Comments
XOR, an essential logic operation, explained by Professor Brailsford. Continues our series on logic gates/operations. AND OR NOT – Logic Gates Explained: https://youtu.be/UvI-AMAtrvE Binary Addition & Overflow: https://youtu.be/WN8i5cwjkSE Capturing Digital Images (The Bayer Filter) : https://youtu.be/LWxu4rkZBLw Flip Flops, Latches & Memory Details: https://youtu.be/-Ecf7lb4aZ0 The Virtual Reality Cave: https://youtu.be/STMcWUtQr1Y XOR Easter Egg: http://youtu.be/e3JYeJke7KI The Professor’s Notes:
0 Comments
How do you pick a secure password that’s memorable but truly random? Dr Mike Pound explains Diceware The Diceware website: http://bit.ly/c_diceware (Diceware is a trademark of A G Reinhold) Another great thing to do with dice is play games 🙂 -Sean Password Cracking: https://youtu.be/7U-RbOKanYs How to Choose a Password: https://youtu.be/3NjQ9b3pgIg https://www.facebook.com/computerphile Tweets by computer_phile This
0 Comments
Summing up why Hamming’s error correcting codes are regarded as ‘Perfect’ – Professor Brailsford explains. EXTRA BITS: https://youtu.be/i4zC67Yf5Iw For more background on this: https://youtu.be/1_X-7BgHbE0 http://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: http://bit.ly/nottscomputer Computerphile is a sister project to Brady Haran’s Numberphile. More
0 Comments
If you’ve wondered how computer scientists use pairs of cameras to reconstruct a 3D scene, Image Analyst & Lecturer Dr Mike Pound explains. EXTRA BITS: https://www.youtube.com/watch?v=g3bKLcYGhOg Industrial Light-Field Magic: https://youtu.be/ZIfn2Ocy9RU Brain Scanner: https://youtu.be/TQ0sL1ZGnQ4 3D Rock Art Scanner: https://youtu.be/Ahdnkj77rAY CPU vs GPU: https://youtu.be/_cyVDoyI6NE http://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley.
0 Comments
Where are we at with Quantum computing? Robert Smith (of Rigetti Computing) explains that we’re in the EDSAC/ENIAC era…. see follow up video for more technical information: Watch the next one in the series: https://youtu.be/ZN0lhYU1f5Q https://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham:
0 Comments
We look at where the ubiquitous AES came from. Dr Mike Pound introduces the Rijndael algorithm. SP Networks: https://youtu.be/DLjzI5dX8jc How AES Works: https://youtu.be/O4xNJsjtN6E https://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: https://bit.ly/nottscomputer Computerphile is a sister project to Brady Haran’s Numberphile. More at
0 Comments
Surely decimal numbers are easier to understand than binary? So why don’t computers use them? Professor Brailsford explains the relationships between binary, power and simplicity. EXTRA BITS: https://youtu.be/NlWuTYhF8KM Colossus & Bletchley Park: https://youtu.be/9HH-asvLAj4 Inside a Data Centre: https://youtu.be/fd3kSdu4W7c Steve Furber on ARM: https://youtu.be/1jOJl8gRPyQ Fishy Codes – Bletchley’s Other Secret: https://youtu.be/Ou_9ntYRzzw http://www.facebook.com/computerphile Tweets by computer_phile This
0 Comments
Recursion can be tricky to grasp. Professor Thorsten Altenkirch uses Python to demonstrate an example taken from his latest book. More on recursion: https://www.youtube.com/playlist?list=PLzH6n4zXuckrnXQ-5AfWUdnCzZOQgft1B EXTRA BITS: https://youtu.be/c9IH8DHDI4M Thorsten & Isaac’s Python programming book: https://bit.ly/2p3r5IT https://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: https://bit.ly/nottscomputer
0 Comments
Removing voxels until the shape emerges. Space Carving is a kind of virtual sculpture. Image Analyst Dr Mike Pound explains how though it’s a bit rough and ready, it can be lightning fast. Rob Miles on Game Playing AI: https://youtu.be/5oXyibEgJr0 Deep Learning: https://youtu.be/l42lr8AlrHk Secure Web Browsing: https://www.youtube.com/watch?v=E_wX40fQwEA Thanks to Rick van de Zedde, Wageningen UR
0 Comments
We’ve all got to the edge of the wifi coverage, but the idea of coverage produces a network problem, the Hidden Node Problem. Dr Steve Bagley explains. https://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: https://bit.ly/nottscomputer Computerphile is a sister project to Brady
0 Comments
Just what was it that took Facebook, Instagram & WhatsApp offline on 4th October 2021? – Dr Steve Bagley investigates! previously titled “Facebook’s Day Off” Facebook announcement on the outage: https://bit.ly/C_FB-Outage The visualisation software Steve was using was BGP play, downloaded from the RIPE website. https://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited
0 Comments
Voting is centuries old, why can’t we move with the times and use our phones, tablets and computers? Tom Scott lays out why e-voting is such a bad idea. More from Tom Scott: http://www.youtube.com/user/enyay and https://twitter.com/tomscott http://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of
0 Comments
This Primer is to accompany the ‘Busy Beaver Turing Machines’ film which can be viewed here: http://youtu.be/CE8UhcyJS0I Professor Brailsford’s code and further reading: http://bit.ly/busybeaver Turing and the Halting Problem: http://youtu.be/macM_MtS_w4 Busy Beaver Turing Machines: http://youtu.be/CE8UhcyJS0I Domino Addition – Numberphile: http://youtu.be/lNuPy-r1GuQ Ackermann Follow Up: http://youtu.be/uNACwX-O5lk ‘Turing Machines Collection’ Playlist: http://www.youtube.com/playlist?list=PLzH6n4zXuckrEzV0CB1xXbSdsP_a7VUoK “The Most Difficult Program to Compute?”
0 Comments
Cracking the code was only half the battle. To keep the upper hand, when using Bill Tutte’s statistical methods, the detailed counting had to be automated – enter Colossus! Professor Brailsford takes up the story. The professor’s notes: http://www.eprg.org/computerphile/lorenz-combined.pdf Bletchley Park Playlist: https://www.youtube.com/playlist?list=PLzH6n4zXuckrSWWIDJ_3To7ro5-naSk8v Professor Brailsford used the book “Colossus” by B. Jack Copeland and others
0 Comments
10% off at Squarespace: http://squarespace.com/computerphile Secret services want to read people’s communications, politicians talk about terrorists, but what’s the reality of banning encryption? Ross Anderson, Professor of Security Engineering at the Computer Laboratory, University of Cambridge explains how history repeats itself. The Dress: https://youtu.be/Tw0PlGpaqy4 The VR Cave: https://youtu.be/STMcWUtQr1Y Public Key Cryptography: https://youtu.be/GSIDS_lvRv4 Alan Turing and
0 Comments
Email is part of the daily routine for many people, but how does a computer deal with email messages? Professor Tom Rodden explains how email is processed so quickly. http://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: http://bit.ly/nottscomputer Computerphile is a sister project
0 Comments
Harry’s: http://www.harrys.com/ use coupon code “COMPUTERPHILE” for $5 off What’s a colourspace and why do we have different ones? It’s horses for courses as Image Analyst Mike Pound explains. Digital Images: https://www.youtube.com/playlist?list=PLzH6n4zXuckpbNdFO2WW78evpMBqgqyp8 Atari ST: Pushing the Limits: https://youtu.be/3OdtfsXOkEY Professor Steve Furber on ARM: COMING SOON! Universe of Triangles: https://www.youtube.com/playlist?list=PLzH6n4zXuckrPkEUK5iMQrQyvj9Z6WCrm http://www.facebook.com/computerphile Tweets by computer_phile This video
0 Comments
Our eyes can spot edges with no problems, but how do computers determine what’s an edge and what’s not? Image Analyst Dr Mike Pound explains the Sobel Edge detector. How Blurs & Filters work: https://youtu.be/C_zFhWdM4ic The Problem with JPEG: https://youtu.be/yBX8GFqt6GA Secrets Hidden in Images (Steganography): https://youtu.be/TWEXCYQKyDc Man in the Middle Attacks: https://youtu.be/-enHfpHMBo4 Mike’s Code in
0 Comments
Digital currency, how does it work, what’s a data miner and will Bitcoin last? We asked Professor Ross Anderson of the University of Cambridge Computer Laboratory. The Problem with BitCoin: https://youtu.be/s2XHyzPA9Zc Chip & PIN Fraud: https://youtu.be/Ks0SOn8hjG8 $5 Computer – Raspberry Pi Zero: https://youtu.be/WR0ghM3U0M4 Why Computers Use Binary: https://youtu.be/thrx3SBEpL8 Public Key Cryptography: https://youtu.be/GSIDS_lvRv4 http://www.facebook.com/computerphile Tweets by
0 Comments
Diffie Hellman has a flaw. Dr Mike Pound explains how a man in the middle could be a big problem, unless we factor it in… Public Key Cryptography: https://youtu.be/GSIDS_lvRv4 Elliptic Curve Cryptography: Coming Soon! https://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: https://bit.ly/nottscomputer
0 Comments
Postscript took off like a rocket but PDF took its time, many people wondering “What’s it for?” Professor Brailsford’s experience with one such person – a US immigration officer… Unrolling the Loops (Postscript/PDF intro): https://youtu.be/guXgBe2wvEA Fire Pong in Detail: https://youtu.be/ZoZMMg1r_Oc Deep Dream: https://youtu.be/BsSmBPmPeYQ FPS & Digital Video: https://youtu.be/yniSnYtkrwQ Password Cracking: https://youtu.be/7U-RbOKanYs http://www.facebook.com/computerphile Tweets by computer_phile
0 Comments
Just what is a pipeline in the computer science sense? We asked Computer Science guru Professor Brian Kernighan Why Asimov’s Laws of Robotics Don’t Work: https://youtu.be/7PKx3kS7f4A Brian Kerninghan on Bell Labs: https://youtu.be/QFK6RG47bww Don Knuth on Email: https://youtu.be/QS8qwMna8_o Computer That Changed Everything: https://youtu.be/6LYRgrqJgDc http://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley.
0 Comments
One of the most elegant solutions for cryptography. Dr Mike Pound explains one of his most favourite ciphers. https://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: https://bit.ly/nottscomputer Computerphile is a sister project to Brady Haran’s Numberphile. More at http://www.bradyharan.com
0 Comments
Why encrypted group messaging isn’t as secure as point to point. Dr Mike Pound explains this ongoing problem. Instant Messaging & the Signal Protocol: https://youtu.be/DXv1boalsDI Double Ratchet Messaging Encryption: https://youtu.be/9sO2qdTci-s Relevant paper: https://eprint.iacr.org/2017/666.pdf https://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: https://bit.ly/nottscomputer Computerphile
0 Comments
Negative Binary Numbers – you may have heard of ‘signed’ numbers, but do you know how they work? Professor Brailsford explains not just how, but why we use the systems we do. Binary Addition: http://youtu.be/WN8i5cwjkSE Most Difficult Program to Compute?: http://youtu.be/i7sm9dzFtEI Floating Point Numbers: http://youtu.be/PZRI1IfStY0 http://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited
0 Comments
Colossus was one of the very first electronic, special purpose, computers and it was created almost two years earlier than the better known ENIAC. We visit Bletchley Park, home of the code breakers, and TNMoC, The National Museum of Computing. Professor Brailsford shows us the Colossus replica. The Most Difficult Program to Compute?: https://youtu.be/i7sm9dzFtEI Computer
0 Comments