<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Formal Measure of Machine Intelligence · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/cs_0605024/</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_0605024/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Formal Measure of Machine Intelligence — mentioned by chriswarbo</title><link>https://news.ycombinator.com/item?id=34258624</link><guid isPermaLink="false">urn:hackerpapers:mention:cs_0605024:34258624</guid><pubDate>Thu, 05 Jan 2023 12:06:25 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/cs/0605024 gives a formal model of intelligence (achieving high reward in an agent/environment setup, across all computable environments weighted by their Kolmogorov complexity) https://arxiv.org/abs/1109.5951 gives a computable approximation (dubbed AIQ, Algorithmic Intelligence Quotient), and a reference implementation using Brainfuck programs (personally I would prefer Binary Combinatory Logic or Binary Lambda Calculus ;) )&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/cs_0605024/"&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>
