乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T17:23:51Z","timestamp":1725902631174},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662553855"},{"type":"electronic","value":"9783662553862"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-55386-2_1","type":"book-chapter","created":{"date-parts":[[2017,6,28]],"date-time":"2017-06-28T11:24:53Z","timestamp":1498649093000},"page":"1-13","source":"Crossref","is-referenced-by-count":5,"title":["Graph Turing Machines"],"prefix":"10.1007","author":[{"given":"Nathanael L.","family":"Ackerman","sequence":"first","affiliation":[]},{"given":"Cameron E.","family":"Freer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,29]]},"reference":[{"issue":"4","key":"1_CR1","first-page":"1803","volume":"9","author":"JA Aledo","year":"2015","unstructured":"Aledo, J.A., Martinez, S., Valverde, J.C.: Graph dynamical systems with general Boolean states. Appl. Math. Inf. Sci. 9(4), 1803\u20131808 (2015)","journal-title":"Appl. Math. Inf. Sci."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Aledo, J.A., Martinez, S., Valverde, J.C.: Parallel dynamical systems over graphs and related topics: a survey. J. Appl. Math. (2015). Article no. 594294","DOI":"10.1155\/2015\/594294"},{"key":"1_CR3","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.ic.2013.11.004","volume":"234","author":"D Angluin","year":"2014","unstructured":"Angluin, D., Aspnes, J., Bazzi, R.A., Chen, J., Eisenstat, D., Konjevod, G.: Effective storage capacity of labeled graphs. Inform. Comput. 234, 44\u201356 (2014)","journal-title":"Inform. Comput."},{"key":"1_CR4","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.tcs.2016.11.033","volume":"661","author":"N Aubrun","year":"2017","unstructured":"Aubrun, N., Barbieri, S., Sablik, M.: A notion of effectiveness for subshifts on finitely generated groups. Theor. Comput. Sci. 661, 35\u201355 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"1_CR5","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1017\/S1079898600004200","volume":"10","author":"J Baldwin","year":"2004","unstructured":"Baldwin, J.: Review of A New Kind of Science by Stephen Wolfram. Bull. Symb. Logic 10(1), 112\u2013114 (2004)","journal-title":"Bull. Symb. Logic"},{"issue":"6","key":"1_CR6","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/j.matcom.2004.03.003","volume":"66","author":"CL Barrett","year":"2004","unstructured":"Barrett, C.L., Chen, W.Y.C., Zheng, M.J.: Discrete dynamical systems on graphs and Boolean functions. Math. Comput. Simul. 66(6), 487\u2013497 (2004)","journal-title":"Math. Comput. Simul."},{"issue":"4","key":"1_CR7","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1145\/937555.937561","volume":"4","author":"A Blass","year":"2003","unstructured":"Blass, A., Gurevich, Y.: Abstract state machines capture parallel algorithms. ACM Trans. Comput. Log. 4(4), 578\u2013651 (2003)","journal-title":"ACM Trans. Comput. Log."},{"key":"1_CR8","volume-title":"Review of A New Kind of Science by Stephen Wolfram","author":"H Cohn","year":"2002","unstructured":"Cohn, H.: Review of A New Kind of Science by Stephen Wolfram. MAA Reviews, Washington D.C. (2002)"},{"issue":"1","key":"1_CR9","first-page":"1","volume":"15","author":"M Cook","year":"2004","unstructured":"Cook, M.: Universality in elementary cellular automata. Complex Syst. 15(1), 1\u201340 (2004)","journal-title":"Complex Syst."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Gurevich, Y.: Kolmogorov machines and related issues. In: Current Trends in Theoretical Computer Science. World Scientific Series in Computer Science, vol. 40, pp. 225\u2013234. World Scientific (1993)","DOI":"10.1142\/9789812794499_0017"},{"issue":"1","key":"1_CR11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/343369.343384","volume":"1","author":"Y Gurevich","year":"2000","unstructured":"Gurevich, Y.: Sequential abstract-state machines capture sequential algorithms. ACM Trans. Comput. Log. 1(1), 77\u2013111 (2000)","journal-title":"ACM Trans. Comput. Log."},{"key":"1_CR12","volume-title":"The Art of Computer Programming: Volume 1: Fundamental Algorithms","author":"DE Knuth","year":"1968","unstructured":"Knuth, D.E.: The Art of Computer Programming: Volume 1: Fundamental Algorithms. Addison-Wesley, Boston (1968)"},{"issue":"4","key":"1_CR13","first-page":"3","volume":"13","author":"AN Kolmogorov","year":"1958","unstructured":"Kolmogorov, A.N., Uspensky, V.A.: On the definition of an algorithm. Uspekhi Mat. Nauk 13(4), 3\u201328 (1958)","journal-title":"Uspekhi Mat. Nauk"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: Very large graphs. In: Current Developments in Mathematics, vol. 2008, pp. 67\u2013128. International Press, Somerville (2009)","DOI":"10.4310\/CDM.2008.v2008.n1.a2"},{"issue":"3","key":"1_CR15","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1137\/0209036","volume":"9","author":"A Sch\u00f6nhage","year":"1980","unstructured":"Sch\u00f6nhage, A.: Storage modification machines. SIAM J. Comput. 9(3), 490\u2013508 (1980)","journal-title":"SIAM J. Comput."},{"key":"1_CR16","series-title":"Perspectives in Mathematical Logic","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees","author":"RI Soare","year":"1987","unstructured":"Soare, R.I.: Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic. Springer, Berlin (1987)"},{"issue":"2","key":"1_CR17","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0304-3975(02)00661-8","volume":"296","author":"K Sutner","year":"2003","unstructured":"Sutner, K.: Cellular automata and intermediate degrees. Theoret. Comput. Sci. 296(2), 365\u2013375 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR18","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1763.001.0001","volume-title":"Cellular Automata Machines: A New Environment for Modeling","author":"T Toffoli","year":"1987","unstructured":"Toffoli, T., Margolus, N.: Cellular Automata Machines: A New Environment for Modeling. MIT Press, Cambridge (1987)"},{"issue":"4\u20135","key":"1_CR19","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/j.tcs.2008.09.051","volume":"410","author":"D Woods","year":"2009","unstructured":"Woods, D., Neary, T.: The complexity of small universal Turing machines: a survey. Theoret. Comput. Sci. 410(4\u20135), 443\u2013450 (2009)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-55386-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T09:13:55Z","timestamp":1569575635000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-55386-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662553855","9783662553862"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-55386-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}