Teaching BPSC 4.0 बिहार उच्च माध्यमिक शिक्षक भर्ती (PGT) Mock Test Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability
A Turing machine consists of
1
a finite-state control
2
an infinite tape
3
a read/write tape head
4
More than one of the above
5
None of the above