The following pages link to DNA Computing (Q5494350):
Displaying 10 items.
- Splicing systems with targets are computationally universal (Q671404) (← links)
- The complexity of small universal Turing machines: A survey (Q1004087) (← links)
- On the universality of Post and splicing systems (Q1575914) (← links)
- Nine test tubes generate any RE language (Q1575921) (← links)
- An alternative definition of splicing (Q2503274) (← links)
- The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
- ON SMALL UNIVERSAL SPLICING SYSTEMS (Q4923288) (← links)
- (Q5061519) (← links)
- Average-Case Completeness in Tag Systems (Q5090467) (← links)
- DNA Computing (Q5494338) (← links)