Media Summary: Finite State Automata meets Recursion. Professor Brailsford continues the Why some numbers just dont work when you're creating error proof codes. Professor Brailsford continues with the Summing up why Hamming's error correcting codes are regarded as 'Perfect' - Professor Brailsford explains. EXTRA BITS: ...
Same Story Different Notation Computerphile - Detailed Analysis & Overview
Finite State Automata meets Recursion. Professor Brailsford continues the Why some numbers just dont work when you're creating error proof codes. Professor Brailsford continues with the Summing up why Hamming's error correcting codes are regarded as 'Perfect' - Professor Brailsford explains. EXTRA BITS: ... Which is faster? The results *may* just surprise you. Dr 'Heartbleed' Bagley gives us an in depth shoot-out - Arrays vs Linked Lists ... They're called 'Finite State Automata" and occupy the centre of Chomsky's Hierarchy - Professor Brailsford explains the ultimate ... SGML 'theologians' were at war with Internet browser 'pragmatists' after Sir Tim Berners-Lee released HTML on the world.
Using Hello World to show how assemblers keep track of memory - but at the expense of two passes through the computer. Negative Binary Numbers - you may have heard of 'signed' numbers, but do you know how they work? Professor Brailsford ... Ada Lovelace became known as the world's first computer programmer - Professor Brailsford on how being poet Byron's daughter ... Why do we have 8 bits in a byte? Professor Brailsford on the origins of the humble byte. Why Use Binary? Discussing the challenges of dealing with code from the COBOL era that's still needed! - Dr Kevin Lano Reader in Software ... The sights and sounds of sorting! - Alex takes inspiration from our BBC microcomputer film and combines BASIC programming ...
Surely decimal numbers are easier to understand than binary? So why don't computers use them? Professor Brailsford explains ...
