Function spaces for second-order polynomial time

Akitoshi Kawamura, Arno Pauly

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

11 Citations (Scopus)

Abstract

In the context of second-order polynomial-time computability, we prove that there is no general function space construction. We proceed to identify restrictions on the domain or the codomain that do provide a function space with polynomial-time function evaluation containing all polynomial-time computable functions of that type. As side results we show that a polynomial-time counterpart to admissibility of a representation is not a suitable criterion for natural representations, and that the Weihrauch degrees embed into the polynomial-time Weihrauch degrees.

Original languageEnglish
Title of host publicationLanguage, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Proceedings
PublisherSpringer Verlag
Pages245-254
Number of pages10
ISBN (Print)9783319080185
DOIs
Publication statusPublished - Jan 1 2014
Externally publishedYes
Event10th Conference on Computability in Europe, CiE 2014 - Budapest, Hungary
Duration: Jun 23 2014Jun 27 2014

Publication series

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

Other

Other10th Conference on Computability in Europe, CiE 2014
CountryHungary
CityBudapest
Period6/23/146/27/14

Fingerprint

Function Space
Polynomial time
Polynomials
Codomain
Function evaluation
Computability
Admissibility
Evaluation Function
Restriction

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Kawamura, A., & Pauly, A. (2014). Function spaces for second-order polynomial time. In Language, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Proceedings (pp. 245-254). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8493 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-08019-2_25

Function spaces for second-order polynomial time. / Kawamura, Akitoshi; Pauly, Arno.

Language, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Proceedings. Springer Verlag, 2014. p. 245-254 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8493 LNCS).

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

Kawamura, A & Pauly, A 2014, Function spaces for second-order polynomial time. in Language, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8493 LNCS, Springer Verlag, pp. 245-254, 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, 6/23/14. https://doi.org/10.1007/978-3-319-08019-2_25
Kawamura A, Pauly A. Function spaces for second-order polynomial time. In Language, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Proceedings. Springer Verlag. 2014. p. 245-254. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-08019-2_25
Kawamura, Akitoshi ; Pauly, Arno. / Function spaces for second-order polynomial time. Language, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Proceedings. Springer Verlag, 2014. pp. 245-254 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{0982cdeb61d744e3aabe40311bff21d2,
title = "Function spaces for second-order polynomial time",
abstract = "In the context of second-order polynomial-time computability, we prove that there is no general function space construction. We proceed to identify restrictions on the domain or the codomain that do provide a function space with polynomial-time function evaluation containing all polynomial-time computable functions of that type. As side results we show that a polynomial-time counterpart to admissibility of a representation is not a suitable criterion for natural representations, and that the Weihrauch degrees embed into the polynomial-time Weihrauch degrees.",
author = "Akitoshi Kawamura and Arno Pauly",
year = "2014",
month = "1",
day = "1",
doi = "10.1007/978-3-319-08019-2_25",
language = "English",
isbn = "9783319080185",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "245--254",
booktitle = "Language, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Function spaces for second-order polynomial time

AU - Kawamura, Akitoshi

AU - Pauly, Arno

PY - 2014/1/1

Y1 - 2014/1/1

N2 - In the context of second-order polynomial-time computability, we prove that there is no general function space construction. We proceed to identify restrictions on the domain or the codomain that do provide a function space with polynomial-time function evaluation containing all polynomial-time computable functions of that type. As side results we show that a polynomial-time counterpart to admissibility of a representation is not a suitable criterion for natural representations, and that the Weihrauch degrees embed into the polynomial-time Weihrauch degrees.

AB - In the context of second-order polynomial-time computability, we prove that there is no general function space construction. We proceed to identify restrictions on the domain or the codomain that do provide a function space with polynomial-time function evaluation containing all polynomial-time computable functions of that type. As side results we show that a polynomial-time counterpart to admissibility of a representation is not a suitable criterion for natural representations, and that the Weihrauch degrees embed into the polynomial-time Weihrauch degrees.

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

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

U2 - 10.1007/978-3-319-08019-2_25

DO - 10.1007/978-3-319-08019-2_25

M3 - Conference contribution

AN - SCOPUS:84903635318

SN - 9783319080185

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

SP - 245

EP - 254

BT - Language, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Proceedings

PB - Springer Verlag

ER -