Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>There is a story that, during the early days of AI research when significant progress was being made on "hard" logic problems via mechanical theorem provers, a professor assigned one of his graduate students the "easy" problem of solving how vision provided meaningful input to the brain. Obviously, things turned out to be far more difficult than the professor anticipated. So, no, not <em>vision</em> in the general sense.</p> <p>If you are just starting in AI, there are a couple of directions. The classic AI problems - logic puzzles - are solved with a mechanical theorem prover (usually written in Lisp - see <a href="http://rads.stackoverflow.com/amzn/click/0934613311" rel="noreferrer">here</a> for the classic text on solving logical puzzles). If you don't want to create your own, you can pick up a copy of Prolog (it is essentially the same thing). </p> <p>You can also go with <a href="http://rads.stackoverflow.com/amzn/click/0387310738" rel="noreferrer">pattern recognition</a> problems although you'll want to keep the initial problems pretty simple to avoid getting swamped in detail. My dissertation involved the use of <a href="http://rads.stackoverflow.com/amzn/click/158488651X" rel="noreferrer">stochastic proccesses</a> for letter recognition in free-floating space so I'm kind of partial to this approach (don't start with stochastic processes though, unless you really like math). Right next door is the subfield of <a href="http://rads.stackoverflow.com/amzn/click/0198538642" rel="noreferrer">neural networks</a>. This is popular because you almost can't learn NN without building some interesting projects. Across this entire domain (pattern processing), the cool thing is that you can solve real problems rather than toy puzzles.</p> <p>A lot of people like <a href="http://www.amazon.com/s/ref=nb_ss_b?url=search-alias%3Dstripbooks&amp;field-keywords=Natural+Language+Processing&amp;x=0&amp;y=0" rel="noreferrer">Natural Language Processing</a> as it is easy to get started but almost infinite in complexity. One very definable problem is to build an NLP program for processing language in a specific domain (discussing a chess game, for example). This makes it easy to see progress while still being complex enough to fill a semester.</p> <p>Hope that gives you some ideas!</p>
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. VO
      singulars
      1. This table or related slice is empty.
    2. VO
      singulars
      1. This table or related slice is empty.
    3. VO
      singulars
      1. This table or related slice is empty.
 

Querying!

 
Guidance

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload