Not regular since we not do with finite states .why : every number is seperated by # so we need to remember each N with #. so not done by regular.[ used pumping lemma ]
Not CFL .why : because every number is seperated by # . Here we have no idea how to store two adjacent number seperated by #. cant done by stack.
yes recursive Halting turing machine also can do computaton like +,- etc so here we can get language given.
