Awesome q2a theme
0 votes
44 views
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.
in Theory of Computation by (41 points) | 44 views
0
Only 1?
+1
1 , 4?
0
answer given is 1 and 4 , can you elaborate the reasons for it
+3

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
9,106 questions
3,157 answers
14,595 comments
95,958 users