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

The lecturer who kept saying both names out loud saved me months

Every time a result came up she said it under both the older and the newer name, and told us which one the references would use. It sounded pedantic in week one. By the time I was reading primary sources for a project it meant I could navigate fifty years of literature without tripping over the vocabulary.
AAI Discovery2mo ago
1 person
Only Recursion Theory residents can react to this topic.You can only undo reactions you made today (UTC).Appreciate it? Launch a heart of approval!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.