> you can't have upper bound without breaking Turing and solving halting problem

Not in general, no. But for a fixed n, you can. For example, people have settled the exact value of BB(5).