Deep Learning with Convolutional Neural Networks – Dr Mike Pound explains. CNN background: https://youtu.be/py5byOOHZM8 Onion Routing (TOR): https://youtu.be/QRYzre4bf7I 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
The Port Smash exploits Hyperthreading and timings to work out what other programs are doing. Dr Steve Bagley looks at how. Spectre & Meltdown: https://youtu.be/I5mRwzVvFGE Out of Order CPUs: https://youtu.be/_qvOlL8nhN4 Zig Zag Decryption: https://www.youtube.com/watch?v=yxx3Bkmv3ck Physics of Computer Chips: https://www.youtube.com/watch?v=xkLAhU74f3s&t=74s Digital Images: https://www.youtube.com/watch?v=06OHflWNCOE&t=12s Deadly Truth of General AI: https://www.youtube.com/watch?v=tcdVC4e6EV4&t=11s https://www.facebook.com/computerphile Tweets by computer_phile This video was
This is a re-upload of ‘The Computer that Changed Everything’ with the ‘near ultrasonic’ (16k) audio noise removed. If you didn’t hear it in the first place, welcome to my world! -Sean Arguably the first personal computer, the Altair 8800 is the machine that inspired Steve Jobs and Bill Gates. Jason Fitzpatrick from the Centre
What’s the absolute minimum you can compress data to? – Entropy conjures up visions of chemistry and physics, but how does it apply to binary codes and computer science? Professor David Brailsford continues his discussion of compression. Addendum: the formula at 4:40 is the “weighted average bits for that state” rather than the total number
Whether you are a Mac-o-phile or a Mac-o-phobe it is hard to deny the impact of the original Mac. As Mac turns 30, Professor David Brailsford takes us through what the original Mac was like and how it helped people learn to love computers. EXTRA BITS: http://youtu.be/rbeYwh2CstQ How YouTube Works: http://www.youtube.com/watch?v=OqQk7kLuaK4 Note: please excuse 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
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
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
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:
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
Advanced Encryption Standard – Dr Mike Pound explains this ubiquitous encryption technique. n.b in the matrix multiplication animation, the matrices are in the incorrect order, but hopefully the animation still helps to illustrate the general idea. One Encryption Standard to Rule Them All! : https://youtu.be/VYech-c5Dic Almost All Web Encryption Works Like This (SP Networks) :
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
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
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
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
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
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
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
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
The ‘magic’ trick of pointers to pointers – Professor Brailsford explains how what might seem complicated will actually simplify your code. (See Extra Bits video for a code walkthrough) The Professor’s Code: http://bit.ly/Computerphile_ProfBrails_TripleRef EXTRA BITS – Triple Ref Code: https://youtu.be/1s0w_p5HEuY n.b. Message from the Prof: Many thanks to all of you who have pointed out
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
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
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
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
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
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