Skip to content
HHackerTube.videoSurprise me

Marcus Hutter: Universal Artificial Intelligence, AIXI, and AGI | Lex Fridman Podcast #75

Marcus Hutter: Universal Artificial Intelligence, AIXI, and AGI | Lex Fridman Podcast #75 on HackerTube: recommended by 1 Hacker News commenter across 1 month, 2020–2025.

Lex Fridman

interview · intermediate · evergreen

Open on YouTube

Lex Fridman interviews Marcus Hutter of DeepMind about universal artificial intelligence, AIXI, Kolmogorov complexity, Solomonoff induction and the idea of intelligence as compression.

Why Hacker News recommends it

Referenced as an accessible explanation of Kolmogorov complexity and Hutter's view of intelligence as compression.

people recommended it
1
separate months
1
strong recommendations
0
discussed on HN
2020–2025
“it made sense to me”
— jcims, Feb 2020, in “Machine Learning, Kolmogorov Complexity, and Squishy Bunnies (2019)”

What HN commenters said

3 Hacker News comments link this video. Each one links back to its thread.

jcimsFeb 2020Recommends

New concepts to me coming from outside the field. Kolmogorov complexity was discussed just recently on Lex Fridman's podcast with Marcus Hutter - ▶ this video I don't know enough to say how accurate Hutter's explanation is but it made sense to me.

in “Machine Learning, Kolmogorov Complexity, and Squishy Bunnies (2019)” · View on HN

AIorNotMar 2025Cites it

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? ▶ this video

in “ARC-AGI without pretraining” · View on HN

WithinReasonOct 2022Cites it

> 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: ▶ this 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]

in “Hutter Prize” · View on HN

Topics & tags