Only 1?

Awesome q2a theme

0 votes

Consider the following problems and select the problem which is recursively enumerable but not recursive. (MSQ type)

1 . Whether a given Turing machine accepts non-empty language.

2. Whether a given Turing machine accepts finite language .

3. Whether a given Turing machine accepts at most 10 strings

4. Whether a given Turing machine accepts at least 10 strings.

1 . Whether a given Turing machine accepts non-empty language.

2. Whether a given Turing machine accepts finite language .

3. Whether a given Turing machine accepts at most 10 strings

4. Whether a given Turing machine accepts at least 10 strings.

+3

https://gateoverflow.in/30890/please-explain (1).

https://gateoverflow.in/66/consider-the-following-languages(3,4)

For 2. **T**yes={a} **T**no=(a+b)*

**T**yes$\subset$**T**no. (Part 2 Rice theorem https://gatecse.in/rices-theorem/ ) So Not re.

9,106 questions

3,157 answers

14,595 comments

95,958 users