Timeline for Relationship between computational undecidability and axiomatic undecidability
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 15, 2016 at 16:40 | comment | added | user93785 | projecteuclid.org/download/pdf_1/euclid.bams/1183547548 explicitly constructs a undecidable equation with 21 variable and also give reference to 9 variable case that was mentioned in the question . | |
| Jun 15, 2016 at 6:41 | comment | added | Dominic van der Zypen | Amazing, the statement about the polynomial $p\in\mathbb{Z}[x_1,\ldots,x_9]$ that you mention! Could you give a reference about it? | |
| Jun 12, 2016 at 14:05 | comment | added | user93785 | Thanks. I tried to search for any similar question, but could not find any. This question is clearly a duplicate. | |
| Jun 12, 2016 at 10:40 | comment | added | Joel David Hamkins | A similar question is asked at mathoverflow.net/q/130789/1946, with several good answers. | |
| Jun 12, 2016 at 6:06 | answer | added | Noah Schweber | timeline score: 3 | |
| Jun 12, 2016 at 5:46 | review | First posts | |||
| Jun 12, 2016 at 7:15 | |||||
| Jun 12, 2016 at 5:43 | history | asked | user93785 | CC BY-SA 3.0 |