DeepAI AI Chat
Log In Sign Up

A Turing machine simulation by P systems without charges

by   Alberto Leporati, et al.
Università degli Studi di Milano-Bicocca

It is well known that the kind of P systems involved in the definition of the P conjecture is able to solve problems in the complexity class P by leveraging the uniformity condition. Here we show that these systems are indeed able to simulate deterministic Turing machines working in polynomial time with a weaker uniformity condition and using only one level of membrane nesting. This allows us to embed this construction into more complex membrane structures, possibly showing that constructions similar to the one performed in [1] for P systems with charges can be carried out also in this case.


page 1

page 2

page 3

page 4


Diagonalization of Polynomial-Time Turing Machines Via Nondeterministic Turing Machine

The diagonalization technique was invented by Georg Cantor to show that ...

A Schematic Definition of Quantum Polynomial Time Computability

In the past four decades, the notion of quantum polynomial-time computab...

A general architecture of oritatami systems for simulating arbitrary finite automata

In this paper, we propose an architecture of oritatami systems with whic...

Revisiting the simulation of quantum Turing machines by quantum circuits

Yao (1993) proved that quantum Turing machines and uniformly generated q...

Notes on kAExp(pol) problems for deterministic machines

The complexity of several logics, such as Presburger arithmetic, depende...

Computational irreducibility and compatibilism: towards a formalization

If our actions are determined by the laws of nature, can we meaningfully...