Polynomial running times for polynomial-Time oracle machines

Akitoshi Kawamura, Florian Steinberg

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

3 Citations (Scopus)

Abstract

This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possible to consider functions on the natural numbers as running times of oracle Turing machines and avoiding secondorder polynomials, which are notoriously difficult to handle. Furthermore, all machines that witness this stronger kind of feasibility can be clocked and the different traditions of treating partial functionals from computable analysis and second-order complexity theory are equated in a precise sense. The new notion is named 'strong polynomial-Time computability', and proven to be a strictly stronger requirement than polynomial-Time computability. It is proven that within the framework for complexity of operators from analysis introduced by Kawamura and Cook the classes of strongly polynomial-Time computable functionals and polynomial-Time computable functionals coincide.

Original languageEnglish
Title of host publication2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017
EditorsDale Miller
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770477
DOIs
Publication statusPublished - Sep 1 2017
Event2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017 - Oxford, United Kingdom
Duration: Sep 3 2017Sep 9 2017

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume84
ISSN (Print)1868-8969

Other

Other2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017
CountryUnited Kingdom
CityOxford
Period9/3/179/9/17

Fingerprint

Polynomials
Turing machines

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Kawamura, A., & Steinberg, F. (2017). Polynomial running times for polynomial-Time oracle machines. In D. Miller (Ed.), 2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017 [23] (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 84). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.FSCD.2017.23

Polynomial running times for polynomial-Time oracle machines. / Kawamura, Akitoshi; Steinberg, Florian.

2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017. ed. / Dale Miller. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. 23 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 84).

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

Kawamura, A & Steinberg, F 2017, Polynomial running times for polynomial-Time oracle machines. in D Miller (ed.), 2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017., 23, Leibniz International Proceedings in Informatics, LIPIcs, vol. 84, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017, Oxford, United Kingdom, 9/3/17. https://doi.org/10.4230/LIPIcs.FSCD.2017.23
Kawamura A, Steinberg F. Polynomial running times for polynomial-Time oracle machines. In Miller D, editor, 2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2017. 23. (Leibniz International Proceedings in Informatics, LIPIcs). https://doi.org/10.4230/LIPIcs.FSCD.2017.23
Kawamura, Akitoshi ; Steinberg, Florian. / Polynomial running times for polynomial-Time oracle machines. 2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017. editor / Dale Miller. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. (Leibniz International Proceedings in Informatics, LIPIcs).
@inproceedings{2d4602d764a947b6946469e073344e77,
title = "Polynomial running times for polynomial-Time oracle machines",
abstract = "This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possible to consider functions on the natural numbers as running times of oracle Turing machines and avoiding secondorder polynomials, which are notoriously difficult to handle. Furthermore, all machines that witness this stronger kind of feasibility can be clocked and the different traditions of treating partial functionals from computable analysis and second-order complexity theory are equated in a precise sense. The new notion is named 'strong polynomial-Time computability', and proven to be a strictly stronger requirement than polynomial-Time computability. It is proven that within the framework for complexity of operators from analysis introduced by Kawamura and Cook the classes of strongly polynomial-Time computable functionals and polynomial-Time computable functionals coincide.",
author = "Akitoshi Kawamura and Florian Steinberg",
year = "2017",
month = "9",
day = "1",
doi = "10.4230/LIPIcs.FSCD.2017.23",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Dale Miller",
booktitle = "2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017",

}

TY - GEN

T1 - Polynomial running times for polynomial-Time oracle machines

AU - Kawamura, Akitoshi

AU - Steinberg, Florian

PY - 2017/9/1

Y1 - 2017/9/1

N2 - This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possible to consider functions on the natural numbers as running times of oracle Turing machines and avoiding secondorder polynomials, which are notoriously difficult to handle. Furthermore, all machines that witness this stronger kind of feasibility can be clocked and the different traditions of treating partial functionals from computable analysis and second-order complexity theory are equated in a precise sense. The new notion is named 'strong polynomial-Time computability', and proven to be a strictly stronger requirement than polynomial-Time computability. It is proven that within the framework for complexity of operators from analysis introduced by Kawamura and Cook the classes of strongly polynomial-Time computable functionals and polynomial-Time computable functionals coincide.

AB - This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possible to consider functions on the natural numbers as running times of oracle Turing machines and avoiding secondorder polynomials, which are notoriously difficult to handle. Furthermore, all machines that witness this stronger kind of feasibility can be clocked and the different traditions of treating partial functionals from computable analysis and second-order complexity theory are equated in a precise sense. The new notion is named 'strong polynomial-Time computability', and proven to be a strictly stronger requirement than polynomial-Time computability. It is proven that within the framework for complexity of operators from analysis introduced by Kawamura and Cook the classes of strongly polynomial-Time computable functionals and polynomial-Time computable functionals coincide.

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

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

U2 - 10.4230/LIPIcs.FSCD.2017.23

DO - 10.4230/LIPIcs.FSCD.2017.23

M3 - Conference contribution

AN - SCOPUS:85030569980

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017

A2 - Miller, Dale

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

ER -