how many computers can fit into a drop of water n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
How many computers can fit into a drop of water? PowerPoint Presentation
Download Presentation
How many computers can fit into a drop of water?

Loading in 2 Seconds...

play fullscreen
1 / 20

How many computers can fit into a drop of water? - PowerPoint PPT Presentation


  • 115 Views
  • Uploaded on

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.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'How many computers can fit into a drop of water?' - woods


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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
slide3

Medicine in 2050: “Doctor in a Cell”

Molecular Output

Molecular Input

Programmable Computer

scaling electro and bio devices
Scaling electro and bio devices

 = 0.25 micron

in Pentium II

scaling electro and bio devices1

1 micron

E. Coli

Scaling electro and bio devices

 = 0.25 micron

in Pentium II

ribosomes in operation
Ribosomes in operation

Ribosomes translate RNA to Proteins

RNA Polymerase transcribes DNA to RNA

slide10

A

4

3

5

2

1

slide11

B

1a

2a

3a

1b

2b

4a

3a

5a

4a

5a

4b

3b

5b

5b

3b

4b

Front

Back

slide17

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

slide18

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

molecular realization of finite automata

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