Authors: Clément Aubert ; Marc Bagnol

We present an algebraic characterization of the complexity classes Logspace and Nlogspace, using an algebra with a composition law based on unification.
This new bridge between unification and complexity classes is rooted in proof theory and more specifically linear logic and geometry of interaction. We show how to build a model of computation in the unification algebra and then, by means of a syntactic representation of finite permutations in the algebra, we prove that whether an observation (the algebraic counterpart of a program) accepts a word can be decided within logarithmic space. Finally, we show that the construction naturally corresponds to pointer machines, a convenient way of understanding logarithmic space computation.

Comment: arXiv admin note: text overlap with arXiv:1402.4327

• 03F52 - Proof-theoretic aspects of linear logic and other substructural logics
• 68N17 - Logic programming
• 68Q15 - Complexity classes (hierarchies, relations among complexity classes, etc.)
• 68Q42 - Grammars and rewriting systems
• 68Q45 - Formal languages and automata

• 1 zbMATH Open