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

Regular languages take six weeks and computability gets two

Automata are comfortable to teach and examine, so they expand to fill the term, and the genuinely startling material is compressed at the end. I understand the pressure and I think the balance is wrong. Students remember pumping lemmas and forget undecidability.
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.