Paper 2023/1832

A Note On the Universality of Black-box MKtP Solvers

Abstract

The relationships between various meta-complexity problems are not well understood in the worst-case regime, including whether the search version is harder than the decision version, whether the hardness scales with the ``threshold", and how the hardness of different meta complexity problems relate to one another, and to the task of function inversion. In this note, we present resolutions to some of these questions with respect to the \emph{black-box} analog of these problems. In more detail, let $$ denote the language consisting of strings $$ with $$, where $$ denotes the $$-bounded Kolmogorov complexity of $$ with $$ as the underlying (Universal) Turing machine, and let $$ denote the search version of the same problem. We show that if there for every Universal Turing machine $$ there exists a $$-size $$-oracle aided circuit deciding $$, then for every function $$, and every not necessarily universal Turing machine $$, there exists a $$ size $$-oracle aided circuit solving $$; this in turn yields circuits of roughly the same size for both the Minimum Circuit Size Problem (MCSP), and the function inversion problem, as they can be thought of as instantiating $$ with particular choices of (a non universal) TMs $$ (the circuit emulator for the case of MCSP, and the function evaluation in the case of function inversion). As a corollary of independent interest, we get that the complexity of black-box function inversion is (roughly) the same as the complexity of black-box deciding $$ for any universal TM $$; that is, also in the worst-case regime, black-box function inversion is ``equivalent" to black-box deciding $$.