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

Classic unsolvability results get flattened into one sentence in the general courses

The general theory-of-computation module gives the undecidability of the halting problem a paragraph and moves on, leaving the impression that is the whole story. The classical tradition built an elaborate structure of degrees of unsolvability above that point. Students finish the module with no idea that structure exists.
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.