Name: Universal Artificial Intelligence
ISBN: 9783540221395

Universal Artificial Intelligence

Decision Theory = Probability + Utility Theory + + Universal Induction = Ockham + Bayes + Turing = = A Unified View of Artificial Intelligence This book presents sequential decision theory from a novel algorithmic information theory perspective. While the former is suited for active agents in known environments, the latter is suited for passive prediction in unknown environments. The book introduces these two well-known but very different ideas and removes the limitations by unifying them to one parameter-free theory of an optimal reinforcement learning agent embedded in an arbitrary unknown environment. Most if not all AI problems can easily be formulated within this theory, which reduces the conceptual problems to pure computational ones. Considered problem classes include sequence prediction, strategic games, function minimization, reinforcement and supervised learning. The discussion includes formal definitions of intelligence order relations, the horizon problem and relations to other approaches to AI. One intention of this book is to excite a broader AI audience about abstract algorithmic information theory concepts, and conversely to inform theorists about exciting applications to AI.

What Hacker News says

jandrewrogersOct 2025

This discussion is not complete without a mention of Marcus Hutter’s seminal book[0] “Universal Artificial Intelligence: Sequential Decisions Based On Algorithmic Probability”. It provides many of the formalisms upon which metrics of intelligence are based. The gaps in current AI tech are pretty explainable in this context.

[0] https://www.hutter1.net/ai/uaibook.htm

thread

eli_gottliebSep 2014

That, and then probably Probabilistic Models of Cognition if you want to see doable exercises addressing real cognitive-science problems. If you want to see something crazy-awesome enough to deserve the term "artificial intelligence", try Hutter's Universal Artificial Intelligence.

thread

ccozanNov 2013

I highly recommend Markus Hutter's book: "Universal Artificial Intelligence: Sequential Decisions Based On Algorithmic Probability" (http://www.amazon.com/Universal-Artificial-Intelligence-Algo... )

Beware, you need some serious maths and a board to follow him. In the end the book is quite rewarding.

Now to AIXI: I don't belive that having a formula solves AI problem. Yes you can model it, but in real environment, I believe there are simpler models to try first. Remember: nature like simpliness first, complex when needed.

thread

hodgehog11Feb 2026

Fine, that's fair. I believe the statement that you made is countered by my claim, which is:

Theorem. For any tolerance epsilon > 0, there exists a transformer neural network of sufficient size that follows, up to the factor epsilon, the policy that most optimally achieves arbitrary goals in arbitrary stochastic environments.

Proof (sketch). For any stochastic environment with a given goal, there exists a model that maximizes expected return under this goal (not necessarily unique, but it exists). From Solomonoff's convergence theorem (Theorem 3.19 in [1]), Bayes-optimal predictors under the universal Kolmogorov prior converge with increasing context to this model. Consequently, there exists an agent (called the AIXI agent) that is Pareto-optimal for arbitrary goals (Theorem 5.23 in [1]). This agent is a sequence-to-sequence map with some mild regularity, and satisfies the conditions of Theorem 3 in [2]. From this universal approximation theorem (itself proven in Appendices B and C in [2]), there exists a transformer neural network of a sufficient size that replicates the AIXI agent up to the factor epsilon.

This is effectively the argument made in [3], although I'm not fond of their presentation. Now, practitioners still cry foul because existence doesn't guarantee a procedure to find this particular architecture (this is the constructive bit). This is where the neural scaling law comes in. The trick is to work with a linearization of the network, called the neural tangent kernel; it's existence is guaranteed from Theorem 7.2 of [4]. The NTK predictors are also universal and are a subset of the random feature models treated in [5], which derives the neural scaling laws for these models. Extrapolating these laws out as per [6] for specific tasks shows that the "floor" is always below human error rates, but this is still empirical because it works with the ill-defined definition of superintelligence that is "better than humans in all contexts".

[1] Hutter, M. (2005). Universal artificial intelligence: Sequential decisions based on algorithmic probability. Springer Science & Business Media.

[2] https://arxiv.org/abs/1912.10077

[3] https://openreview.net/pdf?id=Vib3KtwoWs

[4] https://arxiv.org/abs/2006.14548

[5] https://arxiv.org/abs/2210.16859

[6] https://arxiv.org/abs/2001.08361

thread

mindcrimeDec 2025

I agree with /u/AnimalMuppet, FWIW. As long as I've been doing this stuff (and I've been doing it for quite some time) AGI has been interpreted (somewhat loosely) as something like "Intelligence equivalent to an average human adult" or just "human level intelligence". But as /u/AnimalMuppet points out, there's quite a bit of variance to human intelligence, and nobody ever really specified in detail exactly which "human intelligence" AGI was meant to correspond to.

SuperIntelligence (or ASI), OTOH, has - so far as I can recall - always been even more loosely specified, and translates roughly to "an intelligence beyond any human intelligence".

Another term you might hear, although not as frequently, is "Universal Artificial Intelligence". This comes mostly from the work of Marcus Hutter[1] and means something approximately like "an intelligence that can solve any problem that can, in principle, be solved".

[1]: https://www.hutter1.net/ai/uaibook.htm

thread

mindcrimeJan 2023

I don't know, but if they do, perhaps they converge to Marcus Hutter's "Universal Artificial Intelligence"[1].

[1]: http://hutter1.net/ai/uaibook.htm

thread