Help with proving a language is in R , RE\R or outside RE
 

Hi, I'm having trouble with reductions and classifying the following language: L ={ ?w??* Tm(|w|) = c } That is, L is a language of turing machine encodings such that for any input w the runtime of the machine is a constant c. The goal is to classify the language - whether its in R,...