Journal article 1282 views 206 downloads
Computability of Operators on Continuous and Discrete Time Streams
Computability, Volume: 3, Issue: 1, Pages: 9 - 44
Swansea University Author:
John Tucker
-
PDF | Accepted Manuscript
Download (464.26KB)
DOI (Published version): 10.3233/COM-14024
Abstract
A stream is a sequence of data indexed by time. The behaviour of natural and artificial systems can be modelled bystreams and stream transformations. There are two distinct types of data stream: streams based on continuous time and streamsbased on discrete time. Having investigated case studies of b...
Published in: | Computability |
---|---|
Published: |
2014
|
Online Access: |
http://content.iospress.com/articles/computability/com024 |
URI: | https://cronfa.swan.ac.uk/Record/cronfa21548 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
first_indexed |
2015-05-20T02:03:26Z |
---|---|
last_indexed |
2019-07-17T20:18:32Z |
id |
cronfa21548 |
recordtype |
SURis |
fullrecord |
<?xml version="1.0"?><rfc1807><datestamp>2019-07-17T15:41:47.3707829</datestamp><bib-version>v2</bib-version><id>21548</id><entry>2015-05-19</entry><title>Computability of Operators on Continuous and Discrete Time Streams</title><swanseaauthors><author><sid>431b3060563ed44cc68c7056ece2f85e</sid><ORCID>0000-0003-4689-8760</ORCID><firstname>John</firstname><surname>Tucker</surname><name>John Tucker</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2015-05-19</date><deptcode>SCS</deptcode><abstract>A stream is a sequence of data indexed by time. The behaviour of natural and artificial systems can be modelled bystreams and stream transformations. There are two distinct types of data stream: streams based on continuous time and streamsbased on discrete time. Having investigated case studies of both kinds separately, we have begun to combine their study in aunified theory of stream transformers, specified by equations. Using only the standard mathematical techniques of topology, wehave proved continuity properties of stream transformers. Here, in this sequel, we analyse their computability. We use the theoryof computable functions on algebras to design two distinct methods for defining computability on continuous and discrete timestreams of data from a complete metric space. One is based on low-level concrete representations, specifically enumerations, andthe other is based on high-level programming, specifically ‘while’ programs, over abstract data types. We analyse when thesemethods are equivalent. We demonstrate the use of the methods by showing the computability of an analog computing system.We discuss the idea that continuity and computability are important for models of physical systems to be “well-posed”.</abstract><type>Journal Article</type><journal>Computability</journal><volume>3</volume><journalNumber>1</journalNumber><paginationStart>9</paginationStart><paginationEnd>44</paginationEnd><publisher/><keywords>analog computing, computing on streams, many-sorted algebras, topological algebras, stream operators, synchronous concurrent algorithms</keywords><publishedDay>31</publishedDay><publishedMonth>12</publishedMonth><publishedYear>2014</publishedYear><publishedDate>2014-12-31</publishedDate><doi>10.3233/COM-14024</doi><url>http://content.iospress.com/articles/computability/com024</url><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2019-07-17T15:41:47.3707829</lastEdited><Created>2015-05-19T14:11:48.7988323</Created><authors><author><firstname>John</firstname><surname>Tucker</surname><orcid>0000-0003-4689-8760</orcid><order>1</order></author><author><firstname>Jeffrey I</firstname><surname>Zucker</surname><order>2</order></author></authors><documents><document><filename>0021548-07062016115028.pdf</filename><originalFilename>Tucker-Zucker-Computability_and_streams.pdf</originalFilename><uploaded>2016-06-07T11:50:28.2430000</uploaded><type>Output</type><contentLength>434171</contentLength><contentType>application/pdf</contentType><version>Accepted Manuscript</version><cronfaStatus>true</cronfaStatus><embargoDate>2016-06-07T00:00:00.0000000</embargoDate><copyrightCorrect>true</copyrightCorrect></document></documents><OutputDurs/></rfc1807> |
spelling |
2019-07-17T15:41:47.3707829 v2 21548 2015-05-19 Computability of Operators on Continuous and Discrete Time Streams 431b3060563ed44cc68c7056ece2f85e 0000-0003-4689-8760 John Tucker John Tucker true false 2015-05-19 SCS A stream is a sequence of data indexed by time. The behaviour of natural and artificial systems can be modelled bystreams and stream transformations. There are two distinct types of data stream: streams based on continuous time and streamsbased on discrete time. Having investigated case studies of both kinds separately, we have begun to combine their study in aunified theory of stream transformers, specified by equations. Using only the standard mathematical techniques of topology, wehave proved continuity properties of stream transformers. Here, in this sequel, we analyse their computability. We use the theoryof computable functions on algebras to design two distinct methods for defining computability on continuous and discrete timestreams of data from a complete metric space. One is based on low-level concrete representations, specifically enumerations, andthe other is based on high-level programming, specifically ‘while’ programs, over abstract data types. We analyse when thesemethods are equivalent. We demonstrate the use of the methods by showing the computability of an analog computing system.We discuss the idea that continuity and computability are important for models of physical systems to be “well-posed”. Journal Article Computability 3 1 9 44 analog computing, computing on streams, many-sorted algebras, topological algebras, stream operators, synchronous concurrent algorithms 31 12 2014 2014-12-31 10.3233/COM-14024 http://content.iospress.com/articles/computability/com024 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2019-07-17T15:41:47.3707829 2015-05-19T14:11:48.7988323 John Tucker 0000-0003-4689-8760 1 Jeffrey I Zucker 2 0021548-07062016115028.pdf Tucker-Zucker-Computability_and_streams.pdf 2016-06-07T11:50:28.2430000 Output 434171 application/pdf Accepted Manuscript true 2016-06-07T00:00:00.0000000 true |
title |
Computability of Operators on Continuous and Discrete Time Streams |
spellingShingle |
Computability of Operators on Continuous and Discrete Time Streams John Tucker |
title_short |
Computability of Operators on Continuous and Discrete Time Streams |
title_full |
Computability of Operators on Continuous and Discrete Time Streams |
title_fullStr |
Computability of Operators on Continuous and Discrete Time Streams |
title_full_unstemmed |
Computability of Operators on Continuous and Discrete Time Streams |
title_sort |
Computability of Operators on Continuous and Discrete Time Streams |
author_id_str_mv |
431b3060563ed44cc68c7056ece2f85e |
author_id_fullname_str_mv |
431b3060563ed44cc68c7056ece2f85e_***_John Tucker |
author |
John Tucker |
author2 |
John Tucker Jeffrey I Zucker |
format |
Journal article |
container_title |
Computability |
container_volume |
3 |
container_issue |
1 |
container_start_page |
9 |
publishDate |
2014 |
institution |
Swansea University |
doi_str_mv |
10.3233/COM-14024 |
url |
http://content.iospress.com/articles/computability/com024 |
document_store_str |
1 |
active_str |
0 |
description |
A stream is a sequence of data indexed by time. The behaviour of natural and artificial systems can be modelled bystreams and stream transformations. There are two distinct types of data stream: streams based on continuous time and streamsbased on discrete time. Having investigated case studies of both kinds separately, we have begun to combine their study in aunified theory of stream transformers, specified by equations. Using only the standard mathematical techniques of topology, wehave proved continuity properties of stream transformers. Here, in this sequel, we analyse their computability. We use the theoryof computable functions on algebras to design two distinct methods for defining computability on continuous and discrete timestreams of data from a complete metric space. One is based on low-level concrete representations, specifically enumerations, andthe other is based on high-level programming, specifically ‘while’ programs, over abstract data types. We analyse when thesemethods are equivalent. We demonstrate the use of the methods by showing the computability of an analog computing system.We discuss the idea that continuity and computability are important for models of physical systems to be “well-posed”. |
published_date |
2014-12-31T03:25:35Z |
_version_ |
1763750901852405760 |
score |
11.021648 |