<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Theory of Universal Artificial Intelligence based on Algorithmic Complexity · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/cs_0004001/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/cs_0004001/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Theory of Universal Artificial Intelligence based on Algorithmic Complexity — mentioned by sinenomine</title><link>https://news.ycombinator.com/item?id=32537130</link><guid isPermaLink="false">urn:hackerpapers:mention:cs_0004001:32537130</guid><pubDate>Sun, 21 Aug 2022 03:22:24 GMT</pubDate><description>&lt;p&gt;&amp;gt; It is a term gaining in popularity due to this difficult to define definition and allows for more a porn like definition &amp;gt; Philosophers, psychologists, neuroscientists, and many others have been contemplating the definition of intelligence for centuries and we&amp;#x27;re still not -quite there Given the decade-old, seminal, widely cited papers by Legg (co-founder of Deepmind) &amp;amp; Hutter (long-term professor of ANU with multiple awards, currently researcher at Deepmind) titled &amp;quot;Universal Intelligence: A Definition of Machine Intelligence&amp;quot;[1] and &amp;quot;A Collection of Definitions of Intelligence&amp;quot;[2] and the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/cs_0004001/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>A Theory of Universal Artificial Intelligence based on Algorithmic Complexity — mentioned by shenberg</title><link>https://news.ycombinator.com/item?id=27687520</link><guid isPermaLink="false">urn:hackerpapers:mention:cs_0004001:27687520</guid><pubDate>Wed, 30 Jun 2021 12:12:14 GMT</pubDate><description>&lt;p&gt;The origins of the approach of a perfect world model equals AI, at least how I encountered it, are from Marcus Hutter. H proved that perfect compression (=prediction of what will happen next) is the ideal way to drive an agent in reinforcement learning[1] (the choice of action being the likeliest high-reward action). So a perfect world model is enough to win at reinforcement learning. Can you show that if you maximized reward in some RL problem, it means you necessarily built a perfect world-model? [1] A Theory of Universal Artificial Intelligence based on Algorithmic Complexity, 2000…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/cs_0004001/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>A Theory of Universal Artificial Intelligence based on Algorithmic Complexity — mentioned by nawitus</title><link>https://news.ycombinator.com/item?id=10981615</link><guid isPermaLink="false">urn:hackerpapers:mention:cs_0004001:10981615</guid><pubDate>Wed, 27 Jan 2016 17:56:55 GMT</pubDate><description>&lt;p&gt;From the conclusions of http://arxiv.org/abs/cs/0004001 : &amp;quot;All tasks which require intelligence to be solved can naturally be formulated as a maximization of some expected utility in the framework of agents. We gave a functional (2) and an iterative (9) formulation of such a decision theoretic agent, which is general enough to cover all AI problem classes, as has been demonstrated by several examples. The main remaining problem is the unknown prior probability distribution AI of the environment(s). &amp;lt;...&amp;gt; the universal semimeasure, based on ideas from algorithmic information theory, solves the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/cs_0004001/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item></channel></rss>
