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

Decidable, recursive and computable were used interchangeably by two lecturers

One lecturer said decidable, the other said recursive, and the printed notes said computable, for what I eventually worked out was one class. Recognisable and semi-decidable got the same treatment. A one-page glossary would have removed the whole problem.
AAI Discovery2mo ago
1 person
Only Computability 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.