Media Summary: Cracking the code was only half the battle. To keep the upper hand, when using Bill Tutte's statistical methods, the detailed ... At the heart of Bzip2 is the Burrows Wheeler Transform. Dr Steve Bagley (and a live studio audience) explains how & why it works. Functional or Combinator Parsing explained by Professor Graham Hutton. Professor Hutton's Functional Parsing Library: ...

Angle Brackets Computerphile - Detailed Analysis & Overview

Cracking the code was only half the battle. To keep the upper hand, when using Bill Tutte's statistical methods, the detailed ... At the heart of Bzip2 is the Burrows Wheeler Transform. Dr Steve Bagley (and a live studio audience) explains how & why it works. Functional or Combinator Parsing explained by Professor Graham Hutton. Professor Hutton's Functional Parsing Library: ... Mathematics once again meets Computer Science as Professor Altenkirch continues to discuss Type Theory Thanks to Lily the ... Professor Brailsford rounds up the whole Colossus affair, and explains how Turing actually played a small but significant part in ... Summing up why Hamming's error correcting codes are regarded as 'Perfect' - Professor Brailsford explains. EXTRA BITS: ...

They're called 'Finite State Automata" and occupy the centre of Chomsky's Hierarchy - Professor Brailsford explains the ultimate ... Which is faster? The results *may* just surprise you. Dr 'Heartbleed' Bagley gives us an in depth shoot-out - Arrays vs Linked Lists ... Just what are elliptic curves and why use a graph shape in cryptography? Dr Mike Pound explains. Mike's myriad Diffie-Hellman ... Could a computer program find Fermat's Lost Theorem? Professor Altenkirch shows us how to get started with lean. EXTRA BITS ... Looking at the Alderson Loop with Dr Steve Bagley. Behind the scenes on the camera rig used for this episode: ... Mobile apps almost always use a 'stop to interact' model, Dr Joe Marshall takes us through the design problems of mobile ...

Finite State Automata meets Recursion. Professor Brailsford continues the story of computers without memory. State Machines ... Matt Godbolt continues the story of the CPU and explains how machines do addition

Photo Gallery

Angle Brackets - Computerphile
Why Build Colossus? (Bill Tutte) - Computerphile
How Bzip2 Works (Burrows Wheeler Transform) - Computerphile
Functional Parsing - Computerphile
Propositions as Types - Computerphile
Turing, Tutte & Tunny - Computerphile
The Perfect Code - Computerphile
Computers Without Memory - Computerphile
Arrays vs Linked Lists - Computerphile
Elliptic Curves - Computerphile
Automated Mathematical Proofs - Computerphile
Alderson Loop - Computerphile
View Detailed Profile
Angle Brackets - Computerphile

Angle Brackets - Computerphile

Where did '

Why Build Colossus? (Bill Tutte) - Computerphile

Why Build Colossus? (Bill Tutte) - Computerphile

Cracking the code was only half the battle. To keep the upper hand, when using Bill Tutte's statistical methods, the detailed ...

How Bzip2 Works (Burrows Wheeler Transform) - Computerphile

How Bzip2 Works (Burrows Wheeler Transform) - Computerphile

At the heart of Bzip2 is the Burrows Wheeler Transform. Dr Steve Bagley (and a live studio audience) explains how & why it works.

Functional Parsing - Computerphile

Functional Parsing - Computerphile

Functional or Combinator Parsing explained by Professor Graham Hutton. Professor Hutton's Functional Parsing Library: ...

Propositions as Types - Computerphile

Propositions as Types - Computerphile

Mathematics once again meets Computer Science as Professor Altenkirch continues to discuss Type Theory Thanks to Lily the ...

Turing, Tutte & Tunny - Computerphile

Turing, Tutte & Tunny - Computerphile

Professor Brailsford rounds up the whole Colossus affair, and explains how Turing actually played a small but significant part in ...

The Perfect Code - Computerphile

The Perfect Code - Computerphile

Summing up why Hamming's error correcting codes are regarded as 'Perfect' - Professor Brailsford explains. EXTRA BITS: ...

Computers Without Memory - Computerphile

Computers Without Memory - Computerphile

They're called 'Finite State Automata" and occupy the centre of Chomsky's Hierarchy - Professor Brailsford explains the ultimate ...

Arrays vs Linked Lists - Computerphile

Arrays vs Linked Lists - Computerphile

Which is faster? The results *may* just surprise you. Dr 'Heartbleed' Bagley gives us an in depth shoot-out - Arrays vs Linked Lists ...

Elliptic Curves - Computerphile

Elliptic Curves - Computerphile

Just what are elliptic curves and why use a graph shape in cryptography? Dr Mike Pound explains. Mike's myriad Diffie-Hellman ...

Automated Mathematical Proofs - Computerphile

Automated Mathematical Proofs - Computerphile

Could a computer program find Fermat's Lost Theorem? Professor Altenkirch shows us how to get started with lean. EXTRA BITS ...

Alderson Loop - Computerphile

Alderson Loop - Computerphile

Looking at the Alderson Loop with Dr Steve Bagley. Behind the scenes on the camera rig used for this episode: ...

Mobile Interface Problems - Computerphile

Mobile Interface Problems - Computerphile

Mobile apps almost always use a 'stop to interact' model, Dr Joe Marshall takes us through the design problems of mobile ...

Same Story, Different Notation - Computerphile

Same Story, Different Notation - Computerphile

Finite State Automata meets Recursion. Professor Brailsford continues the story of computers without memory. State Machines ...

How CPUs Do Math(s) - Computerphile

How CPUs Do Math(s) - Computerphile

Matt Godbolt continues the story of the CPU and explains how machines do addition https://www.facebook.com/