Universality of Splicing Test Tube Systems with Two Tubes
biocomputingmodels of computationsplicingtest tube systemsuniversalityuniversality models of computation
Thue and Post systems, etc. (03D03) Turing machines and related notions (03D10) Complexity of computation (including implicit computational complexity) (03D15) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Descriptive complexity and finite models (68Q19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
- scientific article; zbMATH DE number 1086502
- scientific article; zbMATH DE number 1189119
- scientific article; zbMATH DE number 907955
- Test tube systems: When two tubes are enough
- scientific article; zbMATH DE number 1286204
- TIME-VARYING DISTRIBUTED H SYSTEMS OF DEGREE 1 GENERATE ALL RECURSIVELY ENUMERABLE LANGUAGES
- scientific article; zbMATH DE number 1735619
- Aspects of Molecular Computing
- Nine test tubes generate any RE language
- scientific article; zbMATH DE number 2087036
- Nine test tubes generate any RE language
- Test tube systems: When two tubes are enough
- Small universal TVDH and test tube systems
- scientific article; zbMATH DE number 1134605 (Why is no real title available?)
- scientific article; zbMATH DE number 907955 (Why is no real title available?)
- Length-Separating Test Tube Systems
- Aspects of Molecular Computing
This page was built for publication: Universality of Splicing Test Tube Systems with Two Tubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3100946)
