Solving computational learning problems of Boolean formulae on DNA computers

DOI10.1007/3-540-44992-2_15MaRDI QIDQ4529983zbMATH OpenFDO

Authors Y. Sakakibara

Publication date 7 May 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2054/20540220

Mathematics Subject Classification ID

Computational learning theory (68Q32) Parallel algorithms in computer science (68W10)

Recommendations

• DNA-based algorithms for learning Boolean formulae
• Solution of a satisfiability problem on a gel-based DNA computer
• Simulating Boolean circuits on a DNA computer
• scientific article; zbMATH DE number 2089972
• Membrane Computing
• Automating the DNA Computer: Solving n-Variable 3-SAT Problems
• Automating the DNA computer: Solving \(n\)-variable 3-SAT problems
• scientific article; zbMATH DE number 1241364
• DNA computing-based algorithm for assignment problems

Cited in

(6)

• Simulating Boolean circuits on a DNA computer
• DNA-based algorithms for learning Boolean formulae
• Approximate reasoning on a DNA‐chip
• Molecular Learning of wDNF Formulae
• Thue systems and DNA -- a learning algorithm for a subclass
• Solution of a satisfiability problem on a gel-based DNA computer

This page was built for publication: Solving computational learning problems of Boolean formulae on DNA computers

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