<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>From Philosophy to Program Size · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/math_0303352/</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/math_0303352/feed.xml" rel="self" type="application/rss+xml" /><item><title>From Philosophy to Program Size — mentioned by ttctciyf</title><link>https://news.ycombinator.com/item?id=49076615</link><guid isPermaLink="false">urn:hackerpapers:mention:math_0303352:49076615</guid><pubDate>Mon, 27 Jul 2026 22:54:41 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;ve long admired Chaitin for his original thinking and especially his ability to clearly convey his ideas about foundations, complexity and information in concise and digestible short proofs. I&amp;#x27;m a little surprised, however, to see him here proselytizing for a particular side in the constructivism debate. I associate him more with what he has described as a &amp;quot;quasi empirical&amp;quot; approach to mathematics[0] where the adoption of new axioms (such as for example the axiom of choice) is justified by their resulting in new, interesting mathematics. But here, it seems his goal is to arrive at a…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_0303352/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.HO</category></item><item><title>From Philosophy to Program Size — mentioned by pizza</title><link>https://news.ycombinator.com/item?id=15370670</link><guid isPermaLink="false">urn:hackerpapers:mention:math_0303352:15370670</guid><pubDate>Sat, 30 Sep 2017 01:32:31 GMT</pubDate><description>&lt;p&gt;allow me to make your day: - Computational trinitarianism, or how 1.) propositions as types, 2.) programs as proofs, and 3.) the relation between type theory and category theory are one and the same thing [0] - Scott aaronson&amp;#x27;s excellent &amp;quot;Why Philosophers Should Care About Computational Complexity&amp;quot; [1] - &amp;quot;From Philosophy to Program Size&amp;quot; by Greg Chaitin. Arguably Chaitin&amp;#x27;s work (notably Chaitin&amp;#x27;s omega) is a quintessential example of what lies at the intersection of mathematics, computation, and philosophy.[2] - From the inimitable Juergen Schmidhueber, &amp;quot;Driven by Compression Progress: A…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_0303352/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.HO</category></item><item><title>From Philosophy to Program Size — mentioned by hyporthogon</title><link>https://news.ycombinator.com/item?id=13785723</link><guid isPermaLink="false">urn:hackerpapers:mention:math_0303352:13785723</guid><pubDate>Fri, 03 Mar 2017 19:50:46 GMT</pubDate><description>&lt;p&gt;Everything I&amp;#x27;ve read by Chaitin is interesting and thoughtful, but this piece is particularly accessible and entertaining: https://arxiv.org/abs/math/0303352&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_0303352/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.HO</category></item><item><title>From Philosophy to Program Size — HN submission</title><link>https://news.ycombinator.com/item?id=13606919</link><guid isPermaLink="false">urn:hackerpapers:submission:math_0303352:13606919</guid><pubDate>Thu, 09 Feb 2017 14:02:14 GMT</pubDate><description>&lt;p&gt;From Philosophy to Program Size (2003)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;75 points; 30 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/math_0303352/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>math.HO</category></item></channel></rss>
