Register

Decidable or not?
closed

• closed by
339 views
Voting & Accepting an answer helps improve the community
← Previous · confusion in key and...Next → · Gateoverflow BOOK Ha...
← Previous in category · ACETestSeries Questi...Next in category → · $\{\langle M \rangle...
Position:
Show:

Related questions

1 1 vote
1 1 answer
488
488 views
srestha asked Jun 15, 2018
488 views
Decidable or not
Now define D , the diagonal set of strings:$D=\left \{ w\epsilon \Sigma ^{*} \right \}$ where $w$ is not in $f\left ( w \right )$Call the correspondence $f$ is countable...
6 6 votes
4 4 answers
4.0k
4.0k views
nikhil_cs asked Jan 18, 2018
3,964 views
Intersection of two Recursive languages are of same type or not. Is it decidable or undecidable?
Since Recursive languages are closed under intersection, therefore it decidable. Am I wrong?
1 1 vote
1 1 answer
1.5k
1.5k views
Mk Utkarsh asked Jan 2, 2018
1,458 views
not partially decidable
what is the difference between recursive enumerable and not recursive enumerable(not partially decidable)?
1 1 vote
4 4 answers
4.4k
4.4k views
student2018 asked Apr 16, 2017
4,373 views
Is this decidable or undecidable
A = { (M, w) | M is a TM that on input w, tries to move its head past the left end of the input }B = { (M, w) | M is a TM that on input w, moves its head left at least on...