Moje média
Seznam sledování
Přihlásit se

Computerphile

Řada 2020

Přidat seriál do seznamu sledování
Videos all about computers and computer stuff. Sister channel of Numberphile.

Kde se dívat na Computerphile • Řada 2020

59 dílů

  • Regular Expressions
    D1
    Regular ExpressionsProfessor Brailsford on one of our most requested topics.
  • Gaming Museum
    D2
    Gaming MuseumAtari to Zelda, the National Videogame Museum has it covered - Conor Clarke gave Computerphile a personal tour.
  • Email Endianness Problems
    D3
    Email Endianness ProblemsIn the early days the UK had its own thoughts on how email addresses should look. Dr Julian Onions was there!
  • Hello World on Sega Megadrive
    D4
    Hello World on Sega MegadriveHello World on the Sega Megadrive/Genesis - its quite an involved process to write Hello World on a machine that doesn't even have an operating system. Matt Phillips, of Big Evil Corp demostrates the 'wonky R'
  • Using Regular Expressions
    D5
    Using Regular ExpressionsProfessor Brailsford takes the theory of RegEx and puts it into practice.
  • AI Safety Gym
    D6
    AI Safety GymRob Miles discusses the idea of a gym for training AI algorithms.
  • Functional Parsing
    D7
    Functional ParsingFunctional or Combinator Parsing explained by Professor Graham Hutton.
  • Multi-Dimensional Data (as used in Tensors)
    D8
    Multi-Dimensional Data (as used in Tensors)How do computers represent multi-dimensional data? Dr Mike Pound explains the mapping.
  • Python Sudoku Solver
    D9
    Python Sudoku SolverFun comes in many forms - playing puzzles, or writing programs that solve the puzzles for you. Professor Thorsten Altenkirch on a recursive Sudoku solver.
  • How Autofocus Works
    D10
    How Autofocus WorksWhy are some cameras faster to focus than others? Dr Andy French explains the different approaches the computers inside cameras use to focus.
  • Feistel Cipher
    D11
    Feistel CipherOne of the most elegant solutions for cryptography. Dr Mike Pound explains one of his most favourite ciphers.
  • RegEx Roman Numerals
    D12
    RegEx Roman NumeralsWorking with regular expressions to decode Roman Numerals. Professor Brailsford is on the case.
  • Coding Trees in Python
    D13
    Coding Trees in PythonFor Mathematics, trees are more useful than strings. Professor Thorsten Altenkirch takes us through a functional approach to coding them in Python.
  • Nintendo NES FamiCom Creator
    D14
    Nintendo NES FamiCom CreatorBring Donkey Kong home! - The unenviable task given to Masayuki Uemura by Nintendo bosses in the early '80s. Unimpressed by Atari's 2600 they set out to bring a true videogame arcade experience into the home.
  • 128 Bit or 256 Bit Encryption?
    D15
    128 Bit or 256 Bit Encryption?What do the various levels of encryption mean, and why use one over another? Dr Mike Pound takes us through the cryptic world of encryption levels.
  • Why My Computer Wants to Forget (How Dynamic Memory Works)
    D16
    Why My Computer Wants to Forget (How Dynamic Memory Works)To save silicon, RAM is built to forget. Dr Steve Bagley explains how dynamic memory saves on space but at a cost.
  • VPN & Remote Working
    D17
    VPN & Remote WorkingAs we move towards a remote working culture, Dr Steve Bagley remotely connects to explain what VPN is & how it works.
  • Curried Functions
    D18
    Curried FunctionsIt's all about the input. You can't always give all a function's inputs at the same time. Professor Graham Hutton explains about curried functions.
  • Taming Kerberos
    D19
    Taming KerberosKerberos is an authentication method - Dr Mike Pound explains how it works so neatly.
  • TCP Meltdown
    D20
    TCP MeltdownWhy it's a bad idea to build a Virtual Private Network using TCP. Dr Steve Bagley on TCP over TCP...
  • 50 Years of Computer Science: Professor Brailsford Q&A
    D21
    50 Years of Computer Science: Professor Brailsford Q&A
  • Contact Tracing Technology
    D22
    Contact Tracing TechnologyAs we contemplate life after lock-down, what technology could help the health services to work out how viruses can spread? Dr Mike Pound & Dr Steve Bagley chat to Sean.
  • The Joys of Updating & Upgrading
    D23
    The Joys of Updating & UpgradingProfessor Brailsford on why he's updating his OS and Hardware while in isolation (with remote support from Dr Bagley)
  • The Video Conferencing Problem
    D24
    The Video Conferencing ProblemZoom, House Party, Teams, Skype or whatever. Dr Steve Bagley on the trade-offs all platforms must balance to keep you connected.
  • Modes of Operation
    D25
    Modes of OperationYou don't just 'run a cipher' - you need a mode of operation. Dr Mike Pound explains some relative to the Feistel cipher.
  • Tail Recursion Explained
    D26
    Tail Recursion ExplainedImprove the efficiency of recursive code by re-writing it to be tail recursive. Professor Graham Hutton explains.
  • ALGOL 60 at 60
    D27
    ALGOL 60 at 60ALGOL 60, a brand new programming language, 60 years ago! Professor Brailsford used to have to teach it - here he shows us some of the code.
  • Pong, Python & Pygame 00
    D28
    Pong, Python & Pygame 00In this mini-series, Dr Isaac Triguero walks us through creating a simple Pong-like game in Python, using the PyGame library.
  • Pong, Python & PyGame 01
    D29
    Pong, Python & PyGame 01The second part of Dr Isaac Triguero's walkthrough of creating a Pong-like game in Python, using PyGame.
  • Pong, Python & Pygame 10
    D30
    Pong, Python & Pygame 10Squash-Pong needs a ball and a paddle - Dr Isaac Triguero continues the PyGame mini-series.
  • Pong, Python & PyGame 11
    D31
    Pong, Python & PyGame 11Taking the Squash Pong game and using data science to make it AI powered! Dr Isaac Triguero uses regression & nearest neighbour.
  • Slopes of Machine Learning
    D32
    Slopes of Machine LearningCoding Partial Derivatives in Python is a good way to understand what Machine Learning "secret sauce" has to do. Professor Thorsten Altenkirch explains what it means, and then demos in Python.
  • GPT3: An Even Bigger Language Model
    D33
    GPT3: An Even Bigger Language ModelBasic mathematics from a language model? Rob Miles on GPT3, where it seems like size does matter!
  • How DNS Works
    D34
    How DNS WorksHow do websites marry up to their IP addresses? Dr Mike Pound explains the Domain Name System - DNS.
  • How eBooks Work
    D35
    How eBooks WorkWhat's in an eBook file? Dr Steve Bagley delves inside 'Beautiful Code' to find out. As we used "Beautiful Code" as our example, here's a link to the publish...
  • DNS Cache Poisoning
    D36
    DNS Cache Poisoning
  • "Real" Programmers & Drum Memory
    D37
    "Real" Programmers & Drum MemoryDiscussing "Real" Programmers from the early days of computing with Dr Julian Onions.
  • Mike Pound Q&A
    D38
    Mike Pound Q&AWe put some of your questions to Dr Mike Pound.
  • Pascal (Not Just Nickel & Dime)
    D39
    Pascal (Not Just Nickel & Dime)Pascal evolved from Algol 60. Professor Brailsford discusses the rift in the Algol committee that lead to its creation.
  • What NOT to do: Self Modifying Code
    D40
    What NOT to do: Self Modifying CodeHow 'not to code' with our "real" programmer - who, as Julian explains, is demoing what NOT to do. Dr Julian Onions tells us more about Mel.
  • Laziness in Python
    D41
    Laziness in PythonLaziness is a virtue - well, in programming anyway! Professor Thorsten Altenkirch on how you can use the 'yield' to compute certain things "on demand"
  • 1111111111111111111111111111111 & Unix Epoch
    D42
    1111111111111111111111111111111 & Unix EpochThe highest signed 32bit integer is a ticking timebomb - sort of... Dr Tim Muller explains why it's his #MegaFavNumber
  • Brain-Like (Neuromorphic) Computing
    D43
    Brain-Like (Neuromorphic) ComputingMemristors, Artificial Synapses & Neomorphic Computing. Dr Phil Moriarty on the limitations of the Von Neumann architecture and what could be next.
  • Enhancing Video Conferencing
    D44
    Enhancing Video ConferencingVirtual Backgrounds and grainy webcams - what else can we do to improve video conferencing? Dr Max Wilson on a couple of innovations you can try today.
  • ALGOL 68 Instead of Pascal?
    D45
    ALGOL 68 Instead of Pascal?Computer Scientists had to make choices for what system to use for different student use cases. Professor Brailsford on whether to choose Algol 68 or Pascal. Or both.
  • The Knapsack Problem & Genetic Algorithms
    D46
    The Knapsack Problem & Genetic AlgorithmsTournament selection, roulette selection, mutation, crossover - all processes used in genetic algorithms. Dr Alex Turner explains using the Knapsack Problem.
  • Story of Mel
    D47
    Story of MelBreaking the unbreakable loop. More on how self-modifying code can be a neat hack, that's almost unmaintainable. Dr Julian Onions recalls the "Real Programmer" story that circulated in the early '80s.
  • Facebook's Code Checker
    D48
    Facebook's Code CheckerMillions of lines of code - how do you keep them bug free? Facebook's Professor Peter O'Hearn talks us through "Infer" their code checker which dallies with the idea of undecidability.
  • Transport Layer Security (TLS)
    D49
    Transport Layer Security (TLS)It's absolutely everywhere, but what is TLS and where did it come from? Dr Mike Pound explains the background behind this ubiquitous Internet security protocol.
  • The First Internet Worm (Morris Worm)
    D50
    The First Internet Worm (Morris Worm)In November 1988 the first worm caused huge problems on the Internet. Dr Julian Onions remembers the story.
  • TLS Handshake Explained
    D51
    TLS Handshake ExplainedHow does your computer arrange with a server to start talking in code? Dr Mike Pound explains the TLS handshake where the server and client organise everything.
  • Random Boolean Networks
    D52
    Random Boolean NetworksDemonstrating how complex systems can arise from simple rules, random boolean networks also have some surprising properties... sometimes! Dr Alex Turner generates some.
  • Distance Vector Algorithm (Bellman Ford)
    D53
    Distance Vector Algorithm (Bellman Ford)Underpinning the Internet are countless network routers - how do they work out the route to send your data along? Dr Richard G Clegg of Queen Mary University London explains the Bellman Ford distance vector algorithm.
  • Program Correctness
    D54
    Program CorrectnessProgram Correctness is incredibly important in computing - particularly in hardware design. Professor Graham Hutton takes us through a simple example using arithmetic.
  • RWALL (Remote Write to All)
    D55
    RWALL (Remote Write to All)When Sun added network abilities to a messaging feature, one user managed to contact more people than he'd bargained for. Dr Julian Onions takes us through the rwall incident of 1987.
  • What are Digital Signatures?
    D56
    What are Digital Signatures?How do you verify that someone is who they say they are? Dr Mike Pound on digital signatures.
  • Brute Forcing The Countdown Numbers Game
    D57
    Brute Forcing The Countdown Numbers GameBillions of possibilities - Dr Alex Turner borrowed some cluster time to obtain all of the potential results from all the possible games of Countdown's Numbers Game.
  • How the Computer Mouse Works
    D58
    How the Computer Mouse WorksUsed by millions every day we're dissecting mice today. Dr Steve Bagley takes us through the workings, starting with a ball-powered rodent.
  • ALOHAnet: Grandfather of All Computer Networks
    D59
    ALOHAnet: Grandfather of All Computer NetworksHow do you share a 1960's computer across a bunch of islands? Wireless networking of course - although, like Norman Abramson & his team, you'd have to invent it first. Dr Steve Bagley on Hawaii's Aloha Net.

Get Plex on Your Devices

Free on 20+ platforms. Pick yours.
App StoreiOS & Apple TV
Google PlayAndroid
TVFire TV, Roku & more
See all supported devices →

Get Plex on Your Devices

Free on 20+ platforms. Pick yours.
App StoreiOS & Apple TV
Google PlayAndroid
TVFire TV, Roku & more
See all supported devices →