The Computability Problem in Algebraic Topology
暂无分享,去创建一个
[1] D. Ravenel. Complex Cobordism and Stable Homotopy Groups of Spheres , 1986 .
[2] John McCarthy,et al. A BASIS FOR A MATHEMATICAL THEORY OF COMPUTATION 1) , 2018 .
[3] J. Adams,et al. ON THE COBAR CONSTRUCTION. , 1956, Proceedings of the National Academy of Sciences of the United States of America.
[4] A. Church. The calculi of lambda-conversion , 1941 .
[5] Samuel Eilenberg,et al. Homology and fibrations I Coalgebras, cotensor product and its derived functors , 1965 .
[6] Nancy Hingston,et al. Equivariant Morse theory and closed geodesics , 1984 .
[7] Edgar H. Brown,et al. FINITE COMPUTABILITY OF POSTNIKOV COMPLEXES , 1957 .
[8] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[9] Alonzo Church,et al. A note on the Entscheidungsproblem , 1936, Journal of Symbolic Logic.
[10] A. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .
[11] Jon P. May. Simplicial objects in algebraic topology , 1993 .