Let L={⟨M⟩∣M is a Turing machine that accepts a string of length 2014}
Take UTM and run all Strings using dovetailing method till 2014 length we can say Yes when alteast one of them accept but we cannot say no since thier are infinite strings to check . so Recursively enumerable (undecidable)(i.e. We cannot say no Only say yes.)