Timeline for Homology is computable because it is stable under suspension
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 17, 2011 at 21:16 | vote | accept | Beren Sanders | ||
| Oct 8, 2010 at 12:14 | comment | added | Lennart Meier | @Thierry: in which way are they computable? Is there an algorithm (in some sense) which produces out of a given set of equations a CW-structure? | |
| Oct 8, 2010 at 11:15 | comment | added | Sean Tilson | I think the OP might even mean tractable in a computational way. Glad people mentioned $\pi^S_0$. | |
| Oct 7, 2010 at 12:33 | comment | added | Thierry Zell | Re (2): such CW-structures are computable. Of course this is not an easy computation. But "computable" and "tractable" are very different animals. | |
| Oct 7, 2010 at 8:37 | history | answered | Lennart Meier | CC BY-SA 2.5 |