Computing Limit Computerphile

Summary

Just how far can we go with processing speed? Physicist Professor Phil Moriarty talks about the hard Network Basics story continues with the second part of the TCP segment. Richard G Clegg is based at Queen Mary University ... The story of recursion continues as Professor Brailsford explains one of the most difficult programs to Why can't floating point do money? It's a brilliant solution for speed of calculations in the How programmers found ways to push the hardware past its design Bug Byte puzzle here - bit.ly/4bnlcb9 - and apply to Jane Street programs here - bit.ly/3JdtFBZ (episode sponsor). A web app that works out how many seconds ago something happened. How hard can coding that be? Tom Scott explains how ... Just what can you do with a quantum No need to understand Turing machines to comprehend the halting problem. Professor Thorsten Altenkirch has a way of using ... Governments can censor access to the web, but how do they Turing Machines are the basis of modern They're called 'Finite State Automata" and occupy the centre of Chomsky's Hierarchy - Professor Brailsford explains the ultimate ... Peforming operations in parallel on big data. Rebecca Tickle explains MapReduce. facebook.com/ Big Data sounds a buzz word, and is hard to quantify, but the problems with large data sets are very real. Dr Isaac Triguero ... Which is faster? The results *may* just surprise you. Dr 'Heartbleed' Bagley gives us an in depth shoot-out - Arrays vs Linked Lists ...