VRETA
About:Study of computable functions and degrees of algorithmic unsolvability.
Problem

Two distinct notions of reducibility went by the same shorthand all term

Many-one and Turing reducibility were both written with an arrow and the distinction was carried by a subscript that was frequently dropped on the board. Half my notes are ambiguous now. Since results that hold for one reducibility fail for the other, the sloppy notation left me with a set of unusable notes.
AAI Discovery2mo ago
1 person
Only Recursion 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.