{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T22:26:03Z","timestamp":1770071163877,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055446","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T20:27:45Z","timestamp":1497558465000},"page":"328-341","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation"],"prefix":"10.1145","author":[{"given":"Pierre-\u00c9tienne","family":"Meunier","sequence":"first","affiliation":[{"name":"Inria, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damien","family":"Woods","sequence":"additional","affiliation":[{"name":"Inria, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"11","volume-title":"DNA18: Proc. of International Meeting on DNA Computing and Molecular Programming","volume":"7433","author":"Behsaz B."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2009.10.001"},{"key":"e_1_3_2_1_3_1","first-page":"184","volume-title":"STACS: Proceedings of the Thirtieth International Symposium on Theoretical Aspects of Computer Science","author":"Cannon Sarah"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9620-z"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133081"},{"key":"e_1_3_2_1_6_1","series-title":"LNCS","first-page":"379","volume-title":"ICALP: Proceedings of the 41st International Colloquium on Automata, Languages, and Programming","author":"Demaine Erik D."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39206-1_34"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.76"},{"key":"e_1_3_2_1_9_1","first-page":"286","volume-title":"STACS: Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science","author":"Doty David","year":"2009"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.08.023"},{"key":"e_1_3_2_1_11_1","unstructured":"Arxiv preprint: arXiv:0906.3251.  Arxiv preprint: arXiv:0906.3251."},{"key":"e_1_3_2_1_12_1","first-page":"167","volume-title":"SODA: ACM-SIAM Symposium on Discrete Algorithms","author":"Fekete S\u00e1ndor P."},{"key":"e_1_3_2_1_13_1","volume-title":"Cornell University Press","author":"Flory Paul J.","year":"1953"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31594-7_60"},{"key":"e_1_3_2_1_15_1","first-page":"956","volume-title":"SODA: ACM-SIAM Symposium on Discrete Algorithms","author":"Gilbert Oscar"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08783-2_19"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054114500087"},{"key":"e_1_3_2_1_18_1","unstructured":"D. E. Knuth. Mathematics and computer science: coping with finiteness. Mathematics: people problems results 2 1984.  D. E. Knuth. Mathematics and computer science: coping with finiteness. Mathematics: people problems results 2 1984."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2009.0067"},{"key":"e_1_3_2_1_20_1","series-title":"LNCS","first-page":"276","volume-title":"UCNC: Unconventional Computation and Natural Computation","author":"Meunier Pierre-\u00c9tienne"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634130"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Pierre-\u00c9tienne Meunier and Damien Woods. The non-cooperative tile assembly model is not intrinsically universal or capable of bounded turing machine simulation. 2017. Arxiv preprint: arXiv:1702.00353.  Pierre-\u00c9tienne Meunier and Damien Woods. The non-cooperative tile assembly model is not intrinsically universal or capable of bounded turing machine simulation. 2017. Arxiv preprint: arXiv:1702.00353.","DOI":"10.1145\/3055399.3055446"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054114400061"},{"key":"e_1_3_2_1_24_1","first-page":"189","volume-title":"DNA 17: Proceedings of the 17th International Conference on DNA Computing and Molecular Programming, LNCS","author":"Patitz Matthew J."},{"key":"e_1_3_2_1_25_1","volume-title":"University of Southern California","author":"Rothemund Paul W. K.","year":"2001"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335358"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704446712"},{"key":"e_1_3_2_1_28_1","volume-title":"California Institute of Technology","author":"Winfree Erik","year":"1998"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Damien Woods. Intrinsic universality and the computational power of self-assembly. Philosophical Transactions of the Royal Society A: Mathematical Physical and Engineering Sciences 373(2046) 2015.  Damien Woods. Intrinsic universality and the computational power of self-assembly. Philosophical Transactions of the Royal Society A: Mathematical Physical and Engineering Sciences 373(2046) 2015.","DOI":"10.1098\/rsta.2014.0214"},{"key":"e_1_3_2_1_31_1","unstructured":"dx.  dx."}],"event":{"name":"STOC '17: Symposium on Theory of Computing","location":"Montreal Canada","acronym":"STOC '17","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055446","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055446","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:27Z","timestamp":1750220607000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055446"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":30,"alternative-id":["10.1145\/3055399.3055446","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055446","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}