Turing completeness of water computing

DOI10.1007/S41965-021-00081-3MaRDI QIDQ2152298zbMATH OpenOpenAlexFDO

Authors Alec Henderson, Radu Nicolescu, Michael J. Dinneen, T. N. Chan, Hendrik Happe, Thomas Hinze

Publication date 7 July 2022

Published in Journal of Membrane Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s41965-021-00081-3

zbMATH Keywords

\(\mu\)-recursionmembrane systemswater-based computing

Mathematics Subject Classification ID

Other nonclassical models of computation (68Q09)

Recommendations

• Programmable and parallel water computing
• Membrane computing with water
• Turing Completeness Using Three Mobile Membranes
• Membrane Computing
• Turing Tumble is Turing-complete

Cites work

• An introduction to cP systems
• Computing in Russia. The history of computer devices and information technology revealed. Transl. from the Russian by Alexander Y. Nitussov
• Computing with membranes
• General Recursive Functions
• Membrane computing with water
• On a theorem of Günter Asser
• P systems attacking hard problems beyond NP: a survey
• P systems with limited number of objects
• Simulation challenges in membrane computing
• Spiking neural P systems
• Theories of computational complexity
• Tissue P systems.
• Unary primitive recursive functions

Cited in

(5)

• Membrane computing with water
• Programmable and parallel water computing
• On maximal parallel application of rules in rewriting P systems
• Implementing perceptrons by means of water-based computing
• Expressivity of AuDaLa: Turing completeness and possible extensions

This page was built for publication: Turing completeness of water computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2152298)