### Martin Ziegler, Quantitative Coding and Complexity Theory of Continuous Data

Room B232 IBS (기초과학연구원)Specifying a computational problem requires fixing encodings for input and output: encoding graphs as adjacency matrices, characters as integers, integers as bit strings, and vice versa. For such discrete data, the actual encoding is usually straightforward and/or complexity-theoretically inessential (up to polynomial time, say). But concerning continuous data, already real numbers naturally suggest various encodings with very different computational properties. …