Now showing items 1-1 of 1

    • A parameterized halting problem, the linear time hierarchy, and the MRDP theorem 

      Chen, Yijia; Muller, Moritz Martin; Yokoyama, Keita (Association for Computing Machinery (ACM), 2018)
      Conference report
      Open Access
      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, ...