Extendability of continuous maps is undecidable
From MaRDI portal
Undecidability and degrees of sets of sentences (03D35) Homotopy groups of special spaces (55Q52) Simplicial sets and complexes in algebraic topology (55U10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Recommendations
- Extending continuous maps, polynomiality and undecidability
- Computing all maps into a sphere
- Decidability of the extension problem for maps into odd-dimensional spheres
- Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension
- Algorithmic solvability of the lifting-extension problem
Cites work
- Algebraic models for homotopy types
- Algorithmic unsolvability of the triviality problem for multidimensional knots
- An algorithm computing homotopy groups.
- Cohomology operations, and obstructions to extending continuous functions
- Computability Theory and Differential Geometry
- Computing all maps into a sphere
- Computing spectral sequences
- Constructive algebraic topology
- Effective algebraic topology
- Finite computability of Postnikov complexes
- scientific article; zbMATH DE number 4131262 (Why is no real title available?)
- scientific article; zbMATH DE number 425858 (Why is no real title available?)
- scientific article; zbMATH DE number 2125640 (Why is no real title available?)
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 44585 (Why is no real title available?)
- scientific article; zbMATH DE number 3631581 (Why is no real title available?)
- scientific article; zbMATH DE number 1342334 (Why is no real title available?)
- scientific article; zbMATH DE number 545277 (Why is no real title available?)
- scientific article; zbMATH DE number 206022 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 2191967 (Why is no real title available?)
- scientific article; zbMATH DE number 3235051 (Why is no real title available?)
- ON THE COBAR CONSTRUCTION
- On the Homotopy Groups of the Union of Spheres
- Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension
- Polynomial-time homology for simplicial Eilenberg-MacLane spaces
- Questions of decidability and undecidability in Number Theory
- Stable homotopy groups of spheres. A computer-assisted approach
- Survey article: an elementary illustrated introduction to simplicial sets
- The computability problem in algebraic topology
Cited in
(18)- Solving equations and optimization problems with uncertainty
- Plato's cave and differential forms
- Are two given maps homotopic? An algorithmic viewpoint
- Computing simplicial representatives of homotopy group elements
- Algorithmic solvability of the lifting-extension problem
- Polynomial-time homology for simplicial Eilenberg-MacLane spaces
- Extendability of simplicial maps is undecidable
- scientific article; zbMATH DE number 4131262 (Why is no real title available?)
- Computing all maps into a sphere
- CONTINUOUS EXTENSIONS ARE NOT HÖLDER
- Decidability of the extension problem for maps into odd-dimensional spheres
- Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension
- Extending continuous maps, polynomiality and undecidability
- Computing homotopy classes for diagrams
- Rational homotopy type and computability
- Counting vanishing matrix-vector products
- Counting vanishing matrix-vector products
- Geometric embeddability of complexes is \(\exists\mathbb{R}\)-complete
This page was built for publication: Extendability of continuous maps is undecidable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2441584)
