🎴 Flashcard Mode
Logic and Computation: Computability and Complexity
Card1 / 15
Mastered0
Review0
QuestionClick to flip
Which of the following is a model of computation that is used to define computability?
AnswerClick to flip back
A
Turing Machine
💡 Explanation:
A Turing Machine is a theoretical model of computation that consists of a tape, a read/write head, and a finite set of states. It is used to define computability and study the limits of what can be computed.