A problem is called __________ if its has an efficient algorithm for itself.
(a) tractable
(b) intractable
(c) computational
(d) none of the mentioned
I have been asked this question in an interview.
This intriguing question comes from The Universal Language-Undecidability topic in portion Undecidability of Automata Theory