A Turing machine simulation by P systems without charges
From MaRDI portal
Publication:1982960
DOI10.1007/s41965-020-00031-5zbMath1469.68043arXiv1902.03883OpenAlexW3124169376MaRDI QIDQ1982960
Antonio E. Porreca, Luca Manzoni, Alberto Leporati, Claudio Zandron, Giancarlo Mauri
Publication date: 14 September 2021
Published in: Journal of Membrane Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.03883
Classical models of computation (Turing machines, etc.) (68Q04) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Related Items (7)
From \texttt{SAT} to \texttt{SAT}-\texttt{UNSAT} using P systems with dissolution rules ⋮ A characterisation of \textbf{P} by \textbf{DLOGTIME}-uniform families of polarizationless P systems using only dissolution rules ⋮ Multi-learning rate optimization spiking neural P systems for solving the discrete optimization problems ⋮ Evaluating space measures in P systems ⋮ Automatic design of arithmetic operation spiking neural P systems ⋮ Bounding the space in P systems with active membranes ⋮ Alternative space definitions for P systems with active membranes
Cites Work
- The computational power of membrane systems under tight uniformity conditions
- Membrane computing and complexity theory: A characterization of PSPACE
- Tissue P systems.
- The computational power of cell division in P systems: Beating down parallel computers?
- Computing with membranes
- The counting power of P systems with antimatter
- Reaching efficiency through collaboration in membrane systems: dissolution, polarization and cooperation
- Characterising the complexity of tissue P systems with fission rules
- Space complexity equivalence of P systems with active membranes and Turing machines
- Membrane Division, Oracles, and the Counting Hierarchy
- Computational efficiency of dissolution rules in membrane systems
- Computational Efficiency of Minimal Cooperation and Distribution in Polarizationless P Systems with Active Membranes
- Constant-Space P Systems with Active Membranes
- Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P
- Membrane Computing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A Turing machine simulation by P systems without charges