TY - GEN

T1 - Complexity Theory of (Functions on) Compact Metric Spaces

AU - Kawamura, Akitoshi

AU - Steinberg, Florian

AU - Ziegler, Martin

N1 - Publisher Copyright:
© 2016 ACM.

PY - 2016/7/5

Y1 - 2016/7/5

N2 - We promote the theory of computational complexity on metric spaces: as natural common generalization of (i) the classical discrete setting of integers, binary strings, graphs etc. as well as of (ii) the bit-complexity theory on real numbers and functions according to Friedman, Ko (1982ff), Cook, Braverman et al.; as (iii) resource-bounded refinement of the theories of computability on, and representations of, continuous universes by Pour-El&Richards (1989) and Weihrauch (1993ff); and as (iv) computational perspective on quantitative concepts from classical Analysis: Our main results relate (i.e. upper and lower bound) Kolmogorov's entropy of a compact metric space X polynomially to the uniform relativized complexity of approximating various families of continuous functions on X. The upper bounds are attained by carefully crafted oracles and bit-cost analyses of algorithms perusing them. They all employ the same representation (i.e. encoding, as infinite binary sequences, of the elements) of such spaces, which thus may be of own interest. The lower bounds adapt adversary arguments from unit-cost Information-Based Complexity to the bit model. They extend to, and indicate perhaps surprising limitations even of, encodings via binary string functions (rather than sequences) as introduced by Kawamura&Cook (SToC'2010, 3.4). These insights offer some guidance towards suitable notions of complexity for higher types.

AB - We promote the theory of computational complexity on metric spaces: as natural common generalization of (i) the classical discrete setting of integers, binary strings, graphs etc. as well as of (ii) the bit-complexity theory on real numbers and functions according to Friedman, Ko (1982ff), Cook, Braverman et al.; as (iii) resource-bounded refinement of the theories of computability on, and representations of, continuous universes by Pour-El&Richards (1989) and Weihrauch (1993ff); and as (iv) computational perspective on quantitative concepts from classical Analysis: Our main results relate (i.e. upper and lower bound) Kolmogorov's entropy of a compact metric space X polynomially to the uniform relativized complexity of approximating various families of continuous functions on X. The upper bounds are attained by carefully crafted oracles and bit-cost analyses of algorithms perusing them. They all employ the same representation (i.e. encoding, as infinite binary sequences, of the elements) of such spaces, which thus may be of own interest. The lower bounds adapt adversary arguments from unit-cost Information-Based Complexity to the bit model. They extend to, and indicate perhaps surprising limitations even of, encodings via binary string functions (rather than sequences) as introduced by Kawamura&Cook (SToC'2010, 3.4). These insights offer some guidance towards suitable notions of complexity for higher types.

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

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

U2 - 10.1145/2933575.2935311

DO - 10.1145/2933575.2935311

M3 - Conference contribution

AN - SCOPUS:84994620469

T3 - Proceedings - Symposium on Logic in Computer Science

SP - 837

EP - 846

BT - Proceedings of the 31st Annual ACM-IEEE Symposium on Logic in Computer Science, LICS 2016

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2016

Y2 - 5 July 2016 through 8 July 2016

ER -