As we can encode $every \,\, Turing\,\, machine$ using $0's$ and $1's$. So weather
$L_{B} = \left \{ < M > | M\, is\, a\, valid \,Turing\, Machine \right \}$
is $decidable$ or not will depend upon the type of encoding we will use for a Turing machine.