How do you verify that someone is who they say they are? Dr Mike Pound on digital signatures. 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
Computer
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
We want to know what you want to see on this channel – leave a comment below or contact us via social media to let us know. We’re listening! http://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley. Computerphile is a project by Brady Haran See the full list of Brady’s
The ‘Swiss Army Knife’ of data structures, Professor Brian Kernighan talks about the associative array with beer & pizza. EXTRA BITS: https://youtu.be/H8k-I4Azbk8 “Code” Books: https://youtu.be/6v6wdK2EbIQ Many thanks to Microsoft Research UK for their support with the ‘Essentials’ mini-series. http://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley. Computer Science at the
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
Parting the veil of mystery on quantum superposition using waves. Professor Phil Moriarty takes us through it. Phil’s blogpost on the subject: https://muircheartblog.wpcomstaging.com/2021/10/26/superposition-without-the-superstition/ This video was formerly called What is Quantum Superposition? 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
How do Madden, FIFA, PGA Tour get that lovely shallow depth of field in real time? Dr Mike Pound explains how Complex Gaussian Blurs can be separable. Mike’s code: https://github.com/mikepound/convolve EXTRA BITS: https://youtu.be/Nl0Wq_BTdmQ 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
What does a GPU do differently to a CPU and why don’t we use them for everything? First of a series from Jem Davies, VP of Technology at ARM. Floating Point Numbers: http://youtu.be/PZRI1IfStY0 Why Computers Use Binary: https://youtu.be/thrx3SBEpL8 How Bitcoin Works: https://youtu.be/JyxRH18YlpA Triangles & Pixels (Graphics Playlist): https://www.youtube.com/playlist?list=PLzH6n4zXuckrPkEUK5iMQrQyvj9Z6WCrm http://www.facebook.com/computerphile Tweets by computer_phile This video was
The iconic Atari 2600 VCS inspired a generation of gamers. Jason Fitzpatrick from the Centre for Computing History on arguably the worlds’ first console. EXTRA BITS: https://youtu.be/9mvBCQTuLb8 Programming the Atari 2600 VCS: Coming Soon Centre for Computing History behind the scenes: https://youtu.be/nCAMMKsbEvw Centre for Computing History’s “Retro Tech Archive” Channel: http://www.bit.ly/C_RTA Centre for Computing History:
Just what’s going on when your email provider wants to send you a text message? Dr Mike Pound talks about multi-factor authentication. Password Cracking: https://youtu.be/7U-RbOKanYs The End of Time (Unix Time) – Numberphile: https://youtu.be/QJQ691PTKsA 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
Uncomputable through to finite state – Professor Brailsford explains Chomsky’s hierarchy. Turing and the Halting Problem: https://youtu.be/macM_MtS_w4 “Most Difficult Program” – Ackermann Function: http://youtu.be/i7sm9dzFtEI Busy Beaver Turing Machines: https://youtu.be/CE8UhcyJS0I Finite State Automata: https://youtu.be/vhiiia1_hC4 Reverse Polish & The Stack: https://youtu.be/7ha78yWRDlE Programming in Postscript: https://youtu.be/S_NXz7I5dQc Professor Brailsford’s Notes: http://bit.ly/computerphile_Chomsky Professor Brailsford’s t-shirt kindly supplied by Peleg Bar
Can deep learning improve your gaming experience? We have no idea but we know how it works. Dr Mike Pound on Deep Learned Super Sampling EXTRA BITS: https://youtu.be/4ZkrLfEIJXI 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
More information on just what Terms and Conditions can contain, and what that can mean for your data and your details. Professor Tom Rodden from the University of Nottingham. Get Literatin, the T’s & C’s plug-in (for Chrome or Firefox) here: http://bit.ly/literatin Original “Terms & Conditions” film: https://www.youtube.com/watch?v=9Hb2oMlRI0I http://www.facebook.com/computerphile Tweets by computer_phile This video was
Hitler’s High Command didn’t use Enigma, they used a faster system called Lorenz, but when Allied forces first encountered it, they had no idea what it was and code-named it ‘Tunny’ (Tuna). Professor Brailsford explains why this relates to the early days of Computer Science Next Video in this series: https://youtu.be/yxx3Bkmv3ck The Professor’s Notes: Undulator
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
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
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
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
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
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
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
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
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
How do instant message apps do end to end encryption when one phone may not even be switched on yet? Dr Mike Pound on the Signal protocol at the core of most messaging apps. Double Ratchet: COMING SOON! https://www.facebook.com/computerphile Tweets by computer_phile This video was filmed and edited by Sean Riley. Computer Science at the
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
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
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
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
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
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
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
We’ve all heard of web browser caches, but why does a super fast modern CPU need a cache? Because it’s too fast. Dr Steve “Heartbleed” Bagley explains. Professor Steve Furber on Building the BBC Micro: https://youtu.be/y4WG549i3YY How Computer Memory Works: https://youtu.be/XETZoRYdtkw Why Asimov’s Laws Don’t Work: https://youtu.be/7PKx3kS7f4A The Problem with JPEG: https://youtu.be/yBX8GFqt6GA http://www.facebook.com/computerphile Tweets by
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
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
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.
What was the first undecidable problem? Professor Brailsford takes us on a computerphile tangent & gives us his angle on a pre-computer example of undecidability. Note from Professor Brailsford: a couple of corrections for this film: 1/ “… early 18th Century” for Gauss should be ” … early 19th century” 2/ “… 100 years ago”
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.
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:
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
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
Secure Hashing Algorithm (SHA1) explained. Dr Mike Pound explains how files are used to generate seemingly random hash strings. EXTRA BITS: https://youtu.be/f8ZP_1K2Y-U Tom Scott on Hash Algorithms: https://youtu.be/b4b8ktEV4Bg 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
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:
When a Bitcoin Miner Mines, what is happening? Dr Mike Pound exposes the process.. note: at 3:39 Mike mentions a Bitcoin is mined every ten minutes when it is actually a block that is mined every ten minutes, at time of recording a successful block generates 12.5 new Bitcoins. Password Cracking: https://youtu.be/7U-RbOKanYs Onion Routing (TOR):
Machine Learning where you put in a fraction of the effort? What’s not to like? – Dr Michel Valstar explains Active & Cooperative Learning. 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
The story of recursion continues as Professor Brailsford explains one of the most difficult programs to compute: Ackermann’s function. Professor Brailsford’s programs: http://bit.ly/1nhKtW4 Follow Up Film from the Prof in response to this film: https://www.youtube.com/watch?v=uNACwX-O5lk What on Earth is Recursion?: http://youtu.be/Mv9NEXX1VHc Fibonacci Programming: http://youtu.be/7t_pTlH9HwA Heartbleed, Running the Code: http://youtu.be/1dOCHwf8zVQ VR Series: COMING SOON! Please note,