Timeline for Can we find minimal-diameter metrics without computability?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Oct 29, 2015 at 15:56 | history | bounty ended | CommunityBot | ||
| S Oct 29, 2015 at 15:56 | history | notice removed | CommunityBot | ||
| S Oct 21, 2015 at 14:40 | history | bounty started | Noah Schweber | ||
| S Oct 21, 2015 at 14:40 | history | notice added | Noah Schweber | Draw attention | |
| Oct 21, 2015 at 0:15 | comment | added | Noah Schweber | @AkivaWeinberger Hehehe, this guy: math.uchicago.edu/~shmuel. | |
| Oct 21, 2015 at 0:15 | comment | added | Akiva Weinberger | Wait, what, Weinberger? | |
| Oct 19, 2015 at 15:44 | comment | added | Dave L Renfro | Although I don't know anything about this topic, that didn't stop me from posting a comment about it to the math StackExchange question Connections of theory of computability and Turing machines to other areas of mathematics. Maybe Soare's 3 August 1999 FOM post that I cite, which of course does not answer your question, will provide additional insight into the topic. | |
| Oct 19, 2015 at 4:24 | history | asked | Noah Schweber | CC BY-SA 3.0 |