<--- Back to Details
First PageDocument Content
Turing machine / Automata theory / Models of computation / Computability theory / Read-only Turing machine / Finite-state machine / DNA computing / Computability / Deterministic automaton / Theory of computation / Theoretical computer science / Applied mathematics
Date: 2015-01-29 12:27:14
Turing machine
Automata theory
Models of computation
Computability theory
Read-only Turing machine
Finite-state machine
DNA computing
Computability
Deterministic automaton
Theory of computation
Theoretical computer science
Applied mathematics

Molecular Computing Machines M Yaakov Benenson Ehud Shapiro

Add to Reading List

Source URL: www.dna.caltech.edu

Download Document from Source Website

File Size: 1,86 MB

Share Document on Facebook

Similar Documents

Latent Domain Phrase-based Models for Adaptation Hoang Cuong and Khalil Sima’an Institute for Logic, Language and Computation University of Amsterdam Science Park 107, 1098 XG Amsterdam, The Netherlands {c.hoang,k.sima

DocID: 1uFJW - View Document

Grown-in Defects of InSb Crystals: Models and Computation N. Vaidya ∗, H. Huang †, and D. Liang ‡ Department of Mathematics & Statistics, York University Toronto, Canada M3J 1P3. August 22, 2005

DocID: 1u9va - View Document

NUMERICAL SOLUTION of MARKOV CHAINS, p. 1–22 Hypergraph-based Parallel Computation of Passage Time Densities in Large Semi-Markov Models ∗

DocID: 1u2vA - View Document

The Myriad simulator: parallel computation for densely integrated models Pedro Rittner , Andrew J. Davies, Thomas A. Cleland 1 Dept. of Psychology, Cornell University, Ithaca, NY Why another simulator?

DocID: 1tZVk - View Document

Aggregating Private Sparse Learning Models Using Multi-Party Computation Lu Tian, Bargav Jayaraman, Quanquan Gu, and David Evans University of Virginia https://oblivc.org/ppml

DocID: 1tvdd - View Document