Immutability Computerphile

Summary

Learn more and apply to Jane Street's WiSE program in New York, London or Hong Kong: ... The story of recursion continues as Professor Brailsford explains one of the most difficult programs to compute: Ackermann's ... Learn this caching trick for faster code from Dr Mike Pound -- Brilliant's courses and start for free at ... Prepping for Post-Quantum, Mike Pound explains why now! -- Try Jane Street's neural net puzzle: ... We see objects all the time and our brains decode the 3D shapes, but how do computers model these shapes and why break it all ... When two threads or processes clash, a race condition can occur. Matt Godbolt demonstrates different kinds of race conditions by ... Could a computer program find Fermat's Lost Theorem? Professor Altenkirch shows us how to get started with lean. EXTRA BITS ... Audible free book: audible.com/ Just what can you do with a quantum computer? Robert Smith of Rigetti Computing takes us through his quantum instruction set. Many will have heard the phrase 'Mythical Man Month' and assume it's simply about whether manpower and time are ... They're called 'Finite State Automata" and occupy the centre of Chomsky's Hierarchy - Professor Brailsford explains the ultimate ... Apple's latest M1 chip is two older chips bolted together, Dr. Steve Bagley explains how they made it work the same as a single ... Why can't floating point do money? It's a brilliant solution for speed of calculations in the computer, but how and why does moving ... Substitution-permutation networks are the basis for almost all modern symmetric cryptography. Dr Mike Pound explains.