代数计算模型的拓扑观
A topological view on algebraic computation models
摘要:
我们调查的拓扑方面的一些代数计算模型,特别是BSS模型。我们的结果可以被看作是如何不同的BSS可计算性和可计算性的意义上的可计算分析的界限。这个框架是Weihrauch还原。由于我们的特征,我们建立的可解性复杂性指数(大部分)是独立的计算模型,因此有共同点在BSS和TTE设置之间的不可计算性的研究。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。