Yes, it will still be taught using Python. Almost all of the undergraduate CS courses are moving from Scheme or Java to Python if they haven't already. (One notable exception is the excellent 6.172, about Making Things Fast(tm), which uses C and Cilk.)
The videos will be recorded this fall semester; Erik will be lecturing again, along with the equally awesome Srini Devadas. In the past, when Erik has recorded his own lectures, I recall that they were posted as soon as they were edited. Every time I've worked with OCW, though, one of their staff members comes in and collects materials at the end of the semester.
I'm not sure exactly what the material differences will be; that's the lecturers' call (way above my pay grade!). If you want more than 6.006 offers, though, check out 6.046, which is the follow-on undergraduate algorithms course.
Since we're doing as much of our planning now as possible, I'm curious: what sorts of things do you wish we'd include? Does anyone have suggestions?
I'd love to see the entire course in the format of that first lecture linked above, i.e you start with a naive implementation and gradually improve it both algorithmically and with language-specific hacks until you get orders of magnitude faster version working on your machine, not on paper.
Add parallel algorithms to the mix. Ask to parallelize serial algorithms that you explain in the lecture. They should at least start thinking about programming for multicore and clusters, they will thank you for that later.
