Media Summary: Computer Scientists had to make choices for what system to use for different student use cases. Professor Brailsford on whether to ... Professor Brailsford discusses Ken Thompson's ACM Turing Award acceptance paper "Reflections on Trusting Trust" Ken ... Just how far can we go with processing speed? Physicist Professor Phil Moriarty talks about the hard limits of computing.

Algol 60 At 60 Computerphile - Detailed Analysis & Overview

Computer Scientists had to make choices for what system to use for different student use cases. Professor Brailsford on whether to ... Professor Brailsford discusses Ken Thompson's ACM Turing Award acceptance paper "Reflections on Trusting Trust" Ken ... Just how far can we go with processing speed? Physicist Professor Phil Moriarty talks about the hard limits of computing. Using T-Diagrams, Professor Brailsford shows us how to take our compiler to the next level. Previous video on t-diagrams: ... Knuth talked about "Literate Programming" over forty years ago, but what does it mean to have code that a developer and a client ... Can there be a universal intermediate programming language? Sounds like Esperanto to us - Professor Brailsford has more.

B is the forerunner to C - but seemed lost - Angelo Papenhoff decided to change it and brought it back from the brink! Here he tries ... Could a computer program find Fermat's Lost Theorem? Professor Altenkirch shows us how to get started with lean. EXTRA BITS ... For the past year, we've been asking this as a sound-check question. Here are the results! Professor Graham Hutton (Haskell) ... The original version of text messaging had a flaw, but how can we investigate problems with software quickly and easily? What's the simplest program you can write? Dr Steve Bagley on the layers of abstraction that bulk up Hello World. EXTRA BITS: ... Matt Godbolt continues the story of the CPU and explains how machines do addition

The story of recursion continues as Professor Brailsford explains one of the most difficult programs to compute: Ackermann's ... How do huge websites keep track of the traffic numbers? Buck Shlegeris outlines the probabilistic counting algorithm 'Hyperloglog ... Virtual Backgrounds and grainy webcams - what else can we do to improve video conferencing? Dr Max Wilson on a couple of ...

Photo Gallery

ALGOL 60 at 60 - Computerphile
ALGOL 68 Instead of Pascal? - Computerphile
Pascal (Not Just Nickel & Dime) - Computerphile
Reflections on Trusting Trust - Computerphile
What's Your Least Favourite Programming Language? (2024 soundcheck question) - Computerphile
Computing Limit - Computerphile
Self Compiling Compilers - Computerphile
Human Readable Code - Computerphile
The UNCOL Problem - Computerphile
Internationalis(z)ing Code - Computerphile
Original Hello World in "B" Programming Language - Computerphile
Automated Mathematical Proofs - Computerphile
View Detailed Profile
ALGOL 60 at 60 - Computerphile

ALGOL 60 at 60 - Computerphile

ALGOL 60

ALGOL 68 Instead of Pascal? - Computerphile

ALGOL 68 Instead of Pascal? - Computerphile

Computer Scientists had to make choices for what system to use for different student use cases. Professor Brailsford on whether to ...

Pascal (Not Just Nickel & Dime) - Computerphile

Pascal (Not Just Nickel & Dime) - Computerphile

Pascal evolved from

Reflections on Trusting Trust - Computerphile

Reflections on Trusting Trust - Computerphile

Professor Brailsford discusses Ken Thompson's ACM Turing Award acceptance paper "Reflections on Trusting Trust" Ken ...

What's Your Least Favourite Programming Language? (2024 soundcheck question) - Computerphile

What's Your Least Favourite Programming Language? (2024 soundcheck question) - Computerphile

Computerphile

Computing Limit - Computerphile

Computing Limit - Computerphile

Just how far can we go with processing speed? Physicist Professor Phil Moriarty talks about the hard limits of computing.

Self Compiling Compilers - Computerphile

Self Compiling Compilers - Computerphile

Using T-Diagrams, Professor Brailsford shows us how to take our compiler to the next level. Previous video on t-diagrams: ...

Human Readable Code - Computerphile

Human Readable Code - Computerphile

Knuth talked about "Literate Programming" over forty years ago, but what does it mean to have code that a developer and a client ...

The UNCOL Problem - Computerphile

The UNCOL Problem - Computerphile

Can there be a universal intermediate programming language? Sounds like Esperanto to us - Professor Brailsford has more.

Internationalis(z)ing Code - Computerphile

Internationalis(z)ing Code - Computerphile

Audible free book: http://www.audible.com/

Original Hello World in "B" Programming Language - Computerphile

Original Hello World in "B" Programming Language - Computerphile

B is the forerunner to C - but seemed lost - Angelo Papenhoff decided to change it and brought it back from the brink! Here he tries ...

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 ...

What's your Favourite Programming Language? (sound check Q) - Computerphile

What's your Favourite Programming Language? (sound check Q) - Computerphile

For the past year, we've been asking this as a sound-check question. Here are the results! Professor Graham Hutton (Haskell) ...

Code Checking Automation - Computerphile

Code Checking Automation - Computerphile

The original version of text messaging had a flaw, but how can we investigate problems with software quickly and easily?

Hello (World) Abstraction! - Computerphile

Hello (World) Abstraction! - Computerphile

What's the simplest program you can write? Dr Steve Bagley on the layers of abstraction that bulk up Hello World. EXTRA BITS: ...

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/

The Most Difficult Program to Compute? - Computerphile

The Most Difficult Program to Compute? - Computerphile

The story of recursion continues as Professor Brailsford explains one of the most difficult programs to compute: Ackermann's ...

HyperLogLog Hit Counter - Computerphile

HyperLogLog Hit Counter - Computerphile

How do huge websites keep track of the traffic numbers? Buck Shlegeris outlines the probabilistic counting algorithm 'Hyperloglog ...

Enhancing Video Conferencing - Computerphile

Enhancing Video Conferencing - Computerphile

Virtual Backgrounds and grainy webcams - what else can we do to improve video conferencing? Dr Max Wilson on a couple of ...