Bissoy.com
Doctors Medicines MCQs Q&A

A turing machine has ____________ number of states in a CPU.

A turing machine has ____________ number of states in a CPU. Correct Answer finite

A turing machine has finite number of states in its CPU. However, the states are not small in number. Real computer consist of registers which can store values (fixed number of bits).

Related Questions

Which of the following statements is/are FALSE? 1. For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine. 2. Turing recognizable languages are closed under union and complementation. 3. Turing decidable languages are closed under intersection and complementation. 4. Turing recognizable languages are closed under union and intersection.
Consider the following statements. I. The complement of every Turing decidable language is Turing decidable II. There exists some language which is in NP but is not Turing decidable III. If L is a language in NP, L is Turing decidable Which of the above statements is/are true?
You install and run a third-party 32-bit application named Application on your Windows 2000 Server computer. After several days, the application stops responding. You open Task Manager and find that the CPU usage is at 100 percent. The normal range of CPU usage on the server is from 20 percent to 30 percent You end the application. However, you see that the CPU on the server is still at 100 percent. Task Manager shows no other applications running. You then examine the Processes page in Task Manager and confirm that the Application.exe process is no longer running. You want to return the CPU usage to its normal range. What should you do?
A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35. The total CPU utilization is ____________
Let L(R) be the language represented by regular expression R. Let L(G) be the language generated by a context free grammar G. Let L(M) be the language accepted by a Turing machine M. Which of the following decision problems are undecidable? I. Given a regular expression R and a string w, is w ∈ L(R)? II. Given a context-free grammar G, is L(G) = ϕ? III. Given a context-free grammar G, is L(G) = ∑* for some alphabet ∑? IV. Given a Turing machine M and a string w, is w ∈ L(M)?  
State true or false: Statement: Two track turing machine is equivalent to a standard turing machine.
A multitape turing machine is ________ powerful than a single tape turing machine.
Can a single tape turing machine be simulated using deterministic 2-stack turing machine?
A two-way infinite tape turing machine is ________ superior than the basic model of the turing machine in terms of power.
Without needing extra __________ we can simulate non deterministic turing machine using deterministic turing machine.