I know that set of all deciders is countable I am wondering whether it is infinite.in other words can we prove that the set of recursive languages is infinite The above question has small 000000000000000000000000000000000000000000000 个性签名： 无 分享到： 看科技短视频，用ZOL APP 举报 只看此人 回复 评分 kjhjhhhgh 精华 帖子 kjhjhhhgh （ID:kjhjhhhgh） We are provided the language Let us investigate the type of strings in
We see that has such strings whose length is either zero or can be expressed as a sum of prime numbers Now let us consider first the set of all strings of even length So given any string of even length, we can write it as a concatenation of or more number strings of length , but we see that. One of the answers in a reading exercise in my class today was Which was the value of the highest denomination note ever issued
OPEN
