A topological view on algebraic computation models
arXiv:1602.08004
Abstract
We investigate the topological aspects of some algebraic computation models, in particular the BSS-model. Our results can be seen as bounds on how different BSS-computability and computability in the sense of computable analysis can be. The framework for this is Weihrauch reducibility. As a consequence of our characterizations, we establish that the solvability complexity index is (mostly) independent of the computational model, and that there thus is common ground in the study of non-computability between the BSS and TTE setting.
References in corpus (8)
- The Bolzano-Weierstrass Theorem is the Jump of Weak König's Lemma
- On the algebraic structure of Weihrauch degrees
- The degree structure of Weihrauch-reducibility
- Real Hypercomputation and Continuity
- Revising Type-2 Computation and Degrees of Discontinuity
- Turing machines on represented sets, a model of computation for Analysis
- Infinite Oracle Queries in Type-2 Machines (Extended Abstract)
- Weihrauch-completeness for layerwise computability