Polynomial running times for polynomial-Time oracle machines

Akitoshi Kawamura, Florian Steinberg

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

5 引用 (Scopus)

抜粋

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.

元の言語英語
ホスト出版物のタイトル2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017
編集者Dale Miller
出版者Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN(電子版)9783959770477
DOI
出版物ステータス出版済み - 9 1 2017
外部発表Yes
イベント2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017 - Oxford, 英国
継続期間: 9 3 20179 9 2017

出版物シリーズ

名前Leibniz International Proceedings in Informatics, LIPIcs
84
ISSN(印刷物)1868-8969

その他

その他2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017
英国
Oxford
期間9/3/179/9/17

All Science Journal Classification (ASJC) codes

  • Software

フィンガープリント Polynomial running times for polynomial-Time oracle machines' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

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