Universality in Molecular and Cellular Computing
From MaRDI portal
Recommendations
- Toward a theory of molecular computing
- Towards molecular computers that operate in a biological environment
- Molecular implementations of cellular automata
- Turing universality of the biochemical ground form
- Intrinsic universality and the computational power of self-assembly
- On the universality of peptide computing
- scientific article; zbMATH DE number 2087028
- Universality and Emergent Computation in Cellular Neural Networks
- Molecular computing paradigm -- toward freedom from Turing's charm
Cites work
- 5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines
- A Formal Framework for Static (Tissue) P Systems
- Accepting hybrid networks of evolutionary processors with special topologies and small communication
- Accepting networks of evolutionary word and picture processors: a survey
- Accepting Networks of Non-inserting Evolutionary Processors
- Complexity of Self‐Assembled Shapes
- Computability and complexity in self-assembly
- Computing with membranes
- Direct constructions of universal extended H systems.
- DNA Computing
- DNA computing: Arrival of biological mathematics
- Efficient Turing-universal computation with DNA polymers
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- Frontier between decidability and undecidability: A survey
- Further Results on Insertion-Deletion Systems with One-Sided Contexts
- Handbook of Natural Computing
- scientific article; zbMATH DE number 1728707 (Why is no real title available?)
- scientific article; zbMATH DE number 1818513 (Why is no real title available?)
- scientific article; zbMATH DE number 1236223 (Why is no real title available?)
- scientific article; zbMATH DE number 1735637 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 2086632 (Why is no real title available?)
- scientific article; zbMATH DE number 907955 (Why is no real title available?)
- scientific article; zbMATH DE number 3261617 (Why is no real title available?)
- scientific article; zbMATH DE number 3305022 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- scientific article; zbMATH DE number 3315195 (Why is no real title available?)
- Insertion-Deletion Systems with One-Sided Contexts
- Membrane computing. An introduction.
- Minimization strategies for maximally parallel multiset rewriting systems
- On Networks of Evolutionary Processors with Nodes of Two Types
- ON SMALL UNIVERSAL SPLICING SYSTEMS
- On small, reduced, and fast universal accepting networks of splicing processors
- On the power of accepting networks of evolutionary processors with special topologies and random context filters
- On the reachability problem for 5-dimensional vector addition systems
- On the size complexity of universal accepting hybrid networks of evolutionary processors
- One tile to rule them all: simulating any tile assembly system with a single universal tile
- Self-assembly of Decidable Sets
- Small universal networks of evolutionary processors
- Small universal non-deterministic Petri nets with inhibitor arcs
- Small universal register machines
- Small universal Turing machines
- Small universal TVDH and test tube systems
- The Complexity of Small Universal Turing Machines: A Survey
- The Reachability Problem for Vector Addition System with One Zero-Test
- TIME-VARYING DISTRIBUTED H SYSTEMS OF DEGREE 1 GENERATE ALL RECURSIVELY ENUMERABLE LANGUAGES
Cited in
(3)
This page was built for publication: Universality in Molecular and Cellular Computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3195684)
