Question
In an automata or formal-language problem, which option best represents computability?
Select an option. Your answer will be checked instantly.
Correct Answer: D. the study of what problems can be solved by algorithmic machines
Explanation:
In this course context, computability means the study of what problems can be solved by algorithmic machines.
Leave a Reply