Peptide Computers

DOI10.1007/978-3-642-31644-9_1zbMath1367.68092OpenAlexW4238595555MaRDI QIDQ3166940

M. Sakthi Balan, Helmut Jürgensen

Publication date: 1 November 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31644-9_1

Mathematics Subject Classification ID

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

Cites Work

• Constructivity in mathematics. Proceedings of the colloquium, held at Amsterdam, 1957
• Soliton automata
• On the universality of peptide computing
• Multiset theory
• On the power of parallel communicating Watson-Crick automata systems
• Incremental Building in Peptide Computing to Solve Hamiltonian Path Problem
• Peptide Computing – Universality and Theoretical Model
• Aspects of Molecular Computing
• College Admissions and the Stability of Marriage
• Biomolecular realizations of a parallel architecture for solving combinatorial problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Peptide Computers