Second-order linear-time computability with applications to computable analysis

Akitoshi Kawamura, Florian Steinberg, Holger Thies

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this work we put forward a complexity class of type-two linear-time. For such a definition to be meaningful, a detailed protocol for the cost of interactions with functional inputs has to be fixed. This includes some design decisions the defined class is sensible to and we carefully discuss our choices and their implications. We further discuss some properties and examples of operators that are and are not computable in linear-time and nearly linear-time and some applications to computable analysis.

Original languageEnglish
Title of host publicationTheory and Applications of Models of Computation - 15th Annual Conference, TAMC 2019, Proceedings
EditorsJunzo Watada, T. V. Gopal
PublisherSpringer Verlag
Pages337-358
Number of pages22
ISBN (Print)9783030148119
DOIs
Publication statusPublished - Jan 1 2019
Event15th Annual Conference on Theory and Applications of Models of Computation, TAMC 2019 - Kitakyushu, Japan
Duration: Apr 13 2019Apr 16 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11436 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference15th Annual Conference on Theory and Applications of Models of Computation, TAMC 2019
CountryJapan
CityKitakyushu
Period4/13/194/16/19

Fingerprint

Computable Analysis
Computability
Linear Time
Costs
Complexity Classes
Operator
Interaction

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Kawamura, A., Steinberg, F., & Thies, H. (2019). Second-order linear-time computability with applications to computable analysis. In J. Watada, & T. V. Gopal (Eds.), Theory and Applications of Models of Computation - 15th Annual Conference, TAMC 2019, Proceedings (pp. 337-358). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11436 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-14812-6_21

Second-order linear-time computability with applications to computable analysis. / Kawamura, Akitoshi; Steinberg, Florian; Thies, Holger.

Theory and Applications of Models of Computation - 15th Annual Conference, TAMC 2019, Proceedings. ed. / Junzo Watada; T. V. Gopal. Springer Verlag, 2019. p. 337-358 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11436 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kawamura, A, Steinberg, F & Thies, H 2019, Second-order linear-time computability with applications to computable analysis. in J Watada & TV Gopal (eds), Theory and Applications of Models of Computation - 15th Annual Conference, TAMC 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11436 LNCS, Springer Verlag, pp. 337-358, 15th Annual Conference on Theory and Applications of Models of Computation, TAMC 2019, Kitakyushu, Japan, 4/13/19. https://doi.org/10.1007/978-3-030-14812-6_21
Kawamura A, Steinberg F, Thies H. Second-order linear-time computability with applications to computable analysis. In Watada J, Gopal TV, editors, Theory and Applications of Models of Computation - 15th Annual Conference, TAMC 2019, Proceedings. Springer Verlag. 2019. p. 337-358. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-14812-6_21
Kawamura, Akitoshi ; Steinberg, Florian ; Thies, Holger. / Second-order linear-time computability with applications to computable analysis. Theory and Applications of Models of Computation - 15th Annual Conference, TAMC 2019, Proceedings. editor / Junzo Watada ; T. V. Gopal. Springer Verlag, 2019. pp. 337-358 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{310cf94b0c504379a136d780d5c4fd62,
title = "Second-order linear-time computability with applications to computable analysis",
abstract = "In this work we put forward a complexity class of type-two linear-time. For such a definition to be meaningful, a detailed protocol for the cost of interactions with functional inputs has to be fixed. This includes some design decisions the defined class is sensible to and we carefully discuss our choices and their implications. We further discuss some properties and examples of operators that are and are not computable in linear-time and nearly linear-time and some applications to computable analysis.",
author = "Akitoshi Kawamura and Florian Steinberg and Holger Thies",
year = "2019",
month = "1",
day = "1",
doi = "10.1007/978-3-030-14812-6_21",
language = "English",
isbn = "9783030148119",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "337--358",
editor = "Junzo Watada and Gopal, {T. V.}",
booktitle = "Theory and Applications of Models of Computation - 15th Annual Conference, TAMC 2019, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Second-order linear-time computability with applications to computable analysis

AU - Kawamura, Akitoshi

AU - Steinberg, Florian

AU - Thies, Holger

PY - 2019/1/1

Y1 - 2019/1/1

N2 - In this work we put forward a complexity class of type-two linear-time. For such a definition to be meaningful, a detailed protocol for the cost of interactions with functional inputs has to be fixed. This includes some design decisions the defined class is sensible to and we carefully discuss our choices and their implications. We further discuss some properties and examples of operators that are and are not computable in linear-time and nearly linear-time and some applications to computable analysis.

AB - In this work we put forward a complexity class of type-two linear-time. For such a definition to be meaningful, a detailed protocol for the cost of interactions with functional inputs has to be fixed. This includes some design decisions the defined class is sensible to and we carefully discuss our choices and their implications. We further discuss some properties and examples of operators that are and are not computable in linear-time and nearly linear-time and some applications to computable analysis.

UR - http://www.scopus.com/inward/record.url?scp=85064868996&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85064868996&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-14812-6_21

DO - 10.1007/978-3-030-14812-6_21

M3 - Conference contribution

AN - SCOPUS:85064868996

SN - 9783030148119

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 337

EP - 358

BT - Theory and Applications of Models of Computation - 15th Annual Conference, TAMC 2019, Proceedings

A2 - Watada, Junzo

A2 - Gopal, T. V.

PB - Springer Verlag

ER -