Immutability Computerphile

Summary

The story of recursion continues as Professor Brailsford explains one of the most difficult programs to compute: Ackermann's ... They're called 'Finite State Automata" and occupy the centre of Chomsky's Hierarchy - Professor Brailsford explains the ultimate ... Just what can you do with a quantum computer? Robert Smith of Rigetti Computing takes us through his quantum instruction set. Learn this caching trick for faster code from Dr Mike Pound -- Brilliant's courses and start for free at ... Substitution-permutation networks are the basis for almost all modern symmetric cryptography. Dr Mike Pound explains. What was the first undecidable problem? Professor Brailsford takes us on a Bucharest Java User Group; 18 May 2016. Original blog post is here: ... What do the various levels of encryption mean, and why use one over another? Dr Mike Pound takes us through the cryptic world ... Monads sound scary, but Professor Graham Hutton breaks down how handy they can be. 50 Years since the first packet was sent from one university to another, we asked about first memories of using the Internet. 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 ... Was the Y2K bug a complete non-event? Dr Steve Bagley on why it was 'a thing' and how it was worked around. Advanced ... Could a computer program find Fermat's Lost Theorem? Professor Altenkirch shows us how to get started with lean. EXTRA BITS ...