in Algorithms
722 views
0 votes
0 votes

in Algorithms
722 views

4 Comments

the set of all languages is uncountable, you can proof this using diagonalization method.

rest all are countable.
1
1
What does countable infinite mean? If they are countable then how can they be infinite?
0
0
a set is called countably infinite, if we can have one-one correspondence b/w element of a set and a natural numbers.
1
1
edited by
always use cantor's theorem for this type of question
2
2

Subscribe to GO Classes for GATE CSE 2022

Please log in or register to answer this question.

Related questions