{1^n | n finite integer and >1}, is this language recursive?
I'm not sure how to prove that a language is recursive, I only know that there should be a TM that accepts any finite input and then halts, but how can I prove that here?
I tried to set n to various values and clearly all of them will led at the end to 1, so does this mean that it halted and accepted the input?