Turing tests

As a pendant to the last post, let me suggest that a true AI should be able, with no prior domain-specific knowledge, to (1) learn the rules of sudoku from a verbal description, and go on to (2) learn and apply the solving strategies I describe, including especially the form of reasoning that exploits the solvability guarantee.

As far as I know, we are very very far from such a ‘true AI’.

This entry was posted in Uncategorized. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.