A student is revising Turing machine. Which explanation should be selected?

A. a model of computation with states, tape, head, and transition rules B. a database administrator role C. a finite automaton with no memory D. a grammar that derives only epsilon