retagged by
197 views
0 votes
0 votes

Let L be regular language and R be turing recognizable but not accepting language. How many of the following is possible.?

1.compliment of R can be Turing recognizable.

2.L U (R)' can be recursive.

3.set of strings common in R and L can be in not RE.

4.L U R can be recursive.

5.set of strings common in R' and L can be recursive.

 

retagged by

Please log in or register to answer this question.

Related questions


Deprecated: Implicit conversion from float-string "1706409302.686" to int loses precision in /var/www/html/qadb/qa-include/app/format.php on line 796

Deprecated: Implicit conversion from float-string "1706409302.686" to int loses precision in /var/www/html/qadb/qa-include/app/format.php on line 801

Deprecated: Implicit conversion from float-string "1706409302.686" to int loses precision in /var/www/html/qadb/qa-include/app/format.php on line 802

Deprecated: Implicit conversion from float-string "1706409302.686" to int loses precision in /var/www/html/qadb/qa-include/app/format.php on line 803
490
views
1 answers
5 votes
GO Classes asked Jan 28
490 views
Recall that a Turing machine $\text{T}$ can be represented or 'coded' by an integer $m$. Let us write 'the $m$ th Turing machine' to mean the Turing machine coded by $m$....
Total PHP MySQL Other RAM
Time (ms) % Time (ms) % File count Time (ms) % Query count Time (ms) % Amount %
Setup 5.3 5% 4.0 3% 72 1.5 1% 2 0.0 0% 569k 56%
Control 12.5 12% 1.4 1% 5 11.3 11% 12 0.0 0% 151k 14%
View 1.3 1% 1.3 1% 12 0.0 0% 0 0.0 0% 79k 7%
Theme 75.9 75% 3.7 3% 15 72.3 72% 3 0.0 0% 214k 21%
Stats 5.2 5% 0.1 0% 0 5.2 5% 1 0.0 0% 0k 0%
Total 100.2 100% 10.5 10% 104 90.3 90% 18 0.0 0% 1015k 100%