Algorithmic unsolvability of the triviality problem for multidimensional knots (Q1816439)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithmic unsolvability of the triviality problem for multidimensional knots |
scientific article; zbMATH DE number 949852
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic unsolvability of the triviality problem for multidimensional knots |
scientific article; zbMATH DE number 949852 |
Statements
Algorithmic unsolvability of the triviality problem for multidimensional knots (English)
0 references
25 May 1997
0 references
Summary: We prove that for any fixed \(n\geq 3\) there is no algorithm deciding whether or not a given knot \(f: S^n\to \mathbb{R}^{n+2}\) is trivial. Some related results are also presented.
0 references
algorithm
0 references
knot
0 references
trivial
0 references
