On Tuesday, December 18, 2018 at 2:28:54 PM UTC-6, Brent wrote:
> how do you judge the truth of unprovable propositions? > > Brent > The (fictional, maybe not a real one anywhere) back hole computer BHC (unbounded memory, executes an unbounded number of operations in a bounded time T) can give you the answer to Goldbach's conjecture. The BHC returns "false" in time < T if a counterexample is found. If time T has passed and nothing is returned then assume "true". But you have to trust the BHC. - pt -- You received this message because you are subscribed to the Google Groups "Everything List" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/everything-list. For more options, visit https://groups.google.com/d/optout.
