Apologies if this is a silly question, my experience is mainly with graph theory and I can't seem to find any information about what I've been thinking about.
The 2-symbol n-state halting Turing machine, M, that achieves BB(n) is conventionally assumed to start on a blank unbounded tape.
My question is:
Is it possible there could be some other 2-symbol n-state halting machine T which runs for steps more than BB(n) if it is started on some non-blank tape?
Or at the very least, what is known about this sort of question?
Thank you for any help, I've not been able to find anything online about this.