DNA implementation of simple Horn clause computation
| Autor: | Takashi Yokomori, S. Kobayashi, K. Mizobuchi, G. Sampei |
|---|---|
| Rok vydání: | 2002 |
| Předmět: |
Horn clause
Theoretical computer science Computer science Computation Logical consequence law.invention Boolean algebra Set (abstract data type) symbols.namesake TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Parallel processing (DSP implementation) DNA computing law symbols Concurrent computing |
| Zdroj: | Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97). |
| Popis: | In this paper, we propose a method for biologically implementing simple Boolean formulae. This method enables us to compute the logical consequences of a given set of simple Horn clauses in parallel and takes advantage of the potentially huge number of molecular CPUs in DNA computers. Further, we show that the method can be nicely applied to the parallel implementation of a grammatical recognition algorithm which is based on 'dynamic programming'. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|