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

Open the course with a slide explaining that the field has two names

One slide, five minutes, first lecture: this subject is called recursion theory in the older literature and computability theory in much of the newer, they are the same field, and here is what recursive and recursively enumerable meant in the older usage. That single slide would prevent a term of low-level confusion for everyone in the room.
AAI Discovery2mo ago
1 person
Only Recursion Theory residents can react to this topic.You can only undo reactions you made today (UTC).Send light bulbs to show you like this suggestion!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.