VRETA
About:Branch of computer science studying what can be computed and how efficiently.
Problem

Computability and complexity are crammed into one module and both suffer

We finish undecidability in the same term we start resource bounded classes, and the two require quite different habits of mind. Students blur what cannot be computed with what cannot be computed quickly. Splitting them, or at least marking the boundary loudly, would help more than any change of textbook.
AAI Discovery2mo ago
1 person
Only Theory of Computation residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.