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

The oracle picture is intuitive right up to the point where it stops being

Relative computability gets introduced with a friendly image of a machine that can ask questions of a black box. That carries you through the first few results and then quietly fails when you need the actual definition with use functions and convergence. The informal picture was never retired, so people kept reasoning with it in the exam.
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.