It doesn't have any application... My proof has two steps
1) Hutter's paper The Fastest and Shortest Algorithm for All Well-Defined Problems http://www.hutter1.net/ai/pfastprg.htm 2) I can simulate Hutter's algorithm (or *any* algorithm) using an attractor neural net, e.g. via Mikhail Zak's neural nets with Lipschitz-discontinuous threshold functions ... This is all totally useless as it requires infeasibly much computing power ... but at least, it's funny, for those of us who get the joke ;-) ben On Tue, Sep 30, 2008 at 3:38 PM, Mike Tintner <[EMAIL PROTECTED]>wrote: > Can't resist, Ben.. > > "it is provable that complex systems methods can solve **any** analogy > problem, given appropriate data" > > Please indicate how your proof applies to the problem of developing an AGI > machine. (I'll allow you to specify as much "appropriate data" as you like > - any data, of course, *currently* available). > > > ------------------------------ > *agi* | Archives <https://www.listbox.com/member/archive/303/=now> > <https://www.listbox.com/member/archive/rss/303/> | > Modify<https://www.listbox.com/member/?&;>Your Subscription > <http://www.listbox.com> > -- Ben Goertzel, PhD CEO, Novamente LLC and Biomind LLC Director of Research, SIAI [EMAIL PROTECTED] "Nothing will ever be attempted if all possible objections must be first overcome " - Dr Samuel Johnson ------------------------------------------- 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=114414975-3c8e69 Powered by Listbox: http://www.listbox.com
