yes Turing machine can accept null string
Say we can think turing machine as a computer , then it accepts every string and even NULL string. Then it is Recursive
If it accepts only NULL string and no other string , then it will be Recursive Enumerable but not recursive.
We can represent NULL string only with
Example X={M| L(M)={}}
Complement of X i.e. X' which accepts all string other string