Journal article 1039 views
Interval Domains and Computable Sequences: A Case Study of Domain Reductions
The Computer Journal, Volume: 56, Issue: 1, Pages: 45 - 52
Swansea University Author: Jens Blanck
Full text not available from this repository: check for access using links below.
DOI (Published version): 10.1093/comjnl/bxs121
Abstract
The paper studies the spectrum of different computability concepts that occur for sequences of real data. In many circumstances, computability is stable with respect to some data, but this is often dependent on the operations considered. In particular, Mostowski showed in an early paper that there a...
Published in: | The Computer Journal |
---|---|
ISSN: | 0010-4620 1460-2067 |
Published: |
2013
|
Online Access: |
Check full text
|
URI: | https://cronfa.swan.ac.uk/Record/cronfa13741 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
first_indexed |
2013-07-23T12:10:49Z |
---|---|
last_indexed |
2018-02-09T04:44:38Z |
id |
cronfa13741 |
recordtype |
SURis |
fullrecord |
<?xml version="1.0"?><rfc1807><datestamp>2015-10-14T16:23:03.0910454</datestamp><bib-version>v2</bib-version><id>13741</id><entry>2012-12-17</entry><title>Interval Domains and Computable Sequences: A Case Study of Domain Reductions</title><swanseaauthors><author><sid>704f3ce6b65d931e1a86a03e9e30d639</sid><ORCID>0000-0001-9656-1352</ORCID><firstname>Jens</firstname><surname>Blanck</surname><name>Jens Blanck</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2012-12-17</date><deptcode>SCS</deptcode><abstract>The paper studies the spectrum of different computability concepts that occur for sequences of real data. In many circumstances, computability is stable with respect to some data, but this is often dependent on the operations considered. In particular, Mostowski showed in an early paper that there are many incompatible notions of computability for sequences of data. We use the notions of domain representations and domain representations to clarify the situation.</abstract><type>Journal Article</type><journal>The Computer Journal</journal><volume>56</volume><journalNumber>1</journalNumber><paginationStart>45</paginationStart><paginationEnd>52</paginationEnd><publisher/><issnPrint>0010-4620</issnPrint><issnElectronic>1460-2067</issnElectronic><keywords>computable sequences, domain representations, domain reductions</keywords><publishedDay>31</publishedDay><publishedMonth>12</publishedMonth><publishedYear>2013</publishedYear><publishedDate>2013-12-31</publishedDate><doi>10.1093/comjnl/bxs121</doi><url/><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2015-10-14T16:23:03.0910454</lastEdited><Created>2012-12-17T17:29:43.4782899</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>J</firstname><surname>Blanck</surname><order>1</order></author><author><firstname>Jens</firstname><surname>Blanck</surname><orcid>0000-0001-9656-1352</orcid><order>2</order></author></authors><documents/><OutputDurs/></rfc1807> |
spelling |
2015-10-14T16:23:03.0910454 v2 13741 2012-12-17 Interval Domains and Computable Sequences: A Case Study of Domain Reductions 704f3ce6b65d931e1a86a03e9e30d639 0000-0001-9656-1352 Jens Blanck Jens Blanck true false 2012-12-17 SCS The paper studies the spectrum of different computability concepts that occur for sequences of real data. In many circumstances, computability is stable with respect to some data, but this is often dependent on the operations considered. In particular, Mostowski showed in an early paper that there are many incompatible notions of computability for sequences of data. We use the notions of domain representations and domain representations to clarify the situation. Journal Article The Computer Journal 56 1 45 52 0010-4620 1460-2067 computable sequences, domain representations, domain reductions 31 12 2013 2013-12-31 10.1093/comjnl/bxs121 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2015-10-14T16:23:03.0910454 2012-12-17T17:29:43.4782899 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science J Blanck 1 Jens Blanck 0000-0001-9656-1352 2 |
title |
Interval Domains and Computable Sequences: A Case Study of Domain Reductions |
spellingShingle |
Interval Domains and Computable Sequences: A Case Study of Domain Reductions Jens Blanck |
title_short |
Interval Domains and Computable Sequences: A Case Study of Domain Reductions |
title_full |
Interval Domains and Computable Sequences: A Case Study of Domain Reductions |
title_fullStr |
Interval Domains and Computable Sequences: A Case Study of Domain Reductions |
title_full_unstemmed |
Interval Domains and Computable Sequences: A Case Study of Domain Reductions |
title_sort |
Interval Domains and Computable Sequences: A Case Study of Domain Reductions |
author_id_str_mv |
704f3ce6b65d931e1a86a03e9e30d639 |
author_id_fullname_str_mv |
704f3ce6b65d931e1a86a03e9e30d639_***_Jens Blanck |
author |
Jens Blanck |
author2 |
J Blanck Jens Blanck |
format |
Journal article |
container_title |
The Computer Journal |
container_volume |
56 |
container_issue |
1 |
container_start_page |
45 |
publishDate |
2013 |
institution |
Swansea University |
issn |
0010-4620 1460-2067 |
doi_str_mv |
10.1093/comjnl/bxs121 |
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 |
document_store_str |
0 |
active_str |
0 |
description |
The paper studies the spectrum of different computability concepts that occur for sequences of real data. In many circumstances, computability is stable with respect to some data, but this is often dependent on the operations considered. In particular, Mostowski showed in an early paper that there are many incompatible notions of computability for sequences of data. We use the notions of domain representations and domain representations to clarify the situation. |
published_date |
2013-12-31T03:15:42Z |
_version_ |
1763750280131772416 |
score |
11.027871 |