Nov 28, 2018   11:00 AM — 12:00 PM

Lê Nguyên Hoang École Polytechnique Fédérale de Lausanne (EPFL), Switzerland

In the 1960s, computer scientist Ray Solomonoff introduced a universal approach to knowledge, based on a combination of probability theory and theoretical computer science. This approach can be argued to be the ultimate solution to artificial general intelligence. Indeed, Solomonoff proved that it was complete. Unfortunately though, it is also uncomputable. Intriguingly, Solomonoff also proved that completeness and computability were incompatible properties. The talk will be revisiting Solomonoff’s reasoning.

Free entrance.
Welcome to everyone!

Georges Zaccour organizer


Room 4488
André-Aisenstadt Building
Université de Montréal Campus
2920, chemin de la Tour
Montréal QC H3T 1J4

Associated organizations

Research Axis