7 11 Proof of Linearizability

Why it's on BrighterTube

Editorial review · 85% confidence

Full-course playlist 'EdX KTHx ID2203 Reliable Distributed Algorithms' from a curated course list (EdX KTHx ID2203 Reliable Distributed Algorithms); uploader is instructor; playlist judged: Full university-level edX course on distributed algorithms uploaded by the instructor Seif Haridi, with structured lecture segments covering real technical content.; title passed a strict title check; oEmbed verified.

What you'll learn

A 16-minute video from Seif Haridi: “7 11 Proof of Linearizability”.

Programming & CS

Video by Seif Haridi, played through YouTube's embedded player.

20:38

Lecture 2. Unit 1, Formal models, state transitions, executions ID2203 Seif HaridiProgramming & CS

7:29

Lecture 4. Unit 8. Reductions (edited)Seif HaridiProgramming & CS

But what is a neural network? | Deep learning chapter 1 3Blue1BrownScience & Math

Intro25.1M views

Let's build GPT: from scratch, in code, spelled out.Andrej KarpathyProgramming & CS

8.21M views

The spelled-out intro to neural networks and backpropagation: building micrograd Andrej KarpathyProgramming & CS

Intro4.41M views

Transformers, the tech behind LLMs | Deep Learning Chapter 5 3Blue1BrownProgramming & CS

Intro11.6M views

24:26

The Beauty of Bézier Curves Freya HolmérProgramming & CS

2.23M views

2:04:55

CS50x 2024 - Lecture 0 - Scratch CS50Programming & CS

Intro2.2M views

2:27:41

CS50x 2024 - Lecture 1 - C CS50Programming & CS

Intro1.41M views

Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich ConfreaksProgramming & CS

65.7K views

“Hello, world” from scratch on a 6502 — Part 1 Ben EaterProgramming & CS

5.85M views

RailsConf 2014 - All the Little Things by Sandi Metz ConfreaksProgramming & CS

190K views

20:38

Lecture 2. Unit 1, Formal models, state transitions, executions ID2203

Seif Haridi

A 21-minute video from Seif Haridi: “Lecture 2. Unit 1, Formal models, state transitions, executions ID2203”.

7:29

Lecture 4. Unit 8. Reductions (edited)

Seif Haridi

A 7-minute video from Seif Haridi: “Lecture 4. Unit 8. Reductions (edited)”.

But what is a neural network? | Deep learning chapter 1

3Blue1Brown

Intro25.1M views

Builds up what a neural network actually is — neurons as numbers, layers, weights and biases — using handwritten-digit recognition as the running example.

Let's build GPT: from scratch, in code, spelled out.

Andrej Karpathy

8.21M views

Building a GPT-style language model from scratch in code, following 'Attention Is All You Need'.

The spelled-out intro to neural networks and backpropagation: building micrograd

Andrej Karpathy

Intro4.41M views

Building micrograd, a tiny autograd engine, to understand backpropagation completely.

Transformers, the tech behind LLMs | Deep Learning Chapter 5

3Blue1Brown

Intro11.6M views

How transformer models (the 'T' in GPT) turn text into vectors and predict the next token, step by step.

24:26

The Beauty of Bézier Curves

Freya Holmér

2.23M views

Freya Holmér builds Bézier curves from linear interpolation up, covering de Casteljau's algorithm, derivatives, arc length and their use in games and graphics.

2:04:55

CS50x 2024 - Lecture 0 - Scratch

CS50

Intro2.2M views

CS50x 2024 lecture 0: how computers represent information, algorithms, and first programs in Scratch.

2:27:41

CS50x 2024 - Lecture 1 - C

CS50

Intro1.41M views

CS50x 2024 lecture 1: an introduction to C — syntax, types, conditionals, loops and compiling.

Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich

Confreaks

65.7K views

Jim Weirich derives the Y combinator live, step by step, using nothing but Ruby lambdas, and along the way teaches the refactorings of lambda calculus.

“Hello, world” from scratch on a 6502 — Part 1

Ben Eater

5.85M views

Building a computer around the 6502 processor on a breadboard and running 'Hello, world'.

RailsConf 2014 - All the Little Things by Sandi Metz

Confreaks

190K views

Sandi Metz refactors the notorious Gilded Rose kata live, showing how small, disciplined steps and duplication-over-wrong-abstraction lead to clean object-oriented code.