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

Many-one and Turing reductions were introduced in a single lecture

Both arrived in the same hour with similar notation and similar diagrams. They are not interchangeable and the difference matters for several of the results that follow. Splitting them across two weeks would cost the course nothing at all.
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.