--- On Tue, 1/13/09, Ben Goertzel <[email protected]> wrote: > The complexity of a simulated environment is tricky to estimate, if > the environment contains complex self-organizing dynamics, random > number generation, and complex human interactions ...
In fact it's not computable. But if you write 10^6 bits of code for your simulator, you know it's less than 10^6 bits. But I wonder which is a better test of AI. http://cs.fit.edu/~mmahoney/compression/text.html is based on natural language prediction, equivalent to the Turing test. The data has 10^9 bits of complexity, just enough to train a human adult language model. http://cs.fit.edu/~mmahoney/compression/uiq/ is based on Legg and Hutter's universal intelligence. It probably has a few hundred bits of complexity, designed to be just beyond the reach of tractability for universal algorithms like AIXI^tl. -- Matt Mahoney, [email protected] ------------------------------------------- agi Archives: https://www.listbox.com/member/archive/303/=now RSS Feed: https://www.listbox.com/member/archive/rss/303/ Modify Your Subscription: https://www.listbox.com/member/?member_id=8660244&id_secret=126863270-d7b0b0 Powered by Listbox: http://www.listbox.com
