I actually thought of this in the sense of statements being partially true: We know godels incompleteness theorem (most likely you know it better than I do). I’m pretty sure it’s provable that BB(10^10) does not have a lower bound. However, if you simulate minds/civilizations/AI/something, and ask them to bet on mathematical theorems (at first with less resources so they don’t just solve it), and then ask them whether they think a certain unprovable theorem is true and let them bet on it, you might somehow know how true an unprovable statement is? I realize this comment is poorly written but I hope you understand my intuition.
I actually thought of this in the sense of statements being partially true: We know godels incompleteness theorem (most likely you know it better than I do). I’m pretty sure it’s provable that BB(10^10) does not have a lower bound. However, if you simulate minds/civilizations/AI/something, and ask them to bet on mathematical theorems (at first with less resources so they don’t just solve it), and then ask them whether they think a certain unprovable theorem is true and let them bet on it, you might somehow know how true an unprovable statement is? I realize this comment is poorly written but I hope you understand my intuition.