Timeline for Has decidability got something to do with primes?
Current License: CC BY-SA 2.5
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 7, 2018 at 13:45 | comment | added | Robert Frost | I'm enormously pleased to see mention of the ring with unboundedly many primes in which all are $1$ modulo $4$, as I have harboured a vague gut feeling there's some as yet unfound relation between the "positive" square roots and the "negative" square roots in $\Bbb{Z}_2^{\times}$ which extends the idea of $2$ being the "most prime prime"; and extends onwards to define limit points in $\Bbb{Z}_2^{\times}$ which end $\ldots01$ as opposed to $\ldots11$ as "special" in logic. | |
| Sep 24, 2013 at 19:25 | history | wiki removed | François G. Dorais | ||
| Apr 11, 2010 at 3:04 | history | edited | François G. Dorais | CC BY-SA 2.5 |
reworded conclusion
|
| Apr 10, 2010 at 19:03 | comment | added | François G. Dorais | Note that they don't mention the connection with Robinson's Q, computability, and incompleteness. | |
| Apr 10, 2010 at 19:01 | comment | added | abcdxyz | I was surprised that Wilkie, Macintyre and Marker wrote something on this topic. I thought they are model theorists and this question is more toward recursion theory. | |
| Apr 10, 2010 at 18:30 | history | undeleted | François G. Dorais | ||
| Apr 10, 2010 at 18:30 | history | deleted | François G. Dorais | ||
| Apr 10, 2010 at 18:19 | history | answered | François G. Dorais | CC BY-SA 2.5 |