1 / 20

How many computers can fit into a drop of water?

How many computers can fit into a drop of water?. Udi Shapiro Ehud Shapiro. Medicine in 2050: “Doctor in a Cell” . Molecular Output. Molecular Input. Programmable Computer. Scaling electro and bio devices.  = 0.25 micron in Pentium II. 1 micron. E. Coli.

woods
Télécharger la présentation

How many computers can fit into a drop of water?

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. How many computers can fit into a drop of water? Udi Shapiro Ehud Shapiro

  2. Medicine in 2050: “Doctor in a Cell” Molecular Output Molecular Input Programmable Computer

  3. Scaling electro and bio devices  = 0.25 micron in Pentium II

  4. 1 micron E. Coli Scaling electro and bio devices  = 0.25 micron in Pentium II

  5. E. Coli

  6. E. Coli internals (1Mbyte)

  7. Ribosomes in operation Ribosomes translate RNA to Proteins RNA Polymerase transcribes DNA to RNA

  8. A mechanical computer

  9. A 4 3 5 2 1

  10. B 1a 2a 3a 1b 2b 4a 3a 5a 4a 5a 4b 3b 5b 5b 3b 4b Front Back

  11. Medicine in 2050: “Doctor in a Cell” Programmable Computer

  12. Automaton A1 accepting inputs with an even number of b ’s a a b S0 S1 b A1: even number of b’s

  13. Turing Machine and Finite Automaton

  14. Example Computation

  15. An example computation over abaaba S0-abaaba (S0 S0) S0-baaba (S0 S1) S1-aaba (S1 S1) S1-aba (S1 S1) S1-ba (S1 S0) S0-a (S0 S0) S0 (final state) The input is accepted

  16. A list of all 8 possible transition rules T1: S0 S0 T2: S0 S1 T3: S0 S0 T4: S0 S1 T5: S1 S0 T6: S1 S1 T7: S1 S0 T8: S1 S1

  17. Automata programs used to test the molecular implementation

  18. Input: DNA S, a a’ rest • Software: DNA FokI S, a • Hardware: Class-II restriction enzyme FokI, DNA Ligase, ATP as fuel Molecular realization of Finite Automata

More Related