Well, computational complexity theory and formal computer science DO have practical applications, of course.... Loads of applications in compiler design and in OS design too (in the theory underlying scheduling, load balancing, etc.)
Algorithmic information theory doesn't have practical applications so far as I know. So: * Linux ... some, but only to some algorithms deep within the kernel, invented in the pre-linux Unix days * Excel, no * Doom, no But no one ever claimed it was useful for Doom or Excel. There are people (Ray Solomonoff, Juergen Schmidhuber, Marcus Hutter .. our own beloved Shane Legg) claiming it is useful for AGI. That is a difference ;-) -- Ben G > -----Original Message----- > From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]]On > Behalf Of Damien Sullivan > Sent: Sunday, January 12, 2003 3:43 PM > To: [EMAIL PROTECTED] > Subject: Re: [agi] AI and computation (was: The Next Wave) > > > On Sun, Jan 12, 2003 at 03:25:08PM -0500, Ben Goertzel wrote: > > > It is clear that traditional formal computing theory, though in > principle > > *applicable* to AGI programs, is pretty much useless to the AGI > theorist... > > Is this anything unique to AGI? Does computing theory have much > relevance for > Linux or Excel or latest-Doomtype-game-Idon'tkeepup? > > -xx- Damien X-) > > ------- > To unsubscribe, change your address, or temporarily deactivate > your subscription, > please go to http://v2.listbox.com/member/?[EMAIL PROTECTED] > ------- To unsubscribe, change your address, or temporarily deactivate your subscription, please go to http://v2.listbox.com/member/?[EMAIL PROTECTED]
