Using DNA to solve the bounded Post correspondence problem

DOI10.1016/S0304-3975(99)00100-0MaRDI QIDQ1575917zbMATH OpenDBLPWikidataFDO

Authors Greg Gloor, Lila Kari, Sheng Yu

Publication date 23 August 2000

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(99)00100-0

zbMATH Keywords

DNA computing

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Formal models of DNA computing: A survey
• scientific article; zbMATH DE number 1342109
• scientific article; zbMATH DE number 1241362
• scientific article; zbMATH DE number 5262968
• scientific article; zbMATH DE number 1342102

Cites work

• Contextual insertions/deletions and computability
• DNA computing based on splicing: The existence of universal computers
• DNA computing: Arrival of biological mathematics
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1241360 (Why is no real title available?)
• scientific article; zbMATH DE number 1241362 (Why is no real title available?)
• scientific article; zbMATH DE number 1241364 (Why is no real title available?)
• scientific article; zbMATH DE number 1241365 (Why is no real title available?)
• scientific article; zbMATH DE number 1241366 (Why is no real title available?)
• scientific article; zbMATH DE number 1241368 (Why is no real title available?)
• scientific article; zbMATH DE number 1241370 (Why is no real title available?)
• scientific article; zbMATH DE number 1241374 (Why is no real title available?)
• scientific article; zbMATH DE number 1241375 (Why is no real title available?)
• scientific article; zbMATH DE number 1241377 (Why is no real title available?)
• scientific article; zbMATH DE number 1241380 (Why is no real title available?)
• scientific article; zbMATH DE number 1342113 (Why is no real title available?)
• scientific article; zbMATH DE number 1342114 (Why is no real title available?)
• scientific article; zbMATH DE number 908772 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• On the Computational Complexity of Program Scheme Equivalence
• On the computational power of DNA
• On the power of the splicing operation¹

Cited in

(12)

• Is DNA computing viable for 3-SAT problems?
• The enhanced double digest problem for DNA physical mapping
• Frontier between decidability and undecidability: A survey
• Cyclic DNA codes over the ring \(\mathbb {F}_2+u\mathbb {F}_2+v\mathbb {F}_2+uv\mathbb {F}_2+v^2\mathbb {F}_2+uv^2\mathbb {F}_2\)
• Theoretical and experimental DNA computation.
• scientific article; zbMATH DE number 1342100 (Why is no real title available?)
• scientific article; zbMATH DE number 1342102 (Why is no real title available?)
• scientific article; zbMATH DE number 1953215 (Why is no real title available?)
• scientific article; zbMATH DE number 2087005 (Why is no real title available?)
• scientific article; zbMATH DE number 2087022 (Why is no real title available?)
• Construction of cyclic DNA codes over \(\mathrm{Z}_4 R\)
• Experimental implementation and analysis of a DNA computing readout method based on real-time PCR with TaQman probes

This page was built for publication: Using DNA to solve the bounded Post correspondence problem

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