Comment Comment by Jaxan > you can't have upper bound without breaking Turing and solving halting problemNot in general, no. But for a fixed n, you can. For example, people have settled the exact value of BB(5). parent Jaxan 18 days ago
Not in general, no. But for a fixed n, you can. For example, people have settled the exact value of BB(5).