Timeline for BPP being equal to #P under Oracle
Current License: CC BY-SA 2.5
19 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 4, 2010 at 8:33 | comment | added | Niel de Beaudrap | @Anweshi: with due respect, your proposition that CS theory is 'really' part of the same 'egg' as information retrieval and network protocols --- or that CS theorists are substantially more likely than number theorists to know how to set up a website such as MO --- seems to me to indicate that you aren't strongly familiar with either the theoretical or the practical parts of CS. One may as well conflate physicists with mechanical engineers. We simply have divergent priorities, and a different knowledge-base, from your typical programmer. | |
| May 4, 2010 at 8:26 | comment | added | Niel de Beaudrap | I do not see any reason why there should be a separate "overflow" for complexity theory and allied branches of CS, any more than there should be a separate one for combinatorics. (Indeed, combinatorics and complexity theory have much more common ground than either has with e.g. algebraic topology.) --- Where does one make the cut? As a rough approximation, I would say that MathOverflow should accomodate questions from any field whose pactitioners spend most of their time writing Lemmata in LaTeX. | |
| Jan 5, 2010 at 11:00 | comment | added | Anweshi | You know what I meant, there should be a site called csoverflow.net or complexityoverflow.net .. I didn't ask the OP to go and post in stackoverflow. And yes, I also understand the distinction between computational complexity and the rest of computer science. But you have to put an egg in some basket. You cannot break it in two and put in two baskets. | |
| Jan 5, 2010 at 8:09 | vote | accept | Opt | ||
| Jan 5, 2010 at 3:23 | comment | added | Reid Barton | If I were the one asking the question I would be sorely tempted to post in on stackoverflow saying "People at mathoverflow suggested I ask this question here..." :) | |
| Jan 5, 2010 at 3:14 | answer | added | Rune | timeline score: 10 | |
| Jan 5, 2010 at 3:04 | comment | added | Rune | Complexity theory in particular is far closer to mathematics than it is to standard CS stuff like programming, compilers, databases, operating systems, etc. As such it is completely appropriate to have complexity theory questions on MO. | |
| Jan 5, 2010 at 0:22 | comment | added | Anweshi | Yeah, if as Ilya says there is really no stackoverflow site for CS, then it could be posted here. But there really ought to be one. And it is not that Cs guys cannot make one. | |
| Jan 4, 2010 at 23:44 | comment | added | Anweshi | Every science is part of philosophy. Try posting a question from here in one of the philosophy forums. There is reason why universities run different departments for math and cs sometimes, though cs has a lot in common with math. | |
| Jan 4, 2010 at 23:36 | comment | added | Anweshi | Well, I had sorta imagined that since CS guys are so far ahead of mathematics guys in the matter of computer applications and web development, there should be a lot more and much better and focussed resources for CS existing already. | |
| Jan 4, 2010 at 23:11 | comment | added | aorq | @Anweshi: You think computational complexity theory is not appropriate for MO? Wow. | |
| Jan 4, 2010 at 19:01 | comment | added | Ilya Nikokoshev | Theoretical CS is part of mathematics, and there is no MathOverflow for computer science (SO is more applied), so I think the question fits MO well. Also, the Complexity Zoo Veterinarian is Greg Kuperberg. | |
| Jan 4, 2010 at 18:54 | comment | added | Anweshi | When there are numerous other resources for computer science, are such questions appropriate for MO? | |
| Jan 4, 2010 at 18:53 | comment | added | Ryan Budney | Bounded error Probabilistic Polynomial time. See: qwiki.stanford.edu/wiki/Complexity_Zoo:B#bpp | |
| Jan 4, 2010 at 18:47 | history | edited | Opt | CC BY-SA 2.5 | added 322 characters in body |
| Jan 4, 2010 at 18:34 | comment | added | Mariano Suárez-Álvarez | While surely anyone who will be able to answer this will know what BPP is, maybe a very succint description might be of quite some help to us mere humans :P | |
| Jan 4, 2010 at 18:29 | history | edited | Opt | CC BY-SA 2.5 | added 58 characters in body; added 6 characters in body |
| Jan 4, 2010 at 18:23 | history | edited | Opt | CC BY-SA 2.5 | added 261 characters in body |
| Jan 4, 2010 at 18:17 | history | asked | Opt | CC BY-SA 2.5 |