Register

#testbook

251 views
1 votes
1 votes

User Avatar

1 Answer

0 votes
0 votes
we canot make a TTM for this which can decide about this property , we only can recognize it by TM which is undecidable property ,and also RE set
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
shefali1 asked Nov 19, 2017
266 views
#testbook
User Avatar
0 votes
0 votes
1 answer
2
Rajib Datta Roy asked Nov 2, 2023
214 views
#TestBook #TestSeries
((f,g)|f(0)=g(0) or f(1)=g(1)) is the relation equivalent on set of function for all Z to Z . I find this to be equivalence relation ,but the solution says its not .cannot understand the solution properly . Anyone please Clear my doubt
((f,g)|f(0)=g(0) or f(1)=g(1)) is the relation equivalent on set of function for all Z to Z . I find this to be equivalence relation ,but the solution says its not .ca...
User Avatar
0 votes
0 votes
0 answers
3
amit166 asked Jan 19, 2023
244 views
#testbook
User Avatar
1 votes
1 votes
1 answer
4
amit166 asked Jan 5, 2023
301 views
#testbook
Time complexity=$\sum_{i=1}^{n}[\log (\frac{n}{i})] is$
Time complexity=$\sum_{i=1}^{n}[\log (\frac{n}{i})] is$
User Avatar
Link Copied!