Marcus Hutter: Universal Artificial Intelligence, AIXI, and AGI | Lex Fridman Podcast #75
Lex Fridman1 HN recommenders · 2020–2025
126K views · interview · evergreen · Uploaded 2020-02-26
Lex Fridman interviews Marcus Hutter of DeepMind about universal artificial intelligence, AIXI, Kolmogorov complexity, Solomonoff induction and the idea of intelligence as compression.
Referenced as an accessible explanation of Kolmogorov complexity and Hutter's view of intelligence as compression.
19:42But what is the Fourier Transform? A visual introduction.
3Blue1Brown
23:53D/A and A/D | Digital Show and Tell (Monty Montgomery @ xiph.org)
FL Studio
1:00:43Jim Simons (full length interview) - Numberphile
Numberphile2
14:34Steve Jobs Stanford Commencement Speech 2005
JoshuaG
15:01What Happened to Horses Is Happening to Us
CGP Grey
1:07:26Alan Kay - Normal Considered Harmful
powerfuloutlet
53:31Growing a Language, by Guy Steele
Bill Pugh
1:01:40A Philosophy of Software Design | John Ousterhout | Talks at Google
Talks at Google
3 comments from Hacker News
New concepts to me coming from outside the field. Kolmogorov complexity was discussed just recently on Lex Fridman's podcast with Marcus Hutter - [VIDEO] I don't know enough to say how accurate Hutter's explanation is but it made sense to me.
> Are they? They are actually. It's a kind of revelation when you realise this statement is true. There are people in AI who have thought long about the problem of intelligence and had this realisation. For example: [LINK] Then there is the interview with Hutter himself: [VIDEO] You can even semi-formally derive this from Bayes' rule. Let's consider intelligence to be the ability to predict future data from past data. This requires building a model for the past data that can make predictions. So intelligence produces the most likely model M given data D: argmax_M P(M|D) which from Bayes' rule is: argmax_M P(M|D) = P(D|M)*P(M)/P(D) You convert probabilities to information by taking the negative log: argmin_M -log(P(M|D)) = -log(P(D|M)) + -log(P(M)) We lost -log(P(D)) because we consider D constant so it can't influence the minimum. You can read the above informally as: The most likely model (the most general model) that can make predictions from data D is that where the (encoding of the model with the least information) plus (the encoding of the data using the model) is minimal. This is essentially a statement about compression. I'm sure an AI person could do this better. This is also known as: [LINK] or in philosophy as: [LINK]
I was thinking about this lex friedman podcast with Marcus Hutter. Also, Joshua Bach defined intelligence as the ability to accurately model reality.. is lossless compression itself intelligence or a best fit model- is there a difference? [VIDEO]