Timeline for Is modern computability theory "really" about algorithms?
Current License: CC BY-SA 2.5
10 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Apr 13, 2011 at 20:47 | vote | accept | Michelle B | ||
Apr 7, 2011 at 20:23 | answer | added | Timothy Chow | timeline score: 17 | |
Apr 7, 2011 at 17:48 | comment | added | Michelle B | Thank you Gerhard, Carl, and Jason for providing me with some things to think about. (And Francois Dorais also for the joke!) My initial studies in this area were interesting, but I found it hard to see the bigger picture, as nobody at my institution is active in this subject and(again, I hope that this does not come across as too naive) it seems that this area is very "spread out" for its size(in terms of researchers, institutions, places to get an overview, etc), even compared to areas like, say, model theory. I will wait to see if any more answers come in, but thanks again. | |
Apr 7, 2011 at 17:34 | answer | added | Bjørn Kjos-Hanssen | timeline score: 2 | |
Apr 7, 2011 at 17:31 | vote | accept | Michelle B | ||
Apr 7, 2011 at 17:31 | |||||
Apr 7, 2011 at 11:48 | answer | added | Carl Mummert | timeline score: 9 | |
Apr 7, 2011 at 2:03 | answer | added | Jason | timeline score: 2 | |
Apr 6, 2011 at 23:52 | comment | added | François G. Dorais | "What would I need a computer for? All I care about is non-computable!" -- a joke told to me by a computability theorist. | |
Apr 6, 2011 at 20:45 | comment | added | Gerhard Paseman | It depends on your idea of what constitutes "modern computatbility theory". Do you want quantum computing, transfinite computation, abstract recursion theory? Or perhaps notions on how to use degrees of randomness in computation (or in logic)? You might expand upon your own ideas before soliciting those of others. Gerhard "Ask Me About System Design" Paseman, 2011.04.06 | |
Apr 6, 2011 at 20:25 | history | asked | Michelle B | CC BY-SA 2.5 |