Real Computable Manifolds and Homotopy Groups

Authors:
Wesley Calvert;Russell Miller
Affiliations:
Department of Mathematics and Statistics, Murray State University, Murray, U.S.A. 42071;Queens College of CUNY, Flushing, NY, USA 11367 and The CUNY Graduate Center, New York, NY, USA 10016
Venue:
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
Year:
2009

Citing 6
Cited 0

Recursively enumerable sets and degrees

Recursively enumerable sets and degrees
Complexity and real computation

Complexity and real computation
The complexity of semilinear problems in succinct representation

Computational Complexity
The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties

Foundations of Computational Mathematics
On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety

Journal of Complexity
Locally Computable Structures

CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using the model of real computability developed by Blum, Cucker, Shub, and Smale, we investigate the difficulty of determining the answers to several basic topological questions about manifolds. We state definitions of real-computable manifold and of real-computable paths in such manifolds, and show that, while BSS machines cannot in general decide such questions as nullhomotopy and simple connectedness for such structures, there are nevertheless real-computable presentations of paths and homotopy equivalence classes under which such computations are possible.