Small universal devices

DOI10.1007/978-3-319-13350-8_19MaRDI QIDQ2944894zbMATH OpenOpenAlexFDO

Authors Artiom Alhazov, Yurii Rogozhin, Sergey Verlan

Publication date 8 September 2015

Published in Computing with New Resources (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-13350-8_19

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Small universal TVDH and test tube systems
• ON SMALL UNIVERSAL SPLICING SYSTEMS
• A small universal splicing P system
• scientific article; zbMATH DE number 1992427
• Surprising areas in the quest for small universal devices

Cites work

• 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 5671765 (Why is no real title available?)
• scientific article; zbMATH DE number 3529421 (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 1489998 (Why is no real title available?)
• scientific article; zbMATH DE number 2086632 (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?)
• 5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines
• Computing with membranes
• DNA Computing
• DNA computing: Arrival of biological mathematics
• Direct constructions of universal extended H systems.
• Formal Reductions of the General Combinatorial Decision Problem
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Four Small Universal Turing Machines
• Frontier between decidability and undecidability: A survey
• Membrane Computing
• Membrane computing. An introduction.
• Minimization strategies for maximally parallel multiset rewriting systems
• Nine universal circular Post machines
• ON SMALL UNIVERSAL SPLICING SYSTEMS
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On the Power of Networks of Evolutionary Processors
• On the universality of Post and splicing systems
• P systems based on tag operations
• P systems with toxic objects
• Small universal TVDH and test tube systems
• Small universal Turing machines
• Small universal networks of evolutionary processors
• Small universal non-deterministic Petri nets with inhibitor arcs
• Small universal register machines
• TIME-VARYING DISTRIBUTED H SYSTEMS OF DEGREE 1 GENERATE ALL RECURSIVELY ENUMERABLE LANGUAGES
• The Complexity of Small Universal Turing Machines: A Survey
• Universality of Tag Systems with P = 2

Cited in

(3)

• scientific article; zbMATH DE number 1839446 (Why is no real title available?)
• Small universal TVDH and test tube systems
• Universal Hard Interaction for Clockless Computation

This page was built for publication: Small universal devices

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