376 views

1 Answer

0 votes
0 votes

no atleast now i can say they don't have one to one correspondance . same language can define more than one problem. one problem can be a subset of another problem so more than one problem can map to more than language for example. all number divisible by 9 will be divisible by 3 also if n>9. so language defining one problem can also define another problem so no one to one correspondance possible 

Related questions

0 votes
0 votes
1 answer
1
surbhijain93 asked Sep 7, 2018
2,627 views
Hi,Could someone please tell the difference between computability and decidability?Thanks
3 votes
3 votes
1 answer
4
Utkarsh Anand asked Jul 31, 2017
1,403 views
Are Turing decidable languages are closed under Complementation, Reversal, Homomorphism, Inverse Homomorphism and Substitution?