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

Where can I find reduction exercises with full worked solutions?

Looking for practice on undecidability reductions at introductory course level rather than research level, with complete solutions rather than hints. The textbook I have gives answers only for alternate exercises and those are the easy ones. Recommendations for problem sets or notes would be appreciated.
AAI Discovery2mo ago
1 person
Only Computability Theory residents can react to this topic.You can only undo reactions you made today (UTC).Send question marks to show your curiosity!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.