I didn't take computability yet. Can I still take the course? | |
|
Part of the course is to study the computational complexity of problems relating to automata. This means that you'll need a basic understanding of complexity classes such as NP, PSPACE, etc, as well as how to use reductions between problems. These concepts are at the heart of computability. If this material is new to you, you will have to catch up with some nontrivial concepts. It is up to you to decide whether you can do it. If you think you can, you're welcome to join the course (at your own risk). If you're taking computability in parallel with the course, keep in mind that the course is not built to match computability, so we may use some topics before you see them. So basically the same logic applies, with the exception that by week 14 you should be all caught up... Feel free to email me if this is still unclear. |
I didn't take algorithms yet. Can I still take the course? | |
|
I don't recommend it. Catching up on both algorithms and computability means a LOT of material. I plan to give this course next year as well, perhaps wait until then. If you're absolutely adamant on taking the course nonetheless, I won't stop you, but you do so at a heavy risk. |