ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

2,864 results

Computerphile
Network Basics - Transport Layer and User Datagram Protocol Explained - Computerphile

Breaking the network layer model into pieces, starting top-down, Richard G Clegg of Queen Mary University London explains the ...

15:21
Network Basics - Transport Layer and User Datagram Protocol Explained - Computerphile

15,151 views

21 hours ago

Computerphile
Generative AI's Greatest Flaw - Computerphile

Described as GenAIs greatest flaw, indirect prompt injection is a big problem, Mike Pound from University of Nottingham explains ...

12:23
Generative AI's Greatest Flaw - Computerphile

581,411 views

11 months ago

Computerphile
The Problem with A.I. Slop! - Computerphile

Researchers suggested there's more AI generated content appearing on the web than human generated content - Mike Pound ...

14:58
The Problem with A.I. Slop! - Computerphile

598,589 views

2 months ago

Computerphile
Generating 3D Models with Diffusion - Computerphile

When the 3D dataset is too small to create models of frogs on stilts we have to think of a different way - Lewis Stuart is based at the ...

16:17
Generating 3D Models with Diffusion - Computerphile

28,018 views

7 days ago

Computerphile
Memory Mapping - Computerphile

Huge memory addresses mean that not every address is valid. Matt Godbolt explains how the addresses are actually used.

26:14
Memory Mapping - Computerphile

76,383 views

6 months ago

Computerphile
HyperLogLog Hit Counter - Computerphile

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

4:20
HyperLogLog Hit Counter - Computerphile

29,993 views

4 months ago

Computerphile
'Forbidden' AI Technique - Computerphile

The so-called 'Forbidden Technique' with Chana Messinger -- Check out Brilliant's courses and start for free at ...

9:49
'Forbidden' AI Technique - Computerphile

228,139 views

8 months ago

Computerphile
Implementing Passkeys in Practice - Computerphile

Build your own passkey system like Mike! -- Check out Brilliant for free at https://brilliant.org/computerphile/ (30-day free trial and ...

14:53
Implementing Passkeys in Practice - Computerphile

85,795 views

2 weeks ago

Computerphile
The Next Big SHA? SHA3 Sponge Function Explained - Computerphile

Learn more about the Jane Street internship at https://jane-st.co/internship-computerphile-25 If a bug is found in SHA2, SHA3 is ...

27:37
The Next Big SHA? SHA3 Sponge Function Explained - Computerphile

155,251 views

5 months ago

Computerphile
What is CUDA? - Computerphile

What is CUDA and why do we need it? An Nvidia invention, its used in many aspects of parallel computing. We spoke to Stephen ...

11:41
What is CUDA? - Computerphile

478,883 views

9 months ago

Computerphile
How Passkeys Work - Computerphile

Passkey pop up everywhere, Mike Pound explains what they are! Check out Brilliant's courses and start for free at ...

19:07
How Passkeys Work - Computerphile

390,174 views

1 month ago

Computerphile
Super Intelligence Speculation - Computerphile

Looking to the future, just how intelligent might the current crop of Large Language Models get? Daniel Kokotajlo joins us to ...

32:43
Super Intelligence Speculation - Computerphile

160,624 views

7 months ago

Computerphile
Network Layers Model (Networking Basics) - Computerphile

"The best-laid plans of mice and men often go awry" - as the ISO team were designing a beautiful, structured layered model, ...

12:54
Network Layers Model (Networking Basics) - Computerphile

69,998 views

3 months ago

Computerphile
Sleeper Agents in Large Language Models - Computerphile

It's an older paper, but it checks out. Rob Miles discusses the problem of 'Sleeper Agents' - where LLMs could have hidden traits ...

13:38
Sleeper Agents in Large Language Models - Computerphile

271,919 views

4 months ago

Computerphile
LLMs and Newcomb's Problem - Computerphile

Newcomb's Problem is a thought experiment which, on the surface, seems obvious, but what if you're trying it out on your identical ...

18:32
LLMs and Newcomb's Problem - Computerphile

77,458 views

3 weeks ago

Computerphile
Hash Collisions & The Birthday Paradox - Computerphile

Mike Pound discusses hash collisions & the birthday paradox -- Learn more and apply to Jane Street's WiSE program in New York ...

14:21
Hash Collisions & The Birthday Paradox - Computerphile

226,091 views

8 months ago

Computerphile
What is Bootstrapping Anyway? - Computerphile

Where does it all start? How is it was say "C is written in C" - Matt Godbolt breaks it down by building it up! Find out more about ...

20:34
What is Bootstrapping Anyway? - Computerphile

163,691 views

4 months ago

Computerphile
How Ethernet Sends Data - Computerphile

How the data flowing through your cables is organised with Matt Godbolt -- See Jane Street's training programs in New York, ...

21:31
How Ethernet Sends Data - Computerphile

68,503 views

2 months ago

Computerphile
Monte Carlo Tree Search - Computerphile

Automating decision processes continued as Professort Nick Hawes of Oxford Robotics Institute explains how Monte Carlo Tree ...

32:55
Monte Carlo Tree Search - Computerphile

77,181 views

8 months ago

Computerphile
SHA2 Fatal Flaw? (Hash Length Extension Attack) - Computerphile

SHA2's weakness explained by Dr Mike Pound -- Check out Brilliant's courses and start for free at ...

12:24
SHA2 Fatal Flaw? (Hash Length Extension Attack) - Computerphile

117,174 views

4 months ago