On the Computational Power of Flip-Flop Proteins on Membranes

DOI10.1007/978-3-540-73001-9_74zbMath1151.68417OpenAlexW1836318583MaRDI QIDQ5425374

Shankara Narayanan Krishna

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73001-9_74

zbMATH Keywords

UniversalityMembrane ComputingRegister Machines

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (5)

An efficient time-free solution to SAT problem by P systems with proteins on membranes ⋮ An efficient time-free solution to QSAT problem using P systems with proteins on membranes ⋮ P systems with proteins on membranes characterize PSPACE ⋮ The computational power of cell-like P systems with one protein on membrane ⋮ P systems attacking hard problems beyond NP: a survey

This page was built for publication: On the Computational Power of Flip-Flop Proteins on Membranes