Saltar al contenido

Chris Budd: Did AI prove the Navier-Stokes Millennium Problem?

3 de noviembre de 2026 · 31 min

Notas del episodio

Recently, Open AI announced that one of their systems had proved one of the hardest maths problems in the world – the Navier-Stokes Millennium Problem, which comes with a million dollar reward. Naturally it has shaken the maths world, but there’s still a lot of confusion about what has actually been proved and how. To get to the bottom of it, we knew exactly who to ask: Chris Budd OBE, a Professor at the University of Bath and long-time Plus collaborator. Chris has worked on the Navier-Stokes equations and currently co-leads the Maths for Deep Learning research project and he tells us what it has been like on the mathematical/AI frontline.

This is a rapidly developing area – since recording this podcast it has been established that the Open AI result does not apply to the Navier-Stokes equations in full generality (i.e. without forcing). We are continuing to follow developments and will be sharing updates as more information is released. In fact, we will have a number of other episodes in this podcast series about AI and maths, so make sure you are following for more!

You might also like:

Maths on the Move, is the podcast from plus.maths.org. We speak to researchers from the frontiers of mathematical science so you can connect with the maths that shapes and explains our world. Hosted by Plus editors Rachel Thomas and Marianne Freiberger.

Todos los episodios de Maths on the Move

Ajustes

Visualización

Idioma

Determina qué emisoras ves primero en la página de inicio.

Historial

Las emisoras y episodios escuchados recientemente y tus últimas búsquedas solo se guardan en este navegador.

Avisos

Un breve aviso cuando un pódcast que sigues tiene un episodio nuevo. Puedes desactivar pódcast concretos con la campana de su página.

Cuenta

Guarda tus favoritos: en la app y en la web.

Atajos de teclado

/
Abrir búsqueda
Espacio
Reproducir o pausar
← →
En el reproductor: 15 s atrás, 30 s adelante (episodios) · en una fila: siguiente tarjeta
↑ ↓
En una fila: destino dentro de la tarjeta
Inicio / Fin
En una fila: primera o última tarjeta
Esc
Cerrar ventana o menú
?
Este resumen
Reproduciendo ahora

Ir a la emisora

A continuación

    Añade episodios con «A continuación»: sonarán después del episodio actual.