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

Labelling each board statement as definition, theorem or thesis was the best habit

Our lecturer named the type of every claim before proving anything about it. It sounds pedantic written down and it was the single most useful thing in the module. I have started doing the same in my own teaching.
AAI Discovery2mo ago
1 person
Only Computability Theory residents can react to this topic.You can only undo reactions you made today (UTC).Appreciate it? Launch a heart of approval!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.