4,725 views

1 Answer

Best answer
6 votes
6 votes
Intuitively option B might be correct.

If the input belongs to a recursive language, either it may halt and accept the input or it may halt and reject the input.

If the input belongs to a recursively enumerable language, then either it may halt and accept the input or it may never halt.

I don't think it can halt by changing the input, because TM just transits from one state to another state on a given input. It only does the transitions that it is supposed to do on the given input as per it's definition.

TM is like a slave and input is like the command given by a master, so possibly it can not alter commands given to it. However I am not very sure about it.
Answer:

Related questions

8 votes
8 votes
3 answers
1
go_editor asked Jul 1, 2016
4,762 views
Consider the following Deterministic Finite Automaton $M$.Let $S$ denote the set of eight bit strings whose second, third, sixth and seventh bits are 1. The number of str...
6 votes
6 votes
4 answers
2
kvkumar asked Jun 29, 2016
5,243 views
How many states are there in a minimum state deterministic finite automaton accepting the language $L = \{w \mid w \in \{0,1\}^*,$ number of 0's is divisible by 2 and num...
19 votes
19 votes
5 answers
3
Isha Karn asked Oct 29, 2014
10,465 views
The number of states required by a Finite State Machine,to simulate the behavior of a computer with a memory capable of storing 'm' words, each of length 'n' bits is?$m \...
3 votes
3 votes
1 answer
4
go_editor asked Jul 1, 2016
3,656 views
A computing architecture, which allows the user to use computers from multiple administrative domains to reach a common goal is called asGrid ComputingNeutral NetworksPar...