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 ?
Edit : The above question has small mistake as pointed out in one of the comments .. Since every recursive language has infinitely many deciders .. the two questions are indeed not equivalent . For people who are wondering why there are infintely many deciders , take a decider D and keep on adding some useless states, transitions, tape symbols so that you get new decider with a larger description than D and since you can continue this process indefinitely , there exists infinitely many deciders for a recursive language.