adplus-dvertising
frame-decoration

Question

Which of the problems are unsolvable?

a.

Halting problem

b.

Boolean Satisfiability problem

c.

both a and b

d.

None of the mentioned

Answer: (c).both a and b

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Which of the problems are unsolvable?

Similar Questions

Discover Related MCQs

Q. Which of the following a turing machine does not consist of?

Q. The value of n if turing machine is defined using n-tuples:

Q. If d is not defined on the current state and the current tape symbol, then the machine ______

Q. Statement: Instantaneous descriptions can be designed for a Turing machine.
State true or false:

Q. Which of the following are the models equivalent to Turing machine?

Q. Which among the following is incorrect for o-machines?

Q. RASP stands for:

Q. Which of the following is not true about RASP?

Q. State true or false:
Statement: RASP is to RAM like UTM is to turing machine.

Q. The class of recursively ennumerable language is known as:

Q. A language L is said to be Turing decidable if:

Q. Which of the following statements are false?

Q. Choose the correct option:
Statement: If L1 and L2 are recursively ennumerable languages over S, then the following is/are recursively ennumerable.

Q. If L is a recursive language, L’ is:

Q. Choose the appropriate option:
Statement: If a language L is recursive, it is closed under the following operations:

Q. A recursively ennumerable language L can be recursive if:

Q. State true or false:
Statement: An ennumerator is a turing machine m with extra output tape T, where symbols, once written, are never changed.

Q. A Language L may not be accepted by a Turing Machine if:

Q. The machine accept the string by entering into hA or it can:

Q. Which of the following can accept even palindrome over {a,b}