In an automata or formal-language problem, which option best represents computability?

Correct Answer: D

the study of what problems can be solved by algorithmic machines

In this course context, computability means the study of what problems can be solved by algorithmic machines.