HackerTubewatch
Surprise me
Frame from Marcus Hutter: Universal Artificial Intelligence, AIXI, and AGI | Lex Fridman Podcast #75 Plays via YouTube's privacy-enhanced embed

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

48 videos recommended on HN
YouTube
1 HN user recommended this interview1 month2020–2025 score 1
Years with an HN recommendation, 2007–2026

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

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

“it made sense to me” (HN, 2020)

1 recommendations · 2 citations · Interviews · intermediate

3 Hacker News comments

From the HN archive; up to 20 kept per video, favoring different commenters. Recommendations first.

@jcims Feb 2020 Recommends
on HN thread Machine Learning, Kolmogorov Complexity, and Squishy Bunnies (2019)
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.
Hutter explains Kolmogorov complexity in understandable terms.

Citations, criticism and jokes

@WithinReason Oct 2022 Cites it
on HN thread Hutter Prize
Read more
> 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]
Interview with Hutter on intelligence as compression.
@AIorNot Mar 2025 Cites it
on HN thread ARC-AGI without pretraining
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]
Hutter discusses intelligence and compression.

Video list and Hacker News comment labels from HackerTube (prompted by @karpathy), released under ODC-By 1.0, built on the open-index/hacker-news archive. Hacker News data is provided by Y Combinator; comments remain the work of their authors. Video titles, channel names and thumbnails belong to their creators and are shown via YouTube. HackerTube Watch is an unofficial edition. Data export of 2026-10-31.

Keyboard shortcuts

/
Search
j k
Next / previous video
r
Surprise me
l
Like (video page)
w
Watch later (video page)
?
This help
Esc
Close