Computerphile Historic Lecture Catalogue

Since 2013 the University of Nottingham has been quietly beavering away at creating a series of short videos on the subject of Computer Science. Many of these presentations have been given by Professor David Brailsford who has a particular interest in the history of computing and in text processing and presentation. Here we present a catalogue of Prof. Brailsford’s lectures (in reverse chronological order) many of which will be of interest to CCS members.

David Brailsford is an engaging speaker with a particular gift for explaining the tale behind matters which many of us may take for granted without perhaps having a full appreciation of the back story.

David Brailsford is an engaging speaker with a particular gift for explaining the tale behind matters which many of us may take for granted without perhaps having a full appreciation of the back story.

Members may be especially interested in the presentations of Nottingham’s Honorary Professor Brian Kernigan, justly famous for his pioneering work on the Unix operating system and the C programming language. For your convenience we have created a duplicate index of these presentations at bwk.htm.

Recommended!

- Porting Compilers
- Improving Intermediate Codes
- The UNCOL Problem
- ‘Accidental’ CrossCompiler
- Before Raspberry Pi and Arduino
- Self Compiling Compilers
- Bootstrapping with T-Diagrams
- Reed Solomon Encoding
- X & the Book Code
- Error Correction & International Book Codes
- Turing, Tutte and Tunny
- Why Build Colossus?
- Exploiting the Tiltman Break - Computerphile
- Where GREP Came From - Brian Kernighan
- EXTRA BITS: Double Dabble 42
- Double Dabble
- 42 and Binary Coded Decimal
- Hello World (Assemblers Considered Harmful?!)
- IBM, EBCDIC & A Meg-In-A-Box
- Where did Bytes Come From?
- GOTO, Goto & Goto
- Initial Orders II
- EDSAC Simulator
- Von Neumann Architecture
- Wheeler Jump
- EXTRA BITS: Loops, Ackermann & Recursion
- Programming Loops vs Recursion
- EXTRA BITS: The Triple Ref Code
- Triple Ref Pointers
- Why C is so Influential
- Essentials: Pointer Power!
- EXTRA BITS: Reed Muller Program
- Reed-Muller Code (64 Shades of Grey pt2)
- 64 Shades of Martian Grey
- EXTRA BITS: More on Perfect Codes
- The Perfect Code
- Correcting Those Errors
- Multiple Dimension Error Correction
- Implementation
- Computer Science’s Wonder Woman: Ada Lovelace
- Babbage’s Mechanical Notation Puzzle
- Babbage’s Analytical Engine
- PDF Workflow
- PDF, What is it FOR?
- Unrolling the Loops
- Turing Complete
- EXTRA BITS — Haskell Example
- HTML IS a Programming Language (Imperative vs Declarative)
- Where HTML beats C?
- EXTRA BITS: SGML HTML XML
- HTML: Poison or Panacea?
- Problems with Omitted End Tags
- SGML HTML XML What’s the Difference?
- Same Story, Different Notation
- Angle Brackets
- Computers Without Memory
- Chomsky Hierarchy
- EXTRA BITS — Why Binary?
- Why Use Binary?
- TLU Three Letter Username Obsession
- UNIX Special: Profs Kernighan & Brailsford
- Zig Zag Decryption
- Fishy Codes: Bletchley’s Other Secret
- Colossus & Bletchley Park
- 5 Hole Paper Tape
- XOR Easter Egg
- XOR & the Half Adder
- AND OR NOT — Logic Gates Explained
- The Turing Test
- Binary: Plusses & Minuses (Why We Use Two’s Complement)
- Binary Addition & Overflow
- Enigma, TypeX and Dad
- EXTRA BITS — Secret Banburismus Anecdote
- Tackling Enigma (Turing’s Enigma Problem Part 2)
- Turing’s Enigma Problem (Part 1)
- Turing Meets Paradoxes (History of Undecidability Part 3)
- Barber & Russell Paradoxes (History of Undecidability Part 2)
- Undecidability Tangent (History of Undecidability Part 1)
- Turing Machine Primer
- Busy Beaver Turing Machines
- Ackermann Follow Up
- The Most Difficult Program to Compute?
- Fibonacci Programming
- Reverse Polish Grows on Trees
- EXTRA BITS: Recursion and the Stack
- What on Earth is Recursion?
- Reverse Polish Notation and The Stack
- The Dawn of Desktop Publishing
- EXTRA BITS — More on the Original Mac at 30
- The Little Mac with the Big Bite
- The Font Magicians
- Typesetters in the ’80s
- EXTRA BITS — Printing and Typesetting History
- The Great 202 Jailbreak
- EXTRA BITS — Text Compression Meets Probabilities
- Elegant Compression in Text (The LZ 77 Method)
- EXTRA BITS/TRITS — Huffman Trees
- How Huffman Trees Work
- Error Correction
- EXTRA BITS — Behind the scenes on Computerphile
- EXTRA BITS — More about Punch Cards
- Punch Card Programming
- Error Detection and Flipping the Bits
- Mainframes and the Unix Revolution
- Entropy in Compression
- Compression
- Near to the Metal