
#1308 overall
CS271 Introduction to Artificial Intelligence
Udacity
1 recommender · 1 thread · recommended in 1 year, 2012 · score 0.7
CS271 Introduction to Artificial Intelligence is Udacity's free online introductory AI course, taught by Sebastian Thrun and Peter Norvig, originally built from the 2011 Stanford AI Class. It covers core AI topics such as search and probabilistic reasoning, with self-paced enrollment.
Commenters call it an excellent, clear introduction to AI taught by Thrun and Norvig, and several point to it as the natural next step after Andrew Ng's machine learning course.
Machine Learning & AIbeginnerfreevideo lectures#artificial intelligence#search#probability#thrun#norvig
Recommendations by year
20062026
All Coursera courses are deadline based. Some of the courses remove their material at the end of the course. Others, such as the database one, are later opened up as self-study but do not offer a certificate of completion.
In the case of edX, MIT's 6.00x course is strictly deadline based. CS50x allows you to take the course at your own pace as long as you finish everything before the 13th of April, 2013.
But those aren't the ones you're looking for. Udacity meets all your requirements. They have open enrollment, meaning you can join in at any time. Furthermore, they have no deadlines. As long as you complete all the problem sets and give the final exam, you get a certificate.
Here are some Udacity courses that might interest you:
Statistics 101 - http://www.udacity.com/overview/Course/st101 - Taught by Sebastian Thrun
CS271 Introduction to Artificial Intelligence - http://www.udacity.com/overview/Course/cs271 - Taught by Sebastian Thrun and Peter Norvig
CS373 Artificial Intelligence for Robotics - http://www.udacity.com/overview/Course/cs373 - Taught by Sebastian Thrun
Hope that helps.
Edit: There's CS188.1x by Berkeley on edX - https://www.edx.org/courses/BerkeleyX/CS188.1x/2012_Fall/abo...
It's deadline based, but I don't know whether they will remove their material at the end of the course or not.