Skip to content

Comment on Shortest meta-circular description of a universal computational structure?

Comments

To quell AGI hysteria I've posed a simple Algorithmic Information Theoretic IQ Test question: What is the shortest program you can come up with that outputs this string: 0000000001000100001100100001010011000111010000100101010010110110001101011100111110000100011001010011101001010110110101111100011001110101101111100111011111011111

Yann LeCun responded: "I can construct a computer for which the shortest program that generates this bit string has length 1."

To which I posed this question: "Why do mathematicians spend centuries asking for their minimum set of axioms but, not even Wolfram's acolytes ask for the shortest meta-circular description of a universal computational structure?"

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.