DeepAI AI Chat
Log In Sign Up

Notes on kAExp(pol) problems for deterministic machines

by   Alessio Mansutti, et al.
University of Oxford

The complexity of several logics, such as Presburger arithmetic, dependence logics and ambient logics, can only be characterised in terms of alternating Turing machines. Despite quite natural, the presence of alternation can sometimes cause neat ideas to be obfuscated inside heavy technical machinery. In these notes, we propose two problems on deterministic machines that can be used to prove lower bounds with respect to the computational class kAExp_pol, that is the class of all problems solvable by an alternating Turing machine running in k exponential time and performing a polynomial amount of alternations, with respect to the input size. The first problem, called kAExp_pol-prenex TM problem, is a problem about deterministic Turing machines. The second problem, called the k-exp alternating multi-tiling problem, is analogous to the first one, but on tiling systems. Both problems are natural extensions of the TM alternation problem and the alternating multi-tiling problem proved AExp_pol-complete by L. Bozzelli, A. Molinari, A. Montanari and A. Peron in [GandALF, pp. 31-45, 2017]. The proofs presented in these notes follow the elegant exposition in A. Molinari's PhD thesis to extend these results from the case k = 1 to the case of arbitrary k.


page 1

page 3

page 9

page 10

page 11

page 12

page 13


Exploring Rulial Space: The Case of Turing Machines

As an example of the concept of rulial space, we explore the case of sim...

The Polylog-Time Hierarchy Captured by Restricted Second-Order Logic

Let SO^plog denote the restriction of second-order logic, where second-o...

Computation with Large Advice

In this paper, we consider a new direction of computation, which we call...

Alternating Automatic Register Machines

This paper introduces and studies a new model of computation called an A...

Turing: Then, Now and Still Key

This paper looks at Turing's postulations about Artificial Intelligence ...

A Turing machine simulation by P systems without charges

It is well known that the kind of P systems involved in the definition o...

Machines as Programs: P ≠ NP

The Curry-Howard correspondence is often called the proofs-as-programs r...