Algol 60 At 60 Computerphile
Algol 60 At 60 Computerphile Information Guide
Overview to Algol 60 At 60 Computerphile
Computer Scientists had to make choices for what system to use for different student use cases. Professor Brailsford on whether to ... Using T-Diagrams, Professor Brailsford shows us how to take our compiler to the next level. Previous video on t-diagrams: ... Professor Brailsford discusses Ken Thompson's ACM Turing Award acceptance paper "Reflections on Trusting Trust" Ken ... The story of recursion continues as Professor Brailsford explains one of the most difficult programs to compute: Ackermann's ... Ever wonder how quickly different programming languages can handle massive workloads? We tested one billion nested loops to ... For the past year, we've been asking this as a sound-check question. Here are the results! Professor Graham Hutton (Haskell) ...
Can there be a universal intermediate programming language? Sounds like Esperanto to us - Professor Brailsford has more. Before modern coding languages existed, a rigorous mathematical framework was created to establish the universal grammar of ... Could a computer program find Fermat's Lost Theorem? Professor Altenkirch shows us how to get started with lean. EXTRA BITS ... What's the simplest program you can write? Dr Steve Bagley on the layers of abstraction that bulk up Hello World. EXTRA BITS: ... How do huge websites keep track of the traffic numbers? Buck Shlegeris outlines the probabilistic counting algorithm 'Hyperloglog ... Virtual Backgrounds and grainy webcams - what else can we do to improve video conferencing? Dr Max Wilson on a couple of ...
Core Information
Looking at the Alderson Loop with Dr Steve Bagley. Behind the scenes on the camera rig used for this episode: ...
Latest News
Deep Dive
Data is compiled from public records and verified media reports.
Last Updated: May 21, 2026
Future Outlook
Disclaimer:
