The computability problem in algebraic topology (Q1328492): Difference between revisions

It is proved that almost every reasonable computability problem in homological algebra and algebraic topology has a positive solution. Though lots of computations carried out in algebraic topology can be reduced to successive applications of cone exact sequences and Serre and Eilenberg-Moore spectral sequences, however, with the techniques explained in this paper, these computation methods become actual algorithms open to theoretical (computability) and concrete applications (finding on machines homology or homotopy groups unknown until now).