Timeline for Why is every finite set Diophantine? [closed]
Current License: CC BY-SA 2.5
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 25, 2015 at 12:30 | history | closed |
user9072 Stefan Kohl♦ Felipe Voloch Christian Remling Ilya Bogdanov |
Not suitable for this site | |
| Oct 24, 2015 at 12:29 | review | Close votes | |||
| Oct 25, 2015 at 12:30 | |||||
| Jan 22, 2010 at 11:52 | comment | added | Qiaochu Yuan | Yes, but the methods described in the answers don't require any knowledge of the work around Matiyasevich's theorem. (Also, to nitpick, it is not generally necessary to write something down to show it exists.) | |
| Jan 22, 2010 at 3:11 | comment | added | Xander Raymond | Forgive me - but that is precisely what I asked. Writing down such a method is both necessary and sufficient for showing that such a method exists. | |
| Jan 22, 2010 at 0:05 | comment | added | Qiaochu Yuan | If what you're mystified about is how to write down a recursively enumerable set using a Diophantine equation, shouldn't you be asking a more general question about how to do that instead? | |
| Jan 21, 2010 at 23:07 | vote | accept | Xander Raymond | ||
| Jan 21, 2010 at 23:03 | vote | accept | Xander Raymond | ||
| Jan 21, 2010 at 23:07 | |||||
| Jan 21, 2010 at 22:54 | answer | added | Brendan Cordy | timeline score: 10 | |
| Jan 21, 2010 at 22:42 | answer | added | Mariano Suárez-Álvarez | timeline score: 7 | |
| Jan 21, 2010 at 22:29 | history | asked | Xander Raymond | CC BY-SA 2.5 |