Finite computability of Postnikov complexes
From MaRDI portal
Publication:768506
DOI10.2307/1969664zbMath0077.16804OpenAlexW2314051058MaRDI QIDQ768506
Publication date: 1957
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1969664
Related Items (max. 100)
Constructive algebraic topology ⋮ Algorithmic solvability of the lifting-extension problem ⋮ Remarks on the realizability of Whitehead product ⋮ Computability of homotopy groups of nilpotent complexes ⋮ Computing All Maps into a Sphere ⋮ A Bousfield-Kan algorithm for computing the \textit{effective} homotopy of a space ⋮ Computing homotopy classes for diagrams ⋮ Rational homotopy type and computability ⋮ Hardness of embedding simplicial complexes in \(\mathbb R^d\) ⋮ The computation of the Betti numbers of an elliptic space is an NP-hard problem ⋮ An implementation of effective homotopy of fibrations ⋮ Extendability of continuous maps is undecidable ⋮ Automatic generation of cuts on large-sized meshes for the \(T-\Omega \) geometric eddy-current formulation ⋮ Fifty years of homotopy theory ⋮ Effective homotopy of fibrations ⋮ Are two given maps homotopic? An algorithmic viewpoint ⋮ Fibrations and geometric realizations ⋮ An algorithm computing homotopy groups. ⋮ The periodicity theorem for the classical groups and some of its applications ⋮ Cohomology operations, and obstructions to extending continuous functions ⋮ Computing all maps into a sphere ⋮ Computing simplicial representatives of homotopy group elements ⋮ Interpolation, the rudimentary geometry of spaces of Lipschitz functions, and geometric complexity ⋮ \(p\)-adic homotopy theory ⋮ La théorie des fonctions récursives et ses applications. (Exposé d'information générale)
This page was built for publication: Finite computability of Postnikov complexes
