Resource-bounded continuity and sequentiality for type-two functionals-Reference-Cited by-同舟云学术

Resource-bounded continuity and sequentiality for type-two functionals

Published:2002-07 Issue:3 Volume:3 Page:402-417
ISSN:1529-3785
Container-title:ACM Transactions on Computational Logic
language:en
Short-container-title:ACM Trans. Comput. Logic

Author:

Buss Samuel R.¹,Kapron Bruce M.²

Affiliation:

1. University of California, San Diego, CA

2. University of Victoria, Victoria, B.C., Canada

Abstract

We define notions of resource-bounded continuity and sequentiality for type-two functionals with total inputs, and prove that in the resource-bounded model there are continuous functionals which cannot be efficiently simulated by sequential functionals. We also show that for some naturally defined classes of continuous functionals an efficient simulation is possible.

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/507382.507387

Reference25 articles.

1. Total sets and objects in domain theory

2. Cook S. and Kapron B. 1990. Characterizations of the basic feasible functionals of finite type. In Feasible Mathematics S. Buss and P. Scott Eds. Birkhäuser Boston MA 71--93. Cook S. and Kapron B. 1990. Characterizations of the basic feasible functionals of finite type. In Feasible Mathematics S. Buss and P. Scott Eds. Birkhäuser Boston MA 71--93.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Type-two polynomial-time and restricted lookahead;Theoretical Computer Science;2020-04

2. Type-two polynomial-time and restricted lookahead;Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science;2018-07-09

3. Game semantics approach to higher-order complexity;Journal of Computer and System Sciences;2017-08

4. COMPLEXITY THEORY FOR SPACES OF INTEGRABLE FUNCTIONS;LOG METH COMPUT SCI;2017

5. Complexity and Intensionality in a Type-1 Framework for Computable Analysis;Computer Science Logic;2005