| Literature DB >> 10636029 |
V Manca1, C Martín-Vide, G Păun.
Abstract
Inspired by the experiments in the emerging area of DNA computing, a somewhat unusual type of computation strategy was recently proposed by one of us: to generate a (large) set of candidate solutions of a problem, then remove the non-solutions such that what remains is the set of solutions. This has been called a computation by carving. This idea leads both to a speculation with possible important consequences--computing non-recursively enumerable languages--and to interesting theoretical computer science (formal language) questions.Mesh:
Substances:
Year: 1999 PMID: 10636029 DOI: 10.1016/s0303-2647(99)00031-3
Source DB: PubMed Journal: Biosystems ISSN: 0303-2647 Impact factor: 1.973