No Cover Image

Journal article 1181 views 188 downloads

A topological view on algebraic computation models

Eike Neumann, Eike Neumann, Arno Pauly Orcid Logo

Journal of Complexity, Volume: 44, Pages: 1 - 22

Swansea University Authors: Eike Neumann, Arno Pauly Orcid Logo

  • models-finalversion.pdf

    PDF | Accepted Manuscript

    Released under the terms of a Creative Commons Attribution Non-Commercial No Derivatives License (CC-BY-NC-ND).

    Download (520.52KB)

Check full text

DOI (Published version): 10.1016/j.jco.2017.08.003

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 conseque...

Full description

Published in: Journal of Complexity
ISSN: 0885-064X
Published: Elsevier BV 2018
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa37369
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2017-12-12T13:49:46Z
last_indexed 2023-01-11T14:12:43Z
id cronfa37369
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2022-12-05T12:50:30.5298191</datestamp><bib-version>v2</bib-version><id>37369</id><entry>2017-12-08</entry><title>A topological view on algebraic computation models</title><swanseaauthors><author><sid>1bf535eaa8d6fcdfbd464a511c1c0c78</sid><firstname>Eike</firstname><surname>Neumann</surname><name>Eike Neumann</name><active>true</active><ethesisStudent>false</ethesisStudent></author><author><sid>17a56a78ec04e7fc47b7fe18394d7245</sid><ORCID>0000-0002-0173-3295</ORCID><firstname>Arno</firstname><surname>Pauly</surname><name>Arno Pauly</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2017-12-08</date><deptcode>SCS</deptcode><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.</abstract><type>Journal Article</type><journal>Journal of Complexity</journal><volume>44</volume><journalNumber/><paginationStart>1</paginationStart><paginationEnd>22</paginationEnd><publisher>Elsevier BV</publisher><placeOfPublication/><isbnPrint/><isbnElectronic/><issnPrint>0885-064X</issnPrint><issnElectronic/><keywords>TTE, Computable analysis, BSS-machines</keywords><publishedDay>1</publishedDay><publishedMonth>2</publishedMonth><publishedYear>2018</publishedYear><publishedDate>2018-02-01</publishedDate><doi>10.1016/j.jco.2017.08.003</doi><url>http://publications.aston.ac.uk/id/eprint/31427/</url><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><funders/><projectreference/><lastEdited>2022-12-05T12:50:30.5298191</lastEdited><Created>2017-12-08T13:10:17.1351015</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Eike</firstname><surname>Neumann</surname><order>1</order></author><author><firstname>Eike</firstname><surname>Neumann</surname><order>2</order></author><author><firstname>Arno</firstname><surname>Pauly</surname><orcid>0000-0002-0173-3295</orcid><order>3</order></author></authors><documents><document><filename>0037369-08122017134446.pdf</filename><originalFilename>models-finalversion.pdf</originalFilename><uploaded>2017-12-08T13:44:46.7270000</uploaded><type>Output</type><contentLength>577175</contentLength><contentType>application/pdf</contentType><version>Accepted Manuscript</version><cronfaStatus>true</cronfaStatus><embargoDate>2019-08-31T00:00:00.0000000</embargoDate><documentNotes>Released under the terms of a Creative Commons Attribution Non-Commercial No Derivatives License (CC-BY-NC-ND).</documentNotes><copyrightCorrect>true</copyrightCorrect><language>eng</language></document></documents><OutputDurs/></rfc1807>
spelling 2022-12-05T12:50:30.5298191 v2 37369 2017-12-08 A topological view on algebraic computation models 1bf535eaa8d6fcdfbd464a511c1c0c78 Eike Neumann Eike Neumann true false 17a56a78ec04e7fc47b7fe18394d7245 0000-0002-0173-3295 Arno Pauly Arno Pauly true false 2017-12-08 SCS 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. Journal Article Journal of Complexity 44 1 22 Elsevier BV 0885-064X TTE, Computable analysis, BSS-machines 1 2 2018 2018-02-01 10.1016/j.jco.2017.08.003 http://publications.aston.ac.uk/id/eprint/31427/ COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2022-12-05T12:50:30.5298191 2017-12-08T13:10:17.1351015 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Eike Neumann 1 Eike Neumann 2 Arno Pauly 0000-0002-0173-3295 3 0037369-08122017134446.pdf models-finalversion.pdf 2017-12-08T13:44:46.7270000 Output 577175 application/pdf Accepted Manuscript true 2019-08-31T00:00:00.0000000 Released under the terms of a Creative Commons Attribution Non-Commercial No Derivatives License (CC-BY-NC-ND). true eng
title A topological view on algebraic computation models
spellingShingle A topological view on algebraic computation models
Eike Neumann
Arno Pauly
title_short A topological view on algebraic computation models
title_full A topological view on algebraic computation models
title_fullStr A topological view on algebraic computation models
title_full_unstemmed A topological view on algebraic computation models
title_sort A topological view on algebraic computation models
author_id_str_mv 1bf535eaa8d6fcdfbd464a511c1c0c78
17a56a78ec04e7fc47b7fe18394d7245
author_id_fullname_str_mv 1bf535eaa8d6fcdfbd464a511c1c0c78_***_Eike Neumann
17a56a78ec04e7fc47b7fe18394d7245_***_Arno Pauly
author Eike Neumann
Arno Pauly
author2 Eike Neumann
Eike Neumann
Arno Pauly
format Journal article
container_title Journal of Complexity
container_volume 44
container_start_page 1
publishDate 2018
institution Swansea University
issn 0885-064X
doi_str_mv 10.1016/j.jco.2017.08.003
publisher Elsevier BV
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science
url http://publications.aston.ac.uk/id/eprint/31427/
document_store_str 1
active_str 0
description 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.
published_date 2018-02-01T03:47:03Z
_version_ 1763752251839479808
score 11.013371

Similar Items