There is no such restriction, as long as the TM has a initial state, transition function, input alphabet, set of all states, tape alphabet, a blank symbol, and a set of final states. It will be always be a TM.
Note: the set of final states can always be PHI or null. But there will always be an initial state.
PS: If you found the answer to be helpful, please consider upvoting !