Combinatorial Algorithms and Computational Complexity for DNA Self-Assembly
|
|
- Hector Morton
- 5 years ago
- Views:
Transcription
1 Combinatorial Algorithms and Computational Complexity for DNA Self-Assembly Ming-Yang Kao Northwestern University Evanston, Illinois USA Presented at Kyoto University on December 12, 2013
2 Outline of the Talk 1. examples of self-assembly 2. examples of DNA self-assembly 3. a basic model for DNA self-assembly 4. combinatorial problems for DNA self-assembly use DNAs to self-assemble shapes use DNAs to self-assemble circuits design DNA sequences for DNA self-assembly If we have time 5. general research directions 2
3 What Is Self-Assembly? [adapted from a slide of Shinnosuke Seki] Self-assembly is a phenomenon in which complex structures emerge from simple components through local interactions with limited global control. 3
4 Example of Self-Assembly Self-Assembly by Magnetic Forces [ 2007] 4
5 Example of Self-Assembly Self-Assembly of Stars into Galaxy [hubblesite.org, ] 5
6 Example of Self-Assembly Hydrophilic and Hydrophobic Interactions [ proteins and molecules on cell membrane 6
7 Example of Self-Assembly Human Language Development [adapted from a slide of S. Seki] Speaking similar languages leads to being socially close. Being socially close leads to similar languages. 7
8 Example of Self-Assembly Robot Self-Assembly via Cellular Automata [Tuci et al., 2006] A group of robots physically connected to each other that (a) moves on rough terrain and (b) passes over a gap during an experiment in a close arena with a flat terrain. 8
9 Example of Self-Assembly Robot Self-Assembly -- Kilorobot Project [Self-Organizing Systems Research Group, Harvard, 2011] 9
10 Example of Self-Assembly Crystal Formation [ Zhang, 2001] 10
11 Example of Self-Assembly Insulation around Copper Wiring [ 2007] This microprocessor cross section shows empty space in between the chip s copper wiring. Wires are usually insulated with a glasslike material, but IBM has used selfassembly techniques, which can be employed in chip-making facilities, to create air gaps that insulatethe wires. Credit: IBM 11
12 Example of Self-Assembly Self-Assembly of Hot Dog Slices [bradley.bradley.edu/~campbell/demopix6.html, 2013] Left: Cutting hot dogs into slices. Right: Floating them in a pan of water. 12
13 Example of Self-Assembly Self-Assembly of Lego Pieces [ 2007] LEGO Bricks + Water + Capillary Forces 13
14 Example of Self-Assembly DNA Brick Structures Analogous to LEGO Brick Structures [Ke et al., Science 2012, 338: , Peng Yin s Lab at Harvard] 14
15 Message: Self-assembly is everywhere and has many kinds! Focus of This Talk: Algorithmic DNA Self-Assembly 15
16 Algorithmic DNA Self-Assembly Algorithms + DNA + Self-Assembly In the intersection of Nanotechnology Theoretical Computer Science 16
17 Algorithmic DNA Self-Assembly Nanotechnology + Theoretical Computer Science Objective: Use DNA to create nanostructures. Methodology: Step 1: Encode a program into DNAs. Step 2: Execute the program to guide the DNAs to self-assemble into desired nanostructures. How to encode a program: DNA has 4 bases, A, C, G, T. How to execute a program: A T and C G. When DNAs bind, the binding executes the program. There are other possibilities for the above! 17
18 Types of Algorithmic DNA Self-Assembly 1 dimensional 2 dimensional 3 dimensional more focus of this talk 18
19 DNA Tiles -- Basic Unit of 2D Self-Assembly TILE encode a program execute the program G C A T C G C G T A G C 19
20 Algorithmic DNA Self-Assembly Program = Tiles + Lab Steps Output = Shape + Pattern 20
21 Examples of DNA Tiles [Holliday, 1964] exchange of genetic information in yeast aaa a 21
22 Examples of DNA Tiles aaa a TILE aaa a 22
23 Examples of DNA Tiles [Reif s Group, Duke University] A G A T C G A C T C T A G C T G T A C C G C A T A T G G C G T A A T A G C T A T C G T G A T C G G A A C T A G C C T G C T T G A C C C G A A C T G G A T A G C T A T C G A T A G C T A T C G A C T A G C C T A C T A G C C T C T A G C C G T G A T C G G C A G T A C A C A T G T A T A G C T A T C G A T A G C T A T C G T G A A T A G C A C T T A T C G A C T A G C C T A C T A G C C T A T A G C T A T C G A T A G C T A T C G G A C A G C G G T C T T C C A 9 DNA sequences T T A G T 23
24 Examples of DNA Tiles [Park, Pistol, Ahn, Reif, Lebeck, Dwyer, and LaBean, 2006] 24
25 Examples of DNA Tiles [Winfree s Group, Cal Tech] 25
26 Examples of DNA Tiles [Sierpinski Triangle, Rothemund, Papadakis, Winfree, 2004] 26
27 Recap: Algorithmic DNA Self-Assembly Objectives and Methodologies: 1. Use DNA to compute. 2. Use computation to guide DNAs to selfassemble. Next, we will see 1. some examples and 2. some basic models for such computation. 27
28 Self-Assembly for Binary Counters [Winfree, 2000]
29 Examples of DNA Tiles [Winfree s Group, Cal Tech] 29
30 Self-Assembly for Binary Counters [Barish, Rothemund, Winfree, 2005] 30
31 2D Self-Assembly for Turing Machines [Winfree, Yang, and Seeman, 1998]
32 1D Self-Assembly for Regular Languages [Winfree, Yang, and Seeman, 1998]
33 Tree Self-Assembly for Context-Free Languages [Winfree, Yang, and Seeman, 1998]
34 Example of Self-Assembly DNA Brick Structures Analogous to LEGO Brick Structures [Ke et al., Science 2012, 338: , Peng Yin s Lab at Harvard] 34
35 A Basic Model of DNA Self-Assembly [Rothemund and Winfree, STOC 2000] tile system: (T, s, G, t) T: tile set s: seed tile r {,,... } b y y w, b b g p r r r G: glue function G : {0,1,..., t} t : temperature, positive integer 35
36 T = S x Example: Build a Square 1. positive strength between same glues 2. zero strength between distinct glues 3. start with the seed tile 4. add one tile at a time 5. bind if total strength is at least t a c 6. order must not affect final shape and pattern b d G(, ) = 2 G(, ) = 2 G(, ) = 2 G(, ) = 2 G(, ) = 1 G(, ) = 1 G(, ) = 1 temperature t = 2 36
37 Example: Build a Square T = S a b G(, ) = 2 G(, ) = 2 G(, ) = 2 x c d G(, ) = 2 G(, ) = 1 G(, ) = 1 G(, ) = 1 temperature t = 2 S 37
38 Example: Build a Square T = S a b G(, ) = 2 G(, ) = 2 G(, ) = 2 x c d G(, ) = 2 G(, ) = 1 G(, ) = 1 G(, ) = 1 temperature t = 2 S a 38
39 Example: Build a Square T = S a b G(, ) = 2 G(, ) = 2 G(, ) = 2 x c d G(, ) = 2 G(, ) = 1 G(, ) = 1 G(, ) = 1 temperature t = 2 c S a 39
40 Example: Build a Square T = S a b G(, ) = 2 G(, ) = 2 G(, ) = 2 x c d G(, ) = 2 G(, ) = 1 G(, ) = 1 G(, ) = 1 d temperature t = 2 c S a 40
41 Example: Build a Square T = S a b G(, ) = 2 G(, ) = 2 G(, ) = 2 x c d G(, ) = 2 G(, ) = 1 G(, ) = 1 G(, ) = 1 d temperature t = 2 c S a b 41
42 Example: Build a Square T = S a b G(, ) = 2 G(, ) = 2 G(, ) = 2 x c d G(, ) = 2 G(, ) = 1 G(, ) = 1 G(, ) = 1 d temperature t = 2 c x S a b 42
43 Example: Build a Square T = S a b G(, ) = 2 G(, ) = 2 G(, ) = 2 x c d G(, ) = 2 G(, ) = 1 G(, ) = 1 G(, ) = 1 d temperature t = 2 c x x S a b 43
44 Example: Build a Square T = S a b G(, ) = 2 G(, ) = 2 G(, ) = 2 x c d G(, ) = 2 G(, ) = 1 G(, ) = 1 G(, ) = 1 d x temperature t = 2 c x x S a b 44
45 Example: Build a Square T = S a b G(, ) = 2 G(, ) = 2 G(, ) = 2 x c d G(, ) = 2 G(, ) = 1 G(, ) = 1 G(, ) = 1 d x x temperature t = 2 c x x S a b 45
46 Observations size of the 3 x 3 square = 9 cells number of distinct tiles used = 6 Question #1: To assemble an n x n square, how many distinct tiles do we need? Answer #1: at most n 2 distinct tiles. Question #2: What is the smallest number of distinct tiles that we need? Answer #2:??? 46
47 Example of Combinatorial Problems Tile Complexity for Shapes Input: a connected shape S Output: a minimum number of tiles that selfassembles S. 47
48 Tile Complexity of Squares Theorem: (Adleman et al. 2001) 1. An n x n square can be self-assembled by Θ(log n/log log n) distinct tiles at temperature Such a tile set can be computed in polynomial time in n. 48
49 Tile Complexity of General Shapes Theorem: (Adleman et al. 2002) For general shapes, it is NP-hard to compute a minimum number of distinct tiles to self-assemble a given shape at a fixed temperature. Open Problem: polynomial-time approximation algorithms with good approximation ratios 49
50 Tile Complexity of Squares Question: Can we do better than Theta(log n/log log n) for squares? Answer: Yes, if we adjust the temperature. 50
51 Temperature Programming the Case of Squares Theorem: [Kao, Schweller 2006] We can selfassemble a n x n square using O(1) tiles and adjusting the temperature O(log n) times using O(1) different temperatures. Intuition: Adjusting temperature is a form of encoding information and programs into selfassembly. 51
52 Temperature Programming for General Shapes Theorem: [Summers 2009] There is a set of O(1) distinct tiles that can selfassemble any finite shape S by adjusting the temperatures O(kolmogorov(S)) times, using O(1) distinct temperatures, and scaling the shape S by a constant factor c, where c depends on S. Kolmogorov(S) = Kolmogorov complexity of S 52
53 Temperature Programming for General Shapes Theorem: [Summers 2009] There is a set of O(1) distinct tiles that can selfassemble any finite shape S by adjusting the temperatures O( S ) times, using O(1) distinct temperatures, and scaling the shape S by a constant factor 22. trade-off: scaling factor versus # of temperature adjustments 53
54 Why Do We Want to Assemble Shapes? There are many potential science-fictionlike applications, including the following one: producing nano-circuits 54
55 A Long-Range Research Goal of This Field DNA Self-Assembly for Nano-Circuits [adapted from a slide of Shinnosuke Seki] 55
56 How to Self-Assemble a Nano-Circuit? Possible Methodology: Step 1: Attach circuit components to DNA tiles. Step 2: DNA tiles self-assemble into a pattern. Step 3: The pattern is the desired circuit. circuit components: AND-gate, OR-gate, NOTgate, wire, etc. 56
57 Proof of Concept Self-Assembly for Circuit Patterns [Cook, Rothemund, and Winfree, 2003]
58 Proof of Concept Attaching Gold Particles to DNA Tiles [Reif s Group, Duke University] A G A T C G A C T C T A G C T G T A C C G C A T A T G G C G T A A T A G C T A T C G T G A T C G G A A C T A G C C T G C T T G A C C C G A A C T G G A T A G C T A T C G A T A G C T A T C G A C T A G C C T A C T A G C C T C T A G C C G T G A T C G G C A G T A C A C A T G T A T A G C T A T C G A T A G C T A T C G T G A A T A G C A C T T A T C G A C T A G C C T A C T A G C C T A T A G C T A T C G A T A G C T A T C G G A C A G C G G T C T T C C A T T A G T 58
59 Proof of Concept Attaching Gold Particles to DNA Tiles [Park, Pistol, Ahn, Reif, Lebeck, Dwyer, and LaBean, 2006] 59
60 A Model for Self-Assembly of Circuits Changes to the Basic Model: 1. Locations in the input shape have colors. 2. Tiles also have colors. 3. Colors correspond to circuit components. 4. The color of a tile at a location matches the color of that location. 5. L-shape seed: the assembly starts with a L-shape border rather than a single tile. self-assembly for circuits = self-assembly for color patterns 60
61 Self-Assembly for Circuit Patterns [Cook, Rothemund, and Winfree, 2003] component (or functionality) of a location or tile = color of that location or tile L-seed
62 Self-Assembly for Color Patterns 62
63 Self-Assembly for Color Patterns 63
64 Self-Assembly for Color Patterns 64
65 Self-Assembly for Color Patterns 65
66 Example of Combinatorial Problems The PATS Problem (Patterned Self-Assembly Tile Synthesis) Input: a color pattern P of a rectangular shape. Output: a minimum number of tiles that selfassembles P starting from an L-shape seed. 66
67 Computational Complexity of PATS Theorem: (Czeizler, Popa 2012) If the input pattern may have an arbitrary number of colors, PATS is NPhard. Theorem: (Seki 2013) For 60-color patterns, PATS is NP-hard. 67
68 Computational Complexity for PATS Theorem: (Johnsen, Kao, Seki, in ISAAC 2013) 1. For 29-color patterns, PATS is NP-hard. 2. Moreover, approximation of the minimum number of tiles within a factor of 47/46 is NPhard as well. Proof: 1. Reduction from Subset Sum. 2. Case analysis based on 118 color patterns. 68
69 Some Tiles and Patterns in Proof of NP-Hardness of 29-Color PATS 69
70 Some Tiles and Patterns in Proof of NP-Hardness of 29-Color PATS 70
71 Some Tiles and Patterns in Proof of NP-Hardness of 29-Color PATS 71
72 Some Tiles and Patterns in Proof of NP-Hardness of 29-Color PATS 72
73 Some Tiles and Patterns in Proof of NP-Hardness of 29-Color PATS 73
74 Some Tiles and Patterns in Proof of NP-Hardness of 29-Color PATS 74
75 Further Work for Self-Assembly of Circuits Work in Progress: For 11-color patterns, PATS is NP-hard. (Johnsen and Seki) Work in Progress: For 4-color patterns, PATS is NP-hard. (Cal Tech, computer-generated case analysis) Conjecture: For 2-color patterns, PATS is NP-hard. Fact: For 1-color patterns, PATS only needs 1 tile in addition to the L-seed. Open Problem: good approximation algorithms for PATS final objective 75
76 Key Steps in Design of Tile Self-Assembly 1. Specify a shape or a pattern. 2. Design a tile system to self-assemble the shape or pattern. 3. Design DNA words (i.e., DNA sequences) to form the tiles. 76
77 DNA Tiles TILE G C A T C G DNA words C G T A G C 77
78 Applications of DNA Word Design Information Storage at Molecular Level Molecular Bar Codes DNA Arrays Algorithmic DNA Self-Assembly focus of this talk. 78
79 Example of Combinatorial Problems DNA Word Design Context: We are given some constraints on the desired words, and the alphabet DNA = {A,C,G,T}. Algorithmic Problem: Input: an integer n Output: a code W of n words of same length L: W satisfies the constraints, and L is minimized. 79
80 Two Types of Constraints Binding Constraints: Such constraints are heuristics that help maximize the probability that each word X in W only binds with its Watson-Crick complement X C. X = A G T T A G C X C = T C A A T C G Thermodynamic Constraints: Such constraints are heuristics that help maximize the probability that all words in W have similar thermodynamic properties (e.g., melting temperature). 80
81 9 Constraints Considered for Our Work All 9 constraints are taken from the literature. Binding Constraints: 1. Basic Hamming Constraint C 1 (k 1 ) 2. Reverse Complementary Constraint C 2 (k 2 ) 3. Self Complementary Constraint C 3 (k 3 ) 4. Shifting Hamming Constraint C 4 (k 4 ) 5. Shifting Reverse Complementary Constraint C 5 (k 5 ) 6. Shifting Self Complementary Constraint C 6 (k 6 ) 7. Consecutive Base Constraint C 8 (d) Thermodynamic Constraints: 1. GC Content Constraint C 7 (ϒ) 2. Free Energy Constraint C 9 (σ) 81
82 Binding Constraints and Hamming Distance Ideal Case for Binding: Two DNA words X and Y bind only when X and Y are Watson-Crick complementary. X = A G T T A G C Y = T C A A T C G Non-Ideal Case for Binding: X may bind with Y even if X and Y are not 100% complementary. Binding Constraints: To help prevent non-matched binding, we want a large Hamming distance between X and Y C. 82
83 Basic Hamming Constraint C 1 (k 1 ) Mathematical Condition: For all distinct words Y and X in W, H(Y, X) k 1. Y X Hamming distance Biological Meaning: This constraint helps prevent X from binding with the complement of Y. 83
84 Reverse Complementary Constraint C 2 (k 2 ) Mathematical Condition: For all distinct words Y and X in W, H(Y,X RC ) k 2. Y Y X YL-1Y L C L X C L-1...X C 2 X C 1 X R X = reverse of X = X 1 X 2 X L X R = X L X 2 X 1 Biological Meaning: This constraint helps prevent Y from binding with the reverse of X. 84
85 Self Complementary Constraint C 3 (k 3 ) Same as C 2 (k 2 ) but with X = Y. Mathematical Condition: For each word Y in W, H(Y, Y RC ) k 3. Biological Meaning: This constraint prevents a word Y from binding with the reverse of itself. 85
86 Shifting Hamming Constraint C 4 (k 4 ) Mathematical Condition: For all distinct words Y and X in W, H (Y [1..i],X[(L i + 1)..L]) k 4 (L i) for all L i L k 4. Y X Biological Meaning: This constraint helps prevent a prefix of Y from binding with the complement of a suffix of X. 86
87 Shifting Reverse Complementary Constraint C 5 (k 5 ) Mathematical Condition: For all distinct words Y and X in W, H(Y[1..i], X[1..i] RC ) k 5 (L i), and H(Y[(L i + 1)..L],X [(L i + 1)..L] RC k 5 (L i) for all L i L k 5. X C L X C L-1 Y Y...X YL-1Y L C 2 X C 1 Y Y YL-1Y L X C L X C L-1...X Biological Meaning: This constraint helps prevent a prefix of Y from binding with the reverse of a prefix of X and prevent a suffix of Y from binding with the reverse of a suffix of X. 87 C 2 X C 1
88 Shifting Self Complementary Constraint C 6 (k 6 ) Same as C 5 (k 5 ) but with X = Y. Mathematical Condition: For each word Y in W, H(Y [1..i], Y[1..i] RC ) k 6 (L i), and H(Y [(L i + 1)..L, Y [(L i + 1)..L] RC ) k 6 (L i) for all L i L k 6. Y Y YL-1Y L Y Y Y C L Y C C L YL-1Y L Y C Y...Y...Y L L Biological Meaning: This constraint helps prevent a prefix of Y from binding with its reverse and prevent a suffix of Y from binding with its reverse. 88 C C 2 Y Y C C 1
89 GC Content Constraint C 7 (ϒ) Mathematical Condition: ϒ percentage of the bases in any word Y in W are either G or C. AGCTCCCCCCTTAAA GGTCGCAATTTTGGC Biological Meaning: The GC content affects the thermodynamic properties of a word. Having the same ratio of GC content for all the words helps ensure that the words in W have similar thermodynamic characteristics. 89
90 Consecutive Base Constraint C 8 (d) Mathematical Condition: No word has more than d consecutive bases. A A A A A A A G G G G G G G G T T T T T T T C C C C C C C C AGCTCCCCCCTTAAA E.g., two perfectly complementary words bind at wrong positions. Biological Meaning: In some applications, consecutive occurrences of the same base increase binding errors. 90
91 Free Energy Constraint C 9 (σ) Mathematical Condition: For all words Y and X in W, FE(Y ) FE(X) σ. free energy Biological Meaning: This constraint ensures that the words in W have similar melting temperatures, which allows the DNA words in W to bind under the same temperature. 91
92 Free Energy of a DNA Word [Breslauer et al. 1986] Free Energy of X = x 1 x 2... x L : FE(X) = a constant + sum of pair-wise energies Γ( x, x2) + Γ( x2, x3) + + Γ( x L 1, x 1 L ) 92
93 Recap: Problem Formulation for DNA Self-Assembly Context: We are given some constraints on the desired words, and the alphabet DNA = {A,C,G,T}. Algorithmic Problem: Input: an integer n Output: a code W of n words of same length L: W satisfies the constraints, and L is minimized. 93
94 Previous Results heuristics without performance guarantees [most of the previous works] NP-hardness for some variants of the problem [Phan, Garzon 2008] randomized algorithms [Kao, Sanghi, Schweller 2005] 1. word length optimal to within a multiplicative constant 2. running time polynomial in the output size 3. satisfying the constraints with high probability 94
95 Approximation Algorithms for DNA Word Design Theorem: (Kao, Leung, Sung, Zhang, 2010) We can constructs a code C 1,4 of n words that satisfies constraints C 1 (k 1 ) and C 4 (k 4 ) such that 1. the word length L is optimal to within a multiplicative constant; i.e., L = Theta(k + log n), where k = max {k 1, k 4 }, 2. the time complexity is polynomial in the output size, and 3. the algorithm is deterministic. 95
96 Approximation Algorithms for DNA Word Design Theorem: (Kao, Leung, Sung, Zhang, 2010) We can construct a code C 1~8 of n DNA words that satisfies constraints C 1 (k 1 ), C 2 (k 2 ), C 3 (k 3 ), C 4 (k 4 ), C 5 (k 5 ), C 6 (k 6 ), C 7 (ϒ), C 8 (d) such that 1. the word length L is optimal to within a multiplicative constant; i.e., L = Theta(k + log n), where k = max {k 1, k 2, k 3, k 4, k 5, k 6 }, 2. the time complexity is polynomial in the output size, and 3. the algorithm is deterministic. 96
97 Approximation Algorithms for DNA Word Design Theorem: (Kao, Leung, Sung, Zhang, 2010) We can construct a code C 1~6,9 of n DNA words that satisfies constraints C 1 (k 1 ), C 2 (k 2 ), C 3 (k 3 ), C 4 (k 4 ), C 5 (k 5 ), C 6 (k 6 ), C 9 (σ) such that 1. the word length L is optimal to within a multiplicative constant; i.e., L = Theta(k + log n), where k = max {k 1, k 2, k 3, k 4, k 5, k 6 }, 2. the time complexity is polynomial in the output size, and 3. the algorithm is deterministic. 97
98 Further Research for DNA Word Design Concrete Open Problems: Our codes can satisfy only subsets of the 9 constraints, but not all the constraints at the same time. Design codes that satisfy all 9 constraints. General Research Direction: Adapt our randomized and derandomization techniques to other codeword design problems. 98
99 Conclusions 1. There many research possibilities for DNA selfassembly and other kinds of self-assemblies! 2. General research directions include: novel (or science-fiction-like ) applications of selfassembly (especially in Medicine) novel models for self-assembly in-vitro implementations efficient tile systems (e.g., small tile complexity) computational powers of self-assembly models fault-tolerant self-assembly (e.g., error correction) many more 99
100 Thank you! Any questions? 100
Molecular Self-Assembly: Models and Algorithms
Molecular Self-Assembly: Models and Algorithms Ashish Goel Stanford University MS&E 319/CS 369X; Research topics in optimization; Stanford University, Spring 2003-04 http://www.stanford.edu/~ashishg Self-Assembly
More informationActive Tile Self Assembly:
Active Tile Self Assembly: Simulating Cellular Automata at Temperature 1 Daria Karpenko Department of Mathematics and Statistics, University of South Florida Outline Introduction Overview of DNA self-assembly
More informationRandomized Fast Design of Short DNA Words
Randomized Fast Design of Short DNA Words Ming-Yang Kao, Manan Sanghi, and Robert Schweller Department of Computer Science Northwestern University Evanston, IL 60201, USA {kao,manan,schwellerr}@cs.northwestern.edu
More informationInteger and Vector Multiplication by Using DNA
Int. J. Open Problems Compt. Math., Vol. 1, No. 2, September 2008 Integer and Vector Multiplication by Using DNA Essam Al-Daoud 1, Belal Zaqaibeh 2, and Feras Al-Hanandeh 3 1 Computer Science Department,
More informationDNA Computing by Self Assembly. Presented by Mohammed Ashraf Ali
DNA Computing by Self Assembly Presented by Mohammed Ashraf Ali Outline Self- Assembly Examples and behaviour of self-assembly DNA Computing Tiling Theory Nanotechnology DNA Self-assembly Visualization
More informationThe Design and Fabrication of a Fully Addressable 8-tile DNA Lattice
The Design and Fabrication of a Fully Addressable 8-tile DNA Lattice Chris Dwyer 1,3, Sung Ha Park 2, Thomas LaBean 3, Alvin Lebeck 3 1 Dept. of Electrical and Computer Engineering, Duke University, Durham,
More informationHow Does Nature Compute?
How Does Nature Compute? Lila Kari Dept. of Computer Science University of Western Ontario London, ON, Canada http://www.csd.uwo.ca/~lila/ lila@csd.uwo.ca Computers: What can they accomplish? Fly spaceships
More informationParallel Solution to the Dominating Set Problem by Tile Assembly System
Appl. Math. Inf. Sci. 8, No. 1, 345-349 (2014) 345 Applied Mathematics & Information Sciences An International Journal http://dx.doi.org/10.12785/amis/080143 Parallel Solution to the Dominating Set Problem
More informationOverview of New Structures for DNA-Based Nanofabrication and Computation
Overview of New Structures for DNA-Based Nanofabrication and Computation Thomas H. LaBean, Hao Yan, Sung Ha Park, Liping Feng, Peng Yin, Hanying Li, Sang Jung Ahn, Dage Liu, Xiaoju Guan, and John H. Reif
More informationNP-completeness. Chapter 34. Sergey Bereg
NP-completeness Chapter 34 Sergey Bereg Oct 2017 Examples Some problems admit polynomial time algorithms, i.e. O(n k ) running time where n is the input size. We will study a class of NP-complete problems
More informationStrict Self-Assembly of Discrete Sierpinski Triangles
Strict Self-Assembly of Discrete Sierpinski Triangles James I. Lathrop 1, Jack H. Lutz 2, and Scott M. Summers 3 1 Department of Computer Science, Iowa State University, Ames, IA 50011, USA. jil@cs.iastate.edu
More informationvon Neumann Architecture
Computing with DNA & Review and Study Suggestions 1 Wednesday, April 29, 2009 von Neumann Architecture Refers to the existing computer architectures consisting of a processing unit a single separate storage
More informationSolving NP-Complete Problems in the Tile Assembly Model
Solving NP-Complete Problems in the Tile Assembly Model Yuriy Brun Department of Computer Science University of Southern California Los Angeles, CA 989 Email: ybrun@usc.edu Abstract Formalized study of
More informationCPSC 506: Complexity of Computa5on
CPSC 506: Complexity of Computa5on On the founda5ons of our field, connec5ons between Science and Compu5ng, where our field might be headed in the future CPSC 506 MW 9-10:30, DMP 101 cs.ubc.ca/~condon/cpsc506/
More informationLimitations of Self-Assembly at Temperature 1
Limitations of Self-Assembly at Temperature 1 David Doty, Matthew J. Patitz, and Scott M. Summers Department of Computer Science Iowa State University Ames, IA 50011, USA {ddoty,mpatitz,summers}@cs.iastate.edu
More informationOn Times to Compute Shapes in 2D Tile Self-Assembly
On Times to Compute Shapes in 2D Tile Self-Assembly Yuliy Baryshnikov 1 Ed Coffman 2 Boonsit Yimwadsana 2 1 Bell Labs, Lucent Technologies, Murray Hill, NJ 07974 2 Electrical Engineering Dept., Columbia
More informationComplexity Theory VU , SS The Polynomial Hierarchy. Reinhard Pichler
Complexity Theory Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 15 May, 2018 Reinhard
More informationOutline. Complexity Theory EXACT TSP. The Class DP. Definition. Problem EXACT TSP. Complexity of EXACT TSP. Proposition VU 181.
Complexity Theory Complexity Theory Outline Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität
More informationAutonomous Programmable Nanorobotic Devices Using DNAzymes
Autonomous Programmable Nanorobotic Devices Using DNAzymes John H. Reif and Sudheer Sahu Department of Computer Science, Duke University Box 929, Durham, NC 2778-29, USA {reif,sudheer}@cs.duke.edu Abstract.
More informationProgrammable DNA Self-Assemblies for Nanoscale Organization of Ligands and Proteins
Programmable DNA Self-Assemblies for Nanoscale Organization of Ligands and Proteins NANO LETTERS 2005 Vol. 5, No. 4 729-733 Sung Ha Park, Peng Yin, Yan Liu, John H. Reif, Thomas H. LaBean,*, and Hao Yan*,
More informationOritatami, a model of cotranscriptional folding
Oritatami, a model of cotranscriptional folding Shinnosuke Seki TUS seminar March 4th, 2015 Is folding hard? Most structures in the nature, however complex and intricate, are obtained from a linear genetic
More informationCS256 Applied Theory of Computation
CS256 Applied Theory of Computation Compleity Classes III John E Savage Overview Last lecture on time-bounded compleity classes Today we eamine space-bounded compleity classes We prove Savitch s Theorem,
More information1 Computational Problems
Stanford University CS254: Computational Complexity Handout 2 Luca Trevisan March 31, 2010 Last revised 4/29/2010 In this lecture we define NP, we state the P versus NP problem, we prove that its formulation
More informationOn the Complexity of Graph Self-assembly in Accretive Systems
On the Complexity of Graph Self-assembly in Accretive Systems Stanislav Angelov, Sanjeev Khanna, and Mirkó Visontai Department of Computer and Information Science School of Engineering and Applied Sciences
More informationThe PATS Problem: Search Methods and Reliability
The PATS Problem: Search Methods and Reliability Tuomo Lempiäinen Minor subject thesis UNIVERSITY OF HELSINKI Department of Computer Science Helsinki, 21st May 215 HELSINGIN YLIOPISTO HELSINGFORS UNIVERSITET
More informationNotes for Lecture Notes 2
Stanford University CS254: Computational Complexity Notes 2 Luca Trevisan January 11, 2012 Notes for Lecture Notes 2 In this lecture we define NP, we state the P versus NP problem, we prove that its formulation
More information3 rd Conference on Foundations of Nanoscience (FNANO06): Self- Assembled Architectures and Devices
3 rd Conference on Foundations of Nanoscience (FNANO06): Self- Assembled Architectures and Devices Snowbird Cliff Lodge~Snowbird, Utah April 23-27, 2006. Sponsors: Defense Advanced Research Projects Agency
More informationCSC 373: Algorithm Design and Analysis Lecture 15
CSC 373: Algorithm Design and Analysis Lecture 15 Allan Borodin February 13, 2013 Some materials are from Stephen Cook s IIT talk and Keven Wayne s slides. 1 / 21 Announcements and Outline Announcements
More informationUmans Complexity Theory Lectures
Complexity Theory Umans Complexity Theory Lectures Lecture 1a: Problems and Languages Classify problems according to the computational resources required running time storage space parallelism randomness
More informationComplexity Classes in Membrane Computing
Complexity Classes in Membrane Computing Fernando Sancho Caparrini Research Group on Natural Computing Dpt. Computer Science and Artificial Intelligence University of Seville, Spain Goal Main Object of
More informationProgrammable Control of Nucleation for Algorithmic Self-Assembly
Programmable Control of Nucleation for Algorithmic Self-Assembly (Extended Abstract ) Rebecca Schulman and Erik Winfree California Institute of Technology, Pasadena, CA 91125, USA {rebecka,winfree}@caltech.edu
More informationFinite State Transducers
Finite State Transducers Eric Gribkoff May 29, 2013 Original Slides by Thomas Hanneforth (Universitat Potsdam) Outline 1 Definition of Finite State Transducer 2 Examples of FSTs 3 Definition of Regular
More informationSelf-Assembly and Convergence Rates of Heterogeneous Reversible Growth Processes (Extended Abstract)
Self-Assembly and Convergence Rates of Heterogeneous Reversible Growth Processes (Extended Abstract) Amanda Pascoe 1 and Dana Randall 2 1 School of Mathematics, Georgia Institute of Technology, Atlanta
More information1. Introduction OPTIMAL TIME SELF-ASSEMBLY FOR SQUARES AND CUBES
OPTIMAL TIME SELF-ASSEMBLY FOR SQUARES AND CUBES FLORENT BECKER 1, ÉRIC RÉMILA 1, AND NICOLAS SCHABANEL 2 E-mail address: florent.becker@ens-lyon.fr E-mail address: eric.remila@ens-lyon.fr E-mail address:
More informationTwo Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. atam
Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. atam Sarah Cannon 1, Erik D. Demaine 2, Martin L. Demaine 3, Sarah Eisenstat 4, Matthew J. Patitz 5, Robert T. Schweller
More informationRandomness and non-uniformity
Randomness and non-uniformity JASS 2006 Course 1: Proofs and Computers Felix Weninger TU München April 2006 Outline Randomized computation 1 Randomized computation 2 Computation with advice Non-uniform
More information1 Alphabets and Languages
1 Alphabets and Languages Look at handout 1 (inference rules for sets) and use the rules on some examples like {a} {{a}} {a} {a, b}, {a} {{a}}, {a} {{a}}, {a} {a, b}, a {{a}}, a {a, b}, a {{a}}, a {a,
More informationTheoretical Computer Science. A comparison of graph-theoretic DNA hybridization models
Theoretical Computer Science 429 (2012) 46 53 Contents lists available at SciVerse ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs A comparison of graph-theoretic
More informationUC Berkeley CS 170: Efficient Algorithms and Intractable Problems Handout 22 Lecturer: David Wagner April 24, Notes 22 for CS 170
UC Berkeley CS 170: Efficient Algorithms and Intractable Problems Handout 22 Lecturer: David Wagner April 24, 2003 Notes 22 for CS 170 1 NP-completeness of Circuit-SAT We will prove that the circuit satisfiability
More informationUsing DNA to Solve NP-Complete Problems. Richard J. Lipton y. Princeton University. Princeton, NJ 08540
Using DNA to Solve NP-Complete Problems Richard J. Lipton y Princeton University Princeton, NJ 08540 rjl@princeton.edu Abstract: We show how to use DNA experiments to solve the famous \SAT" problem of
More informationCSCI 1010 Models of Computa3on. Lecture 11 Proving Languages NP-Complete
CSCI 1010 Models of Computa3on Lecture 11 Proving Languages NP-Complete Overview P-3me reduc3ons Composi3on of P-3me reduc3ons Reduc3on from CIRCUIT SAT to SAT SAT is NP-complete. 3-SAT is NP-complete.
More informationStaged Self-Assembly and. Polyomino Context-Free Grammars
Staged Self-Assembly and Polyomino Context-Free Grammars A dissertation submitted by Andrew Winslow in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science
More informationThere have been some notable successes
B IOCOMPUTATION DNA LATTICES: A METHODFOR MOLECULAR-SCALE PATTERNING AND COMPUTATION DNA lattice research can provide unprecedented capabilities for molecular-scale computation and programmable pattern
More informationIntrinsic DNA Curvature of Double-Crossover Tiles
Intrinsic DNA Curvature of Double-Crossover Tiles Seungjae Kim, 1 Junghoon Kim, 1 Pengfei Qian, 2 Jihoon Shin, 3 Rashid Amin, 3 Sang Jung Ahn, 4 Thomas H. LaBean, 5 Moon Ki Kim, 2,3 * and Sung Ha Park,
More informationCS 320, Fall Dr. Geri Georg, Instructor 320 NP 1
NP CS 320, Fall 2017 Dr. Geri Georg, Instructor georg@colostate.edu 320 NP 1 NP Complete A class of problems where: No polynomial time algorithm has been discovered No proof that one doesn t exist 320
More informationThe self-assembly of paths and squares at temperature 1
The self-assembly of paths and squares at temperature Pierre-Etienne Meunier To cite this version: Pierre-Etienne Meunier. The self-assembly of paths and squares at temperature. 0. HAL Id: hal-00
More informationCSCI 2570 Introduction to Nanocomputing
CSCI 2570 Introduction to Nanocomputing The Emergence of Nanotechnology John E Savage Purpose of the Course The end of Moore s Law is in sight. Researchers are now exploring replacements for standard methods
More informationarxiv: v1 [cs.cc] 7 Jul 2009
Reducing Tile Complexity for the Self-ssembly of Scaled Shapes Through Temperature Programming Scott M. Summers arxiv:97.37v [cs.cc] 7 Jul 29 Iowa State University Department of Computer Science mes, I
More informationSelf-Assembly. Lecture 2 Lecture 2 Models of Self-Assembly
Self-Assembly Lecture 2 Lecture 2 Models of Self-Assembly Models of Self-Assembly The eaim: Solving the engineering ee g problems of self-assembly: forward, backward and the yield. understand the feasibility
More informationComplexity Theory. Knowledge Representation and Reasoning. November 2, 2005
Complexity Theory Knowledge Representation and Reasoning November 2, 2005 (Knowledge Representation and Reasoning) Complexity Theory November 2, 2005 1 / 22 Outline Motivation Reminder: Basic Notions Algorithms
More informationFurther discussion of Turing machines
Further discussion of Turing machines In this lecture we will discuss various aspects of decidable and Turing-recognizable languages that were not mentioned in previous lectures. In particular, we will
More informationComputers of the Future? Moore s Law Ending in 2018?
Computers of the Future? CS 221 Moore s Law Ending in 2018? Moore s Law: Processor speed / number transistors doubling approximately 18 months 1 Moore s Law Moore s Law Recent research predicts an end
More informationInterdisciplinary Nanoscience Center University of Aarhus, Denmark. Design and Imaging. Assistant Professor.
Interdisciplinary Nanoscience Center University of Aarhus, Denmark Design and Imaging DNA Nanostructures Assistant Professor Wael Mamdouh wael@inano.dk Molecular Self-assembly Synthesis, SPM microscopy,
More informationCS21 Decidability and Tractability
CS21 Decidability and Tractability Lecture 20 February 23, 2018 February 23, 2018 CS21 Lecture 20 1 Outline the complexity class NP NP-complete probelems: Subset Sum NP-complete problems: NAE-3-SAT, max
More informationNP-Completeness. NP-Completeness 1
NP-Completeness x x x 2 x 2 x 3 x 3 x 4 x 4 2 22 32 3 2 23 3 33 NP-Completeness Outline and Reading P and NP ( 3.) Definition of P Definition of NP Alternate definition of NP NP-completeness ( 3.2) Definition
More informationGenerating DNA Code Words Using Forbidding and Enforcing Systems
Generating DNA Code Words Using Forbidding and Enforcing Systems Daniela Genova 1 and Kalpana Mahalingam 2 1 Department of Mathematics and Statistics University of North Florida Jacksonville, FL 32224,
More informationThe Quest for Small Universal Cellular Automata Nicolas Ollinger LIP, ENS Lyon, France. 8 july 2002 / ICALP 2002 / Málaga, Spain
The Quest for Small Universal Cellular Automata Nicolas Ollinger LIP, ENS Lyon, France 8 july 2002 / ICALP 2002 / Málaga, Spain Cellular Automata Definition. A d-ca A is a 4-uple ( Z d, S, N, δ ) where:
More informationHarvard CS 121 and CSCI E-121 Lecture 22: The P vs. NP Question and NP-completeness
Harvard CS 121 and CSCI E-121 Lecture 22: The P vs. NP Question and NP-completeness Harry Lewis November 19, 2013 Reading: Sipser 7.4, 7.5. For culture : Computers and Intractability: A Guide to the Theory
More informationA Universal Turing Machine
A Universal Turing Machine A limitation of Turing Machines: Turing Machines are hardwired they execute only one program Real Computers are re-programmable Solution: Universal Turing Machine Attributes:
More informationA General Testability Theory: Classes, properties, complexity, and testing reductions
A General Testability Theory: Classes, properties, complexity, and testing reductions presenting joint work with Luis Llana and Pablo Rabanal Universidad Complutense de Madrid PROMETIDOS-CM WINTER SCHOOL
More informationUnit 1A: Computational Complexity
Unit 1A: Computational Complexity Course contents: Computational complexity NP-completeness Algorithmic Paradigms Readings Chapters 3, 4, and 5 Unit 1A 1 O: Upper Bounding Function Def: f(n)= O(g(n)) if
More informationarxiv: v1 [cs.cc] 12 Mar 2008
Self-Assembly of Discrete Self-Similar Fractals Matthew J. Patitz, and Scott M. Summers. arxiv:83.672v [cs.cc] 2 Mar 28 Abstract In this paper, we search for absolute limitations of the Tile Assembly Model
More information1 Introduction There is a long history of theoretical ideas in computer science that have led to major practical advances in experimental and applied
1 Introduction There is a long history of theoretical ideas in computer science that have led to major practical advances in experimental and applied computer science: for example, formal language and
More informationAutomata-based Verification - III
COMP30172: Advanced Algorithms Automata-based Verification - III Howard Barringer Room KB2.20: email: howard.barringer@manchester.ac.uk March 2009 Third Topic Infinite Word Automata Motivation Büchi Automata
More informationStrict Self-Assembly of Discrete Sierpinski Triangles
Electronic Colloquium on Computational Complexity, Report No. 35 (2008 Strict Self-Assembly of Discrete Sierpinski Triangles James I. Lathrop, Jack H. Lutz, and Scott M. Summers. Abstract Winfree (1998
More informationAn Interesting Perspective to the P versus NP Problem
An Interesting Perspective to the P versus NP Problem Wenming Zhang School of Economics and Management, Northwest University, Xi an, 710127, China wenming@nwu.edu.cn Abstract. We discuss the P versus NP
More informationCPSC 421: Tutorial #1
CPSC 421: Tutorial #1 October 14, 2016 Set Theory. 1. Let A be an arbitrary set, and let B = {x A : x / x}. That is, B contains all sets in A that do not contain themselves: For all y, ( ) y B if and only
More informationEssential facts about NP-completeness:
CMPSCI611: NP Completeness Lecture 17 Essential facts about NP-completeness: Any NP-complete problem can be solved by a simple, but exponentially slow algorithm. We don t have polynomial-time solutions
More informationDesign, Simulation, and Experimental Demonstration of Self-assembled DNA Nanostructures and Motors
Design, Simulation, and Experimental Demonstration of Self-assembled DNA Nanostructures and Motors John H. Reif, Thomas H. LaBean, Sudheer Sahu, Hao Yan, and Peng Yin Department of Computer Science, Duke
More informationFlip-N-Write: A Simple Deterministic Technique to Improve PRAM Write Performance, Energy and Endurance. Presenter: Brian Wongchaowart March 17, 2010
Flip-N-Write: A Simple Deterministic Technique to Improve PRAM Write Performance, Energy and Endurance Sangyeun Cho Hyunjin Lee Presenter: Brian Wongchaowart March 17, 2010 Motivation Suppose that you
More informationLecture 3: Error Correcting Codes
CS 880: Pseudorandomness and Derandomization 1/30/2013 Lecture 3: Error Correcting Codes Instructors: Holger Dell and Dieter van Melkebeek Scribe: Xi Wu In this lecture we review some background on error
More informationCOMPUTATIONAL COMPLEXITY
ATHEATICS: CONCEPTS, AND FOUNDATIONS Vol. III - Computational Complexity - Osamu Watanabe COPUTATIONAL COPLEXITY Osamu Watanabe Tokyo Institute of Technology, Tokyo, Japan Keywords: {deterministic, randomized,
More informationDNA-Scaffolded Self-Assembling Nano-Circuitry
DNA-Scaffolded Self-Assembling Nano-Circuitry An Ongoing Research Project with Dr. Soha Hassoun Presentation by Brandon Lucia and Laura Smith DNA-Scaffolded... DNA is special type of molecule Made of a
More informationComplexity, P and NP
Complexity, P and NP EECS 477 Lecture 21, 11/26/2002 Last week Lower bound arguments Information theoretic (12.2) Decision trees (sorting) Adversary arguments (12.3) Maximum of an array Graph connectivity
More informationNon-Deterministic Time
Non-Deterministic Time Master Informatique 2016 1 Non-Deterministic Time Complexity Classes Reminder on DTM vs NDTM [Turing 1936] (q 0, x 0 ) (q 1, x 1 ) Deterministic (q n, x n ) Non-Deterministic (q
More informationarxiv: v1 [cs.et] 19 Feb 2015
Computing Real Numbers using DNA Self-Assembly Shalin Shah, Parth Dave and Manish K Gupta Email :- {shah shalin, dave parth, mankg}@daiict.ac.in arxiv:1502.05552v1 [cs.et] 19 Feb 2015 Laboratory of Natural
More informationHow do scientists build something so small? Materials 1 pkg of modeling materials 1 piece of butcher paper 1 set of cards 1 set of markers
Using Modeling to Demonstrate Self-Assembly in Nanotechnology Imagine building a device that is small enough to fit on a contact lens. It has an antennae and a translucent screen across the pupil of the
More informationFriday Four Square! Today at 4:15PM, Outside Gates
P and NP Friday Four Square! Today at 4:15PM, Outside Gates Recap from Last Time Regular Languages DCFLs CFLs Efficiently Decidable Languages R Undecidable Languages Time Complexity A step of a Turing
More informationNanoparticles, nanorods, nanowires
Nanoparticles, nanorods, nanowires Nanoparticles, nanocrystals, nanospheres, quantum dots, etc. Drugs, proteins, etc. Nanorods, nanowires. Optical and electronic properties. Organization using biomolecules.
More informationAutonomous DNA Walking Devices
1 utonomous DN Walking Devices Peng Yin*, ndrew J. Turberfield, Hao Yan*, John H. Reif* * Department of Computer Science, Duke University Department of Physics, Clarendon Laboratory, University of Oxford
More informationNP-Completeness. Andreas Klappenecker. [based on slides by Prof. Welch]
NP-Completeness Andreas Klappenecker [based on slides by Prof. Welch] 1 Prelude: Informal Discussion (Incidentally, we will never get very formal in this course) 2 Polynomial Time Algorithms Most of the
More informationBandwidth: Communicate large complex & highly detailed 3D models through lowbandwidth connection (e.g. VRML over the Internet)
Compression Motivation Bandwidth: Communicate large complex & highly detailed 3D models through lowbandwidth connection (e.g. VRML over the Internet) Storage: Store large & complex 3D models (e.g. 3D scanner
More informationNP-Completeness. Subhash Suri. May 15, 2018
NP-Completeness Subhash Suri May 15, 2018 1 Computational Intractability The classical reference for this topic is the book Computers and Intractability: A guide to the theory of NP-Completeness by Michael
More informationOptimum Prefix Adders in a Comprehensive Area, Timing and Power Design Space
Optimum Prefix Adders in a Comprehensive Area, Timing and Power Design Space Jianhua Liu, Yi Zhu, Haikun Zhu, John Lillis 2, Chung-Kuan Cheng Department of Computer Science and Engineering University of
More informationConstant Weight Codes: An Approach Based on Knuth s Balancing Method
Constant Weight Codes: An Approach Based on Knuth s Balancing Method Vitaly Skachek 1, Coordinated Science Laboratory University of Illinois, Urbana-Champaign 1308 W. Main Street Urbana, IL 61801, USA
More informationThe P versus NP Problem. Ker-I Ko. Stony Brook, New York
The P versus NP Problem Ker-I Ko Stony Brook, New York ? P = NP One of the seven Millenium Problems The youngest one A folklore question? Has hundreds of equivalent forms Informal Definitions P : Computational
More informationExponential time vs probabilistic polynomial time
Exponential time vs probabilistic polynomial time Sylvain Perifel (LIAFA, Paris) Dagstuhl January 10, 2012 Introduction Probabilistic algorithms: can toss a coin polynomial time (worst case) probability
More informationParallelism and Time in Hierarchical Self-Assembly
Parallelism and Time in Hierarchical Self-Assembly Ho-Lin Chen David Doty Abstract We study the role that parallelism plays in time complexity of variants of Winfree s abstract Tile Assembly Model (atam),
More informationToward Modular Molecular Composite Nanosystems
Toward Modular Molecular Composite Nanosystems K. Eric Drexler, PhD U.C. Berkeley 26 April 2009 Intended take-away messages: Paths are now open toward complex, self-assembled, heterogenous nanosystems
More information5 3 Watson-Crick Automata with Several Runs
5 3 Watson-Crick Automata with Several Runs Peter Leupold Department of Mathematics, Faculty of Science Kyoto Sangyo University, Japan Joint work with Benedek Nagy (Debrecen) Presentation at NCMA 2009
More informationForeword. Grammatical inference. Examples of sequences. Sources. Example of problems expressed by sequences Switching the light
Foreword Vincent Claveau IRISA - CNRS Rennes, France In the course of the course supervised symbolic machine learning technique concept learning (i.e. 2 classes) INSA 4 Sources s of sequences Slides and
More informationTheory of Computation. Theory of Computation
Theory of Computation Theory of Computation What is possible to compute? We can prove that there are some problems computers cannot solve There are some problems computers can theoretically solve, but
More information6.080 / Great Ideas in Theoretical Computer Science Spring 2008
MIT OpenCourseWare http://ocw.mit.edu 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
More informationEquivalence of DFAs and NFAs
CS 172: Computability and Complexity Equivalence of DFAs and NFAs It s a tie! DFA NFA Sanjit A. Seshia EECS, UC Berkeley Acknowledgments: L.von Ahn, L. Blum, M. Blum What we ll do today Prove that DFAs
More informationCS151 Complexity Theory. Lecture 1 April 3, 2017
CS151 Complexity Theory Lecture 1 April 3, 2017 Complexity Theory Classify problems according to the computational resources required running time storage space parallelism randomness rounds of interaction,
More informationNP-Complete problems
NP-Complete problems NP-complete problems (NPC): A subset of NP. If any NP-complete problem can be solved in polynomial time, then every problem in NP has a polynomial time solution. NP-complete languages
More informationTwo Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. atam
Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. atam The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story
More informationCOMP Analysis of Algorithms & Data Structures
COMP 3170 - Analysis of Algorithms & Data Structures Shahin Kamali Computational Complexity CLRS 34.1-34.4 University of Manitoba COMP 3170 - Analysis of Algorithms & Data Structures 1 / 50 Polynomial
More informationLimits of Feasibility. Example. Complexity Relationships among Models. 1. Complexity Relationships among Models
Limits of Feasibility Wolfgang Schreiner Wolfgang.Schreiner@risc.jku.at Research Institute for Symbolic Computation (RISC) Johannes Kepler University, Linz, Austria http://www.risc.jku.at 1. Complexity
More informationarxiv: v3 [cs.fl] 2 Jul 2018
COMPLEXITY OF PREIMAGE PROBLEMS FOR DETERMINISTIC FINITE AUTOMATA MIKHAIL V. BERLINKOV arxiv:1704.08233v3 [cs.fl] 2 Jul 2018 Institute of Natural Sciences and Mathematics, Ural Federal University, Ekaterinburg,
More information