arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2211.06121cs.CCmath.LO
收藏

参数化停机问题、$Δ_0$真值和MRDP定理

A parameterized halting problem, $Δ_0$ truth and the MRDP theorem

Yijia Chen, Moritz Müller, Keita Yokoyama

摘要:

我们研究了问题的参数化复杂性,以决定给定的自然数$n$是否满足给定的$Δ_0$ -公式$φ(x)$,参数是$φ$的大小.此参数化将注意力集中在$n$比$φ$大的情况下。我们无条件地表明,这个问题不属于参数化的类似物的$\mathsf{AC}^0$。由此,我们得出,我们的参数化问题的复杂性的某些自然的上限意味着某些分离的经典复杂性类。这种连接是通过分析一个参数化的停机问题。这些上界中的一些是假设$IΔ_0$在某种弱意义上证明了MRDP定理。

英文摘要:

We study the parameterized complexity of the problem to decide whether a given natural number $n$ satisfies a given $Δ_0$-formula $φ(x)$; the parameter is the size of $φ$. This parameterization focusses attention on instances where $n$ is large compared to the size of $φ$. We show unconditionally that this problem does not belong to the parameterized analogue of $\mathsf{AC}^0$. From this we derive that certain natural upper bounds on the complexity of our parameterized problem imply certain separations of classical complexity classes. This connection is obtained via an analysis of a parameterized halting problem. Some of these upper bounds follow assuming that $IΔ_0$ proves the MRDP theorem in a certain weak sense.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑