A topological view on algebraic computation models
Logic in Computer Science
2017-03-20 v2
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.
Keywords
Cite
@article{arxiv.1602.08004,
title = {A topological view on algebraic computation models},
author = {Eike Neumann and Arno Pauly},
journal= {arXiv preprint arXiv:1602.08004},
year = {2017}
}