A parameterized halting problem, the linear time hierarchy, and the MRDP theorem
Visualitza/Obre
Cita com:
hdl:2117/119165
Tipus de documentText en actes de congrés
Data publicació2018
EditorAssociation for Computing Machinery (ACM)
Condicions d'accésAccés obert
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
Abstract
The complexity of the parameterized halting problem for nondeterministic Turing machines p-Halt is known to be related to the question of whether there are logics capturing various complexity classes [10]. Among others, if p-Halt is in para-AC0, the parameterized version of the circuit complexity class AC0, then AC0, or equivalently, (+, x)-invariant FO, has a logic. Although it is widely believed that p-Halt ∉. para-AC0, we show that the problem is hard to settle by establishing a connection to the question in classical complexity of whether NE ⊈ LINH. Here, LINH denotes the linear time hierarchy.
On the other hand, we suggest an approach toward proving NE ⊈ LINH using bounded arithmetic. More specifically, we demonstrate that if the much celebrated MRDP (for Matiyasevich-Robinson-Davis-Putnam) theorem can be proved in a certain fragment of arithmetic, then NE ⊈ LINH. Interestingly, central to this result is a para-AC0 lower bound for the parameterized model-checking problem for FO on arithmetical structures.
CitacióChen, Y., Müller, M., Yokoyama, K. A parameterized halting problem, the linear time hierarchy, and the MRDP theorem. A: Annual ACM/IEEE Symposium on Logic in Computer Science. "LICS '18: proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science". New York: Association for Computing Machinery (ACM), 2018, p. 235-244.
ISBN978-1-4503-5583-4
Versió de l'editorhttps://dl.acm.org/citation.cfm?doid=3209108.3209155
Col·leccions
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
CMYlics.pdf | 374,7Kb | Visualitza/Obre |