A topological view on algebraic computation models

Eike Neumann, Arno Pauly*

*Corresponding author for this work

    Research output: Contribution to journalArticlepeer-review


    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.
    Original languageEnglish
    Pages (from-to)1-22
    Number of pages22
    JournalJournal of Complexity
    Early online date31 Aug 2017
    Publication statusPublished - Feb 2018

    Bibliographical note

    © 2017, Elsevier. Licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/


    • Analytic machine
    • BSS-machine
    • Computable analysis
    • Effective DST
    • Solvability complexity index
    • Weihrauch reducibility


    Dive into the research topics of 'A topological view on algebraic computation models'. Together they form a unique fingerprint.

    Cite this