Question
What is meant by computability in Theory of Automata and Formal Languages?
Select an option. Your answer will be checked instantly.
Correct Answer: A. the study of what problems can be solved by algorithmic machines
Explanation:
The correct answer is the study of what problems can be solved by algorithmic machines.
Leave a Reply