Menu
Sign In Search Podcasts Charts People & Topics Add Podcast API Pricing

Terence Tao

๐Ÿ‘ค Speaker
2047 total appearances

Appearances Over Time

Podcast Appearances

Lex Fridman Podcast
#472 โ€“ Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI

A good example of this is that there's this old theorem in mathematics called Szemeredi's theorem, proven in the 1970s.

Lex Fridman Podcast
#472 โ€“ Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI

It concerns trying to find a certain type of pattern in a set of numbers that the patterns have made progression.

Lex Fridman Podcast
#472 โ€“ Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI

Things like 3, 5, and 7, or 10, 15, and 20.

Lex Fridman Podcast
#472 โ€“ Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI

And Andrea Zamorelli proved that any set of numbers that are sufficiently big, what's called positive density, has arithmetic progressions in it of any length you wish.

Lex Fridman Podcast
#472 โ€“ Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI

So, for example, the odd numbers have a density of one-half,

Lex Fridman Podcast
#472 โ€“ Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI

and they contain rhythmic progressions of any length.

Lex Fridman Podcast
#472 โ€“ Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI

So in that case, it's obvious because the odd numbers are really, really structured.

Lex Fridman Podcast
#472 โ€“ Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI

I can just take 11, 13, 15, 17.

Lex Fridman Podcast
#472 โ€“ Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI

I can easily find rhythmic progressions in that set.

Lex Fridman Podcast
#472 โ€“ Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI

But Zermattislim also applies to random sets.

Lex Fridman Podcast
#472 โ€“ Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI

If I take the set of odd numbers and I flip a coin for each number, and I only keep

Lex Fridman Podcast
#472 โ€“ Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI

the numbers which for which i got a heads okay so i just flip coins i just randomly take out half the numbers i keep one half so that's a set that has no no patterns at all but just from random fluctuations you will still get a lot of um of ethnic progressions in that set can you prove that there's arithmetic progressions of arbitrary length within a random yes um have you heard of the infinite monkey theorem

Lex Fridman Podcast
#472 โ€“ Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI

Usually, mathematicians give boring names to theorems, but occasionally they give colorful names.

Lex Fridman Podcast
#472 โ€“ Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI

The popular version of the infinite monkey theorem is that if you have an infinite number of monkeys in a room with each typewriter, they type out text randomly, almost surely one of them is going to generate the entire square root of Hamlet, or any other finite string of text.

Lex Fridman Podcast
#472 โ€“ Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI

It will just take some time, quite a lot of time, actually.

Lex Fridman Podcast
#472 โ€“ Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI

But if you have an infinite number, then it happens.

Lex Fridman Podcast
#472 โ€“ Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI

So basically the thing is that if you take an infinite string of digits or whatever, eventually any finite pattern you wish will emerge.

Lex Fridman Podcast
#472 โ€“ Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI

It may take a long time, but it will eventually happen.

Lex Fridman Podcast
#472 โ€“ Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI

In particular, ethnic progressions of any length will eventually happen

Lex Fridman Podcast
#472 โ€“ Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI

Okay, but you need an extremely long random sequence for this to happen.