[
{
"id": "authors:4mhkx-r2152",
"collection": "authors",
"collection_id": "4mhkx-r2152",
"cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:20130529-100843467",
"type": "book_section",
"title": "The tile assembly model is intrinsically universal",
"book_title": "IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS)",
"author": [
{
"family_name": "Doty",
"given_name": "David",
"orcid": "0000-0002-3922-172X",
"clpid": "Doty-D"
},
{
"family_name": "Lutz",
"given_name": "Jack H.",
"clpid": "Lutz-J-H"
},
{
"family_name": "Patitz",
"given_name": "Matthew J.",
"clpid": "Patitz-M-J"
},
{
"family_name": "Schweller",
"given_name": "Robert T.",
"clpid": "Schweller-R-T"
},
{
"family_name": "Summers",
"given_name": "Scott M.",
"clpid": "Summers-S-M"
},
{
"family_name": "Woods",
"given_name": "Damien",
"clpid": "Woods-Damien"
}
],
"abstract": "We prove that the abstract Tile Assembly Model (aTAM) of nanoscale self-assembly is intrinsically universal. This means that there is a single tile assembly system U that, with proper initialization, simulates any tile assembly system T. The simulation is \"intrinsic\" in the sense that the self-assembly process carried out by U is exactly that carried out by T, with each tile of T represented by an m \u00d7 m \"super tile\" of U. Our construction works for the full aTAM at any temperature, and it faithfully simulates the deterministic or nondeterministic behavior of each T. Our construction succeeds by solving an analog of the cell differentiation problem in developmental biology: Each super tile of U, starting with those in the seed assembly, carries the \"genome\" of the simulated system T. At each location of a potential super tile in the self-assembly of U, a decision is made whether and how to express this genome, i.e., whether to generate a super tile and, if so, which tile of T it will represent. This decision must be achieved using asynchronous communication under incomplete information, but it achieves the correct global outcome(s).",
"doi": "10.1109/FOCS.2012.76",
"isbn": "978-1-4673-4383-1",
"publisher": "IEEE",
"place_of_publication": "Piscataway, NJ",
"publication_date": "2012-10",
"pages": "302-310"
},
{
"id": "authors:qny92-v6h14",
"collection": "authors",
"collection_id": "qny92-v6h14",
"cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:1987.5243-tr-87",
"type": "monograph",
"title": "Resource-Bounded Category and Measure in Exponential Complexity Classes",
"author": [
{
"family_name": "Lutz",
"given_name": "Jack H.",
"clpid": "Lutz-J-H"
}
],
"abstract": "This thesis presents resource-bounded category and resource-\nbounded measure - two new tools for computational complexity theory - and some applications of these tools to the structure theory of exponential complexity classes.\nResource-bounded category, a complexity-theoretic version of the classical Baire category method, identifies certain subsets of PSPACE, E, ESPACE, and other complexity classes as meager. These meager sets are shown to form a nontrivial ideal of \"small\" subsets of the complexity class.\nThe meager sets are also (almost) characterized in terms of curtain two-person\ninfinite games called resource-bounded Banach-Maxur games.\nSimilarly, resource-bounded measure, a complexity-theoretic version of\nLebesgue measure theory, identifies the measure 0 subsets of E, ESPACE,\nand other complexity classes, and these too are shown to form nontrivial\nideals of \"small\" subsets. A resource-bounded extension of the classical\nKolmogorov zero-one law is also proven. This shows that measurable sets of\ncomplexity-theoretic interest either have measure 0 or are the complements of\nsets of measure 0.\nResource-bounded category and measure are then applied to the\ninvestigation of uniform versus nonuniform complexity. In particular,\nKannan's theorem that ESPACE P/Poly is extended by showing that P/Poly\nfl ESPACE is only a meager, measure 0 subset of ESPACE. A theorem of\nHuynh is extended similarly by showing that all but a meager, measure 0\nsubset of the languages i n ESPACE have high space-bounded Kolmogorov\ncomplexity.",
"doi": "10.7907/qny92-v6h14",
"publisher": "California Institute of Technology",
"publication_date": "1987-01-01"
}
]