String Theory Does Not Win a Nobel, and I Win a Long Bet

Re:String Theory Does Not Win a Nobel, and I Win a Long Bet by drdeca on Thursday October 10, 2019 @02:36AM (#21211580)

Presburger arithmetic is a decidable theory. "This means it is possible to algorithmically determine, for any sentence in the language of Presburger arithmetic, whether that sentence is provable from the axioms of Presburger arithmetic."

If you don't understand what the incompleteness theorems say, be wary of citing them.

[ Parent | on HN ]

Re:String Theory Does Not Win a Nobel, and I Win a Long Bet by wuliwong on Thursday October 10, 2019 @12:21PM (#21216317)

Not sure why I should be "wary." I was asking a question. If one should be wary of asking questions about something how could they ever learn?

[ Parent | on HN ]

Re:String Theory Does Not Win a Nobel, and I Win a Long Bet by drdeca on Thursday October 10, 2019 @04:10PM (#21218657)

Sorry, yes, good point

[ Parent | on HN ]

[dead]

Re:String Theory Does Not Win a Nobel, and I Win a Long Bet by drdeca on Thursday October 10, 2019 @06:16PM (#21219733)

I wasn’t suggesting that they would. I was warning against over-application/interpretation by giving an example of something one might not expect if one interprets the theorems too broadly.

[ Parent | on HN ]