Timeline for computing homotopy type
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 20, 2016 at 18:15 | comment | added | Ronnie Brown | The following answer may be relevant: mathoverflow.net/questions/51091/computing-homotopies/… . But 2-dimensional rewriting is probably not algorithmically solvable. On the other hand, J.H.C. Whitehead's ideas on Simple Homotopy Theory (SHT) were thought up in terms of generalising to higher dimensions Tietze transformations in group theory. The notions in SHT of expansions and collapses give possible connections with the combinatorial use of "shellability". | |
| Feb 8, 2011 at 19:07 | answer | added | Ryan Budney | timeline score: 4 | |
| Feb 8, 2011 at 18:10 | comment | added | Fernando Muro | Such an algorithm would imply a solution to the word problem! | |
| Feb 8, 2011 at 17:10 | history | asked | Peter Franek | CC BY-SA 2.5 |