Is true AI mathematically impossible?
Автор: UCL UG Math Colloquium
Загружено: 2026-03-03
Просмотров: 8
Описание:
Speaker: Dr. Wesley Wrigley (Centre National de la Recherche Scientifique, CNRS)
Title: “Is true AI mathematically impossible?”
Abstract: Tech companies have recently been pouring money into AI mathematics, often described as an effort to try and “solve math” using computers. But an idea has been circulating for around 75 years that true (or “strong”) AI—a computer programme that is capable of proving all the theorems that are provable by human mathematicians—is mathematically impossible. There are several arguments for this conclusion, all motivated in some way by Gödel’s incompleteness theorems, which are fundamental limitative results from mathematical logic. In this talk, I’ll introduce the incompleteness theorems, and discuss the best argument based on them for the impossibility of AI, put forward by Nobel laureate Roger Penrose.
Dr. Wesley Wrigley works in philosophy of mathematics and logic and is currently based in the Archives Henri-Poincaré, in Nancy, where he is a postdoctoral fellow with the Centre National de la Recherche Scientifique (CNRS).
Talk recorded on the 11th February 2026.
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
![STRATY, NARZEKANIA, PRZEKLEŃSTWA I MAJTKI - PODSŁUCHANE ROZMOWY ROSYJSKICH GENERAŁÓW [BOJKE]](https://imager.clipsaver.ru/UYIYwST9R4s/max.jpg)
