Cal Newport

We usually on Thursdays have AI reality checks.

I'm going to be on the road, so maybe we'll see.

So don't be surprised if there's not one this week.

But we'll be back with an advice episode next Monday.

Hey, sign up for my newsletter, calnewport.com, if you want my dispatches

From this fight for depth versus distraction, it's my thoughts on the fly of things I'm thinking about.

So if you really want the most up-to-date view of new thoughts I'm having about this fight for depth and distractions, calnewport.com for that newsletter.

Buy Slow Productivity.

It was the star of today's show.

If you haven't read this book, you need to because I talk about it all the time.

It's the source language.

You buy that book and you have it.

All right, that's it.

See you next week.

And as always, stay deep.

Last week, OpenAI published a press release titled, An OpenAI Model Has Disproved a Central Conjecture in Discrete Geometry.

They were talking specifically about the planar unit distance problem, which was first posed by Paul Erdos in 1946.

Now this is actually a pretty simple problem to state.

It basically says,

What is the maximum number of pairs of points in a set of endpoints in a flat plane that can be exactly one unit of distance apart?