Time Left - 06:00 mins
NIELIT Scientific Assistant Day-15 :Theory Of Computation Quiz-2
Attempt now to get your rank among 431 students!
Question 1
Which of the following functions are computable by turing machine?
Question 2
Which of the following statement is not correct?
Question 3
Consider the following statements about the Turing machine
1. It can be represented using instantaneous description
2. In one move the Turing machine can write a symbol on the cell being scanned
3. It can be represented using transition table
Which one of the above statements is true?
1. It can be represented using instantaneous description
2. In one move the Turing machine can write a symbol on the cell being scanned
3. It can be represented using transition table
Which one of the above statements is true?
Question 4
If there is a reduction from problem P1 to P2
If P1 is undecidable then P2 is?
If P1 is undecidable then P2 is?
Question 5
Suppose there is language
Lel = {ρ(M) | L(M)=∅}
Then Lel is?
Lel = {ρ(M) | L(M)=∅}
Then Lel is?
- 431 attempts
- 1 upvote
- 10 comments
Apr 7GATE & PSU CS
