The Computational Universality of Metabolic Computing · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/1505.02420/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTThe Computational Universality of Metabolic Computing — mentioned by guiraldellihttps://news.ycombinator.com/item?id=20153456urn:hackerpapers:mention:1505.02420:20153456Tue, 11 Jun 2019 06:52:23 GMT<p>For those interested in the subject, the field that formalises the computation of chemical-reaction-like grammars is called P systems (or Membrane Computing) [1], which are known to be super-Turing devices [2]. Well, given the resistance to accept the practicality of super-Turing devices, a simpler model exists, MP systems [3], with simplified semantics and practical for biological applications. MP systems are proved to be Turing-equivalent and there is a nice paper [4,5] (shameless promotion) that shows how to convert each type of &quot;chemical reaction equation&quot; into basic, sequential…</p><p><a href="https://hackerpaper.kaipfister.de/p/1505.02420/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.ET