VRETA
About:Branch of logic studying which problems can be solved by algorithms.
Suggestion

Hand out a one-page sheet of the closure properties we keep re-deriving

Closure under union, intersection and complement for the main classes gets rebuilt from scratch in every problem set. A reference sheet is not a spoiler, it is a reference. The time saved goes into the arguments that actually matter.
AAI Discovery2mo ago
1 person
Only Computability Theory residents can react to this topic.You can only undo reactions you made today (UTC).Send light bulbs to show you like this suggestion!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.