can we say languages which are not R.E as undecidable but partially decidable??
example:
sigma={0,1] and L={<M>| M is a TM that accepts a string of length 2014 } a/c to rice theoram it should be non R.E (Tyes is subset of Tno)but answer is
"Undecidable but partially decidable"
same for the state entry problem
L= {<M> | L is regular?} etc
I know all are undecidable but how they are partially decidable if they are not even R.E