Timeline for Is Turing degree actually useful in real life?
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 24 at 13:34 | comment | added | provocateur | It's not really true that when watching the spinning wheel on the mac and deciding what to do I'm trying to solve the Halting problem. I'm pretty convinced, after all, that if the wheel keeps spinning for an hour that I should restart the computer. | |
| Oct 6 at 11:05 | history | edited | user904963 | CC BY-SA 4.0 |
Fixed typo (where was supposed to be were)
|
| Feb 16, 2014 at 1:23 | vote | accept | CommunityBot | ||
| Feb 16, 2014 at 1:22 | vote | accept | CommunityBot | ||
| Feb 16, 2014 at 1:23 | |||||
| Feb 15, 2014 at 2:33 | history | made wiki | Post Made Community Wiki by Todd Trimble | ||
| Feb 14, 2014 at 23:37 | comment | added | François G. Dorais | @Joshua: From my work in reverse mathematics, I've seen over and over that techniques from computability theory have very broad appicability. Even though many haven't been applied yet, I think it's only a matter of time before more advanced techniques get applied, in some way or another, to different fields of mathematics. | |
| Feb 14, 2014 at 23:25 | comment | added | Joshua Grochow | @FrançoisG.Dorais: He said the same thing in a class I took from him as an undergrad. I mostly agree with that statement most of the time :). How was it related to my previous comment though? | |
| Feb 14, 2014 at 23:24 | comment | added | François G. Dorais | @Joshua: Gerald Sacks (who was instrumental in the development of Turing degrees) once told me something that I remember every day, namely that theorems aren't that interesting but their proofs are interesting... | |
| Feb 14, 2014 at 23:15 | comment | added | Joshua Grochow | Although formally true, I wouldn't say your last paragraph indicates a lack of applications of Turing degree, but should be taken more positively as a whole range of applications of a slight variant of the notion, namely of Turing p-degrees (i.e. degree under polynomial-time reducibility). | |
| Feb 14, 2014 at 19:49 | history | edited | Bjørn Kjos-Hanssen | CC BY-SA 3.0 |
added 993 characters in body
|
| Feb 14, 2014 at 19:25 | history | edited | Bjørn Kjos-Hanssen | CC BY-SA 3.0 |
added 340 characters in body
|
| Feb 14, 2014 at 19:17 | history | answered | Bjørn Kjos-Hanssen | CC BY-SA 3.0 |