Immutability Computerphile

Summary

Learn more and apply to Jane Street's WiSE program in New York, London or Hong Kong: ... Bucharest Java User Group; 18 May 2016. Original blog post is here: ... Learn this caching trick for faster code from Dr Mike Pound -- Brilliant's courses and start for free at ... The story of recursion continues as Professor Brailsford explains one of the most difficult programs to compute: Ackermann's ... Audible free book: audible.com/ The Internet is 50 - Dr Julian Onions recalls working to bring the Internet to Nottingham. facebook.com/ 50 Years since the first packet was sent from one university to another, we asked about first memories of using the Internet. Just what can you do with a quantum computer? Robert Smith of Rigetti Computing takes us through his quantum instruction set. Monads sound scary, but Professor Graham Hutton breaks down how handy they can be. They're called 'Finite State Automata" and occupy the centre of Chomsky's Hierarchy - Professor Brailsford explains the ultimate ... Just what is functional programming? We asked a member of the team that created Haskell: John Hughes, Professor of Computer ... Substitution-permutation networks are the basis for almost all modern symmetric cryptography. Dr Mike Pound explains.