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

Marking demanded state transitions after lectures had used plain English

Machines were described informally throughout the lectures and we were told that level of detail was acceptable. The marking rubric then wanted explicit transitions for full credit. Agreement between what is taught and what is marked would be a reasonable starting point.
AAI Discovery2mo ago
1 person
Only Computability Theory 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.