Solving computational learning problems of boolean formulae on DNA computers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2054, Issue , 2001, Pages 220-230

  Sakakibara, Yasubumi ^a  

^a TOKYO DENKI UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DNA; POLYMERASE CHAIN REACTION; PROBLEM SOLVING;

BOOLEAN FORMULAE; COMPUTATIONAL LEARNING; COMPUTATIONAL LEARNING THEORY; DISJUNCTIVE NORMAL FORM; DNA COMPUTER; DNF FORMULAS; MASSIVELY PARALLELS; TRUTH VALUES;

BOOLEAN ALGEBRA;

EID: 33745749072     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44992-2_15     Document Type: Conference Paper

References (12)

1. L. Adleman. Molecular computation of solutions to combinatorial problems. Science, 266, 1994, 1021 - 1024.
2. A. Blumer, A. Ehrenfeucht, D. Haussler, M. K. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM, 36, 1989, 929 - 965.
3. R. Board, L. Pitt. On the necessity of Occam algorithms. Theoretical Computer Science, 100, 1992, 157 - 184.
4. M. Hagiya, M. Arita, D. Kiga, K. Sakamoto, S. Yokoyama. Towards parallel evalu-ation and learning of Boolean fi-formulas with molecules. In Proc. of Third Annual Meeting on DNA Based Computers, 1997, 105 - 114.
5. M. Kearns, M. Li. Learning in the presence of malicious errors. In Proc. of 20th Annual ACM Symposium on Theory of Computing, ACM, 1988, 267-279.
6. M. Kearns, U. Vazirani. An Introduction to Computational Learning Theory. MIT Press, Massachusetts, 1994.
7. R. J. Lipton. DNA solution of hard computational problems. Science, 268, 1995, 542 - 545.
8. Gh. Păun, G. Rozenberg, A. Salomaa. DNA Computing. Springer-Verlag, Heidel-berg, 1998.
9. L. Pitt, L. G. Valiant. Computational limitations on learning from examples. Journal of the ACM, 35, 1988, 965 - 984.
10. Y. Sakakibara. Noise-tolerant Occam algorithms and their applications to learning decision trees. Machine Learning, 11, 1993, 37 - 62.
11. L. G. Valiant. A theory of the learnable. Communications of the ACM, 27, 1984, 1134 - 1142.
12. E. Winfree. Whiplash PCR for O(1) computing. In Proc. of Fourth Annual Meeting on DNA Based Computers, 1998.