Automated Mathematical Proofs – Computerphile

From Computerphile. Could a computer program find Fermat’s Lost Theorem? Professor Altenkirch shows us how to get started with lean. EXTRA BITS (A deeper dive into automated proofs) : https://youtu.be/PaKHRfSkhnA https://www.facebook.com/computerphile https://twitter.com/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…

Scratch? Python? C? Kernighan on Languages for Kids Coding – Computerphile

From Computerphile. We asked Brian Kernighan (author of ‘C Programming Language’) what language kids should try first. Coffee with Kernighan: Coming Soon https://www.facebook.com/computerphile https://twitter.com/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

Tricking AI Image Recognition – Computerphile

From Computerphile. AI Object detection is getting better and better, but as Dr Alex Turner demonstrates, it’s far from perfect, and it doesn’t recognise things in the same way as us. https://www.facebook.com/computerphile https://twitter.com/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…

Computing with Soft Robots – Computerphile

From Computerphile. Even the most impressive soft robots have an external control system. What if the software could be running on soft hardware? – Associate Professor Perla Maiolino explains the soft logic in soft robots. ORI Soft Robots group: Perla Maiolino (speaker) Liang He Sihan Wang (Demonstrator) Francesco Grella Peizhi Zhang Oliver Shorthose ORI Soft…

LaMDA Logic – Computerphile

From Computerphile. Discussing the philosophical ideas behind AI Sentience, with Professor Mark Jago, Professor of Philosophy at University of Nottingham. Mark’s Philosophy and Logic channel is here: https://bit.ly/C_AtticPhilo Previous Computerphile Videos featuring Mark: https://youtu.be/macM_MtS_w4 https://youtu.be/dNRDvLACg5Q Mike Pound on LaMDA: https://youtu.be/iBouACLc-hw https://www.facebook.com/computerphile https://twitter.com/computer_phile This video was filmed and edited by Sean Riley. Computer Science at the…

No, it’s not Sentient – Computerphile

From Computerphile. 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 https://twitter.com/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

What’s Virtual Memory? – Computerphile

From Computerphile. With the news Apple are implementing Virtual Memory on the iPad, Dr Steve Bagley takes us through what virtual memory is and how it works. https://www.facebook.com/computerphile https://twitter.com/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.…

Why Information Theory is Important – Computerphile

From Computerphile. Zip files & error correction depend on information theory, Tim Muller takes us through how Claude Shannon’s early Computer Science work is still essential today! https://www.facebook.com/computerphile https://twitter.com/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.…

Breaking RSA – Computerphile

From Computerphile. If you pick the wrong prime numbers, cracking RSA becomes a cinch. Dr Mike Pound explains the findings of researcher Hanno Böck ARS Technica Article: https://bit.ly/C_BReakingRSa_Article Hanno’s Blog: https://bit.ly/C_HannoRSA https://www.facebook.com/computerphile https://twitter.com/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…

Psychic Signatures (Java Vulnerability) – Computerphile

From Computerphile. The psychic paper in the TV show "Doctor Who" displays whatever the Doctor needs it to show at any given time. The Java vulnerability Neil Madden exposed is a digital version of this. Dr Mike Pound explains. Neil Madden’s blog: https://neilmadden.blog/2022/04/19/psychic-signatures-in-java https://www.facebook.com/computerphile https://twitter.com/computer_phile This video was filmed and edited by Sean Riley. Computer…

Square & Multiply Algorithm – Computerphile

From Computerphile. How do you compute a massive number raised to the power of another huge number, modulo something else? Dr Mike Pound explains the super-quick square & multiply algorithm. Numberphile’s Witness Numbers video which inspired Mike: https://www.youtube.com/watch?v=_MscGSN5J6o https://www.facebook.com/computerphile https://twitter.com/computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of…

Automating Boston Dynamics Spot Robot – Computerphile

From Computerphile. Could robots like this be sent into nuclear facilities to autonomously deal with toxic waste? That’s the plan. Nick & Michal from Oxford Robotics Institute demonstrate & explain their automation of the familiar yellow robot ‘spot.’ The project was the result of a collaboration between the Oxford Robotics Institute (particularly the DRS and…

High Level Languages & the IBM 360 Series – Computerphile

From Computerphile. Continuing on from the Professor’s look at the Mythical Man Month, we’re talking about whether IBM could have used high level languages in their groundbreaking 360 series. https://www.facebook.com/computerphile https://twitter.com/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…

Inside the Hidden Git Folder – Computerphile

From Computerphile. Git doesn’t actually perform magic, but it’s pretty neat. Dr Max Wilson takes us through the various elements that make Git such a useful tool. https://www.facebook.com/computerphile https://twitter.com/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.…

K-d Trees – Computerphile

From Computerphile. 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 https://twitter.com/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…

Man in the Middle & Needham–Schroeder Protocol – Computerphile

From Computerphile. There’s a reason Needham–Schroeder isn’t used any more – Tim Muller demonstrates the weakness in the technique. https://www.facebook.com/computerphile https://twitter.com/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

Log4J & JNDI Exploit: Why So Bad? – Computerphile

From Computerphile. The "most critical vulnerability of the last decade?" – Dr Bagley and Dr Pound explain why it’s so pervasive, and even affected Mike’s own code! https://www.facebook.com/computerphile https://twitter.com/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.…

Joining Point Cloud Scans (ICP) – Computerphile

From Computerphile. You’ve scanned a room or object and now you have lots of discrete scans you want to fit together. Dr Mike Pound explains how the Iterative Closest Point Algorithm is used. https://www.facebook.com/computerphile https://twitter.com/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…

Discussing System On Chip (SoC) – Computerphile

From Computerphile. With the hype around Apple’s M1 chip, Dr Steve Bagley discusses what the big deal is with the system on chip approach to building computers – spoiler, it’s not a new thing! https://www.facebook.com/computerphile https://twitter.com/computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: https://bit.ly/nottscomputer Computerphile is…

Superposition in Quantum Computers – Computerphile

From Computerphile. 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 https://twitter.com/computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: https://bit.ly/nottscomputer Computerphile is…

WiFi’s Hidden ____ Problem – Computerphile

From Computerphile. 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 https://twitter.com/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…

Why Did Facebook Go Down? – Computerphile

From Computerphile. 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 https://twitter.com/computer_phile This video was filmed and edited…

Random Numbers with LFSR (Linear Feedback Shift Register) – Computerphile

From Computerphile. A simple bit-shift operation can generate amazing random strings of numbers. Dr Mike Pound explains then codes it in Python. If you want to know more about how XOR works: https://www.youtube.com/watch?v=VPw9vPN-3ac https://www.facebook.com/computerphile https://twitter.com/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…

Programming with Proofs – Computerphile

From Computerphile. Continuing our look at the Agda programming language, Professor Thorsten Altenkirch shows us how you can work with proofs, which could be invaluable in some industrial situations. https://www.facebook.com/computerphile https://twitter.com/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…

Hacking Out of a Network – Computerphile

From Computerphile. Multiple ways to break through restrictions in a network* demonstrated by Dr Richard G Clegg of Queen Mary University London. *Please only try these methods on machines where you have permission. Richard has kindly prepared some notes: https://bit.ly/C_RichCleg_HackOut https://www.facebook.com/computerphile https://twitter.com/computer_phile This video was filmed and edited by Sean Riley. Computer Science at the…

Eliminating Run-Time Errors with Agda – Computerphile

From Computerphile. A language designed to eliminate run-time errors? Professor Thorsten Altenkirch demonstrates programming Type Theory with Agda. https://www.facebook.com/computerphile https://twitter.com/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

The Hardest Problem in Type Theory – Computerphile

From Computerphile. Equality sounds a straightforward idea, but there are subtle problems in theoretical computer science. Professor Thorsten Altenkirch explains how his late friend Martin Hofmann solved one of the biggest problems. More of Thorsten on Type Theory: https://bit.ly/C_Thor_playlist Thorsten’s paper dedicated to Martin: https://bit.ly/C_Thor_Paper https://www.facebook.com/computerphile https://twitter.com/computer_phile This video was filmed and edited by Sean…