Article contents
Unsolvability of the knot problem for surface complexes
Published online by Cambridge University Press: 17 April 2009
Abstract
It is shown that the problem of deciding whether a polygonal curve c in a finite surface complex K is knotted in K is complete recursively enumerable, and hence unsolvable.
- Type
- Research Article
- Information
- Bulletin of the Australian Mathematical Society , Volume 20 , Issue 1 , January 1979 , pp. 131 - 137
- Copyright
- Copyright © Australian Mathematical Society 1979
References
- 2
- Cited by