adplus-dvertising
frame-decoration

Question

A language L is said to be Turing decidable if:

a.

recursive

b.

TM recognizes L

c.

TM accepts L

d.

None of the mentioned

Answer: (a).recursive

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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}

Q. Which of the functions can a turing machine not perform?

Q. If T1 and T2 are two turing machines. The composite can be represented using the expression:

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

Q. Suppose we have a simple computer with control unit holding a PC with a 32 bit address + Arithmetic unit holding one double length 64 bit Arithmetic Register. The number of states the finite machine will hold:

Q. State true or false:
Statement: We can use the finite control of turing machine to hold a finite amount of data.

Q. Statement 1: Multitrack Turing machine.
Statement 2: Gamma is Cartesian product of a finite number of finite sets.

Which among the following is the correct option?

Q. A multi track turing machine can described as a 6-tuple (Q, X, S, d, q0, F) where X represents:

Q. State true or false:
Statement: Two track turing machine is equivalent to a standard turing machine.

Q. Which of the following is/are not true for recursively ennumerable language?

Q. According to Chomsky hierarchy, which of the following is adopted by Recursively Ennumerable language?

Q. A turing machine with several tapes in known as: