Molecular Machine (Jacobson) Group MIT - November 2003 Avogadro Scale Engineering Day 1 - Form ~Getting to the Age of Complexity~

Slides:



Advertisements
Similar presentations
New Directions for DARPA ISAT Ad Hoc Working Group on DARPA Futures Initial Draft: July Update: July x 2 Beyond Strategic Computing:
Advertisements

ภาควิชาฟิสิกส์ คณะวิทยาศาสตร์ มหาวิทยาลัยมหิดล
Nano-Bio: Synergy of Biology, Physics and Chemistry Yehiam Prior Dean, Faculty of Chemistry November 2011.
1. What is it?3. Where does it come from? 2. Why do we use it? 4. How does it work? 6. How does it change us? 5. How does it change? 7. How do we change.
Extreme ultraviolet lithography : Pushing microchips down to the nanoscale A Wojdyla Center for X-Ray Optics - LBNL December 12 th,
University of Maryland Mechanical Engineering Department Structures ‘at the bottom’: Carbon nanotubes (CNT) few nm diameter  m length (avg human.
Nanomaterials & Nanotechnology
18 and 20 September, 2006 Chapter 8 DNA Replication.
Prospects for Terabit-scale nano electronic memories Venkata R.Malladi Instructor : Dr.Damian.
A Fault-tolerant Architecture for Quantum Hamiltonian Simulation Guoming Wang Oleg Khainovski.
Nanoscale Self-Assembly A Computational View Philip Kuekes Quantum Science Research HP Labs.
DNA Form & Function.
Tiny Technologies The Speculative Possibilities Work at MIT The Money
Self Replicating Mechanical Systems MAS.S62 FAB ] Complexity Per Cost 1] Exponential Manufacturing 2] Swarm Robotics 3] Reconfigurable Robotics.
Unit 4 – Molecular Genetics (Ch. 5.2)
MIT Molecular Machines (Jacobson) Group Building a FAB for Synthetic Biology
 Nanotechnology  Fundamentals  Semiconductor electronics & Nanoelectronics  Milestones in nanohistory  Approaches to Nanoelectronics.
MAS.S62 FAB The Threshold for Life
Towards Single Molecule Electronics
MAS.S62 FAB Synthetic Organisms and Novel Genetic Codes -Expanding the Genetic Code -Minimal Genomes -Genome Scale Engineering.
Molecular Machine (Jacobson) Group MIT – January 2005 Avogadro Scale Engineering.
MAS.S62 FAB Error Correcting Systems n MAJ p p p p p p p p p k.
DNA Based Self-Assembly and Nano-Device: Theory and Practice Peng Yin Committee Prof. Reif (Advisor), Prof. Agarwal, Prof. Hartemink Prof. LaBean, Prof.
MIT Molecular Machines (Jacobson) Group - Next Generation DNA Synthesis HTGAA.
The Science of Physics What is Physics? Physics is one of the natural sciences: BiologyGeologyBotany ChemistryAstronomyPaleontology PhysicsZoology Physics.
MAS.961 How To Make Something That Makes (Almost) Anything Complexity, Self Replication and all that…
FAB 2 MAS 960 Special Topics: How To Make Something That Makes (almost) Anything 1.Air inlets 2.Crushers 3.Ganglion 4.Multiple Visual.
3.052 Nanomechanics of Materials and Biomaterials Prof. Christine Ortiz DMSE, RM Phone : (617) WWW :
DNA Replication during cell division in eukaryotic cells, the replicated genetic material is divided equally between two daughter cells. it is important.
Chapter 3 Cells: The Living Units DNA & RNA Lecture 7, Part 2
Simple molecules
Section 5.2 cont’d SBI4UP MRS. FRANKLIN. Errors in DNA Replication When the DNA is being replicated there are many proteins involved in the process. Due.
MIT Molecular Machines (Jacobson) Group Fabricational Complexity.
“Politehnica” University of Timisoara Course Advisor:  Lucian Prodan Evolvable Systems Web Page:   Teaching  Graduate Courses Summer.
Simple molecules
From Megabytes to Megabases Building a Fab to Enable Synthetic Biology
Physics of Information Technology MIT – Spring 2006 PART II Avogadro Scale Engineering ‘COMPLEXITY’
Nanotechnology. Presented by Mr. Lundberg Test your knowledge of scale... What is the thickness of a dollar bill.. in nanometers? (the answer will be.
Lecture 1 – Overview (rSp06) ©2008 Joanne DeGroat, ECE, OSU -1- Functional Verification of Hardware Designs EE764 – Functional Verification of Hardware.
DNA Replication. Replication Occurs during cell division Must be accurate.
Introduction to Molecular Biology
Capabilities and limitations of quantum computers Michele Mosca 1 November 1999 ECC ’99.
Chromosomes and DNA replication. Procaryotes : DNA is in the cytoplasm, circular Chromosome E. Coli Bacterium Bases on the Chromosomes.
8.3 DNA Replication KEY CONCEPT General Description: DNA replication copies the genetic information of a cell.
Physics of Information Technology MIT – Spring 2006 Avogadro Scale Engineering ‘COMPLEXITY’
Christopher Monroe Joint Quantum Institute and Department of Physics NIST and University of Maryland Quantum Computation and Simulation.
Introduction to Molecular Biology. MOLECULAR BIOLOGY.
NANOCOMPUTING NANOCOMPUTING
DNA Replication (II) 王之仰.
ECE 551: Digital System Design & Synthesis
NanoMadeo Introduction of Error Correcting Schemes in the Design Process of Self-Healing Circuits for Nanoscale Fabrics.
Lecture 7 DFT Applications
Quantum corral of 48 iron atoms on copper surface
Top-down and Bottom-up Processes
DNA Replication.
copyright cmassengale
Avogadro Scale Engineering Molecular Machine (Jacobson) Group
Bio, Nano and Quantum Computing
How Big is a Nanometer? IBM chip UMass Logo TI mirror array.
Avogadro Scale Engineering & Fabricational Complexity
DNA Replication.
HIGH LEVEL SYNTHESIS.
Self Replicating Biochemical Systems
MICRO-50 Swamit Tannu Zachary Myers Douglas Carmean Prashant Nair
Chromosomal DNA Replication on a Protein “Chip”
The Scale of Things – Nanometers and More
Avogadro Scale Engineering & Fabricational Complexity
Molecular Machines (Jacobson) Group
DNA Replication Fidelity: Proofreading in Trans
Polymerases and the Replisome: Machines within Machines
Presentation transcript:

Molecular Machine (Jacobson) Group MIT - November 2003 Avogadro Scale Engineering Day 1 - Form ~Getting to the Age of Complexity~

Simple molecules <1nm IBM PowerPC 750 TM Microprocessor 7.56mm×8.799mm 6.35×10 6 transistors Semiconductor Nanocrystal ~1 nm m Circuit design Copper wiring width 0.1  m red blood cell ~5  m (SEM) DNA proteins nm bacteria 1  m Nanotube Transistor (Dekker) Molecular Machines (Jacobson) Group SOI transistor width 0.12  m diatom 30  m

Fabricational Complexity F fab = ln (W) / [ a 3  fab E fab ] F fab = ln (M)  -1 / [ a 3  fab E fab ] Total Complexity Complexity Per Unit Volume Complexity Per Unit Time*Energy Complexity Per unit Cost

Richard P. Feynman ( ) The chemist does a mysterious thing when he wants to make a molecule. He sees that it has got that ring, so he mixes this and that, and he shakes it, and he fiddles around. And, at the end of a difficult process, he usually does succeed in synthesizing what he wants… There is Plenty of Room at the Bottom December 29th, 1959

Caruthers Synthesis DNA Synthesis /services/catalog99.pdf Error Rate: 1: Seconds Per step

1.Beese et al. (1993), Science, 260, Replicate Linearly with Proofreading and Error Correction Fold to 3D Functionality template dependant 5'-3' primer extension 5'-3' error-correcting exonuclease 3'-5' proofreading exonuclease Error Rate: 1: Steps per second

Fault-Tolerant Circuits

1] Quantum Phase Space 2] Error Correcting Fabrication 3] Fault Tolerant Hardware Architectures 4] Fault Tolerant Software or Codes 5] Nonlinear Functional Approximations Resources which increase the complexity of a system exponentially with a linear addition in resource. Resourcees for Exponential Scaling Can we combine these in new ways to create something new?

Form: Fabricating Complexity Function: Statistical-Mechanical Engineering Foundations: Fundamental Limits and Uncertainty Relations Formats: Description Languages and Designs Tools Avogadro Scale Engineering: Goals

Foundations: Fundamental Limits, Conservation Laws and Uncertainty Relations Uncertainty Relations  Fabrication Complexity *  Code Complexity >= C1  Fragility *  Latency >= C2 Fundamental Limits F fab = ln (W) / [ a 3  fab E fab ] F fab = ln (M)  -1 / [ a 3  fab E fab ] Conservation Laws Conservation of Fragility Per Unit Complexity (Doyle’s Law) Resources for Exponential Complexity Scaling 1] Quantum Phase Space,2] Error Correcting Fabrication,3] Fault Tolerant Hardware Architectures,4] Fault Tolerant Software or Codes, 5] Nonlinear Functional Approximations