A topological view on algebraic computation models

Eike Neumann, Arno Pauly

Research output: Contribution to journalArticlepeer-review

12 Citations (Scopus)
137 Downloads (Pure)


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
JournalJournal of Complexity
Early online date31 Aug 2017
Publication statusE-pub ahead of print - 31 Aug 2017


  • weihrauch reducibility
  • BSS-machine
  • analytic machine
  • effective DST
  • solvability complexity index
  • computable analysis


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

Cite this