The good news here is that Neil Gershenfeld is leading the effort.
Very down to earth, lots of street cred, and a mensch besides.
One serious problem could be the proof that some languages are not
Turing-recognizable. In computer-speak, a language is a set of
strings, and any algorithm has an associated set of strings .. the
algorithm's solutions. See Sipser p. 178, Ch 4, Decidability.
All this translates to the more simple statement that computers cannot
solve all problems.
Note: The proof simply shows that the set of all sets of strings
(languages) is uncountable, while the set of algorithms is countable.
So the key formal question the Mind Machine Project, or MMP, must
start with is whether or not the scope of their research is within the
scope of algorithms.
I hope it is!
-- Owen
On Dec 11, 2009, at 9:51 AM, Mikhail Gorelkin wrote:
http://web.mit.edu/newsoffice/2009/ai-overview.html
--Mikhail
============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College
lectures, archives, unsubscribe, maps at http://www.friam.org
