{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:52:42Z","timestamp":1725558762702},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642139611"},{"type":"electronic","value":"9783642139628"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13962-8_10","type":"book-chapter","created":{"date-parts":[[2010,6,26]],"date-time":"2010-06-26T12:33:57Z","timestamp":1277555637000},"page":"88-97","source":"Crossref","is-referenced-by-count":4,"title":["Computability of Countable Subshifts"],"prefix":"10.1007","author":[{"given":"Douglas","family":"Cenzer","sequence":"first","affiliation":[]},{"given":"Ali","family":"Dashti","sequence":"additional","affiliation":[]},{"given":"Ferit","family":"Toska","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Wyman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/S0304-3975(96)00086-2","volume":"168","author":"O. Bournez","year":"1996","unstructured":"Bournez, O., Cosnard, M.: On the computational power of dynamical systems and hybrid systems. Theoretical Computer Science\u00a0168, 417\u2013459 (1996)","journal-title":"Theoretical Computer Science"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1090\/S0894-0347-05-00516-3","volume":"19","author":"M. Braverman","year":"2006","unstructured":"Braverman, M., Yampolski, M.: Non-computable Julia sets. J. Amer. Math. Soc.\u00a019, 551\u2013578 (2006)","journal-title":"J. Amer. Math. Soc."},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/978-1-4612-0325-4_5","volume-title":"Logical Methods in honor of Anil Nerode\u2019s Sixtieth Birthday","author":"D. Cenzer","year":"1993","unstructured":"Cenzer, D.: Effective dynamics. In: Crossley, J., Remmel, J., Shore, R., Sweedler, M. (eds.) Logical Methods in honor of Anil Nerode\u2019s Sixtieth Birthday, pp. 162\u2013177. Birkhauser, Basel (1993)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1002\/malq.200710066","volume":"54","author":"D. Cenzer","year":"2008","unstructured":"Cenzer, D., Dashti, A., King, J.L.F.: Computable Symbolic Dynamics. Math. Logic Quarterly\u00a054, 524\u2013533 (2008)","journal-title":"Math. Logic Quarterly"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s00153-007-0058-y","volume":"45","author":"D. Cenzer","year":"2008","unstructured":"Cenzer, D., Hinman, P.G.: Degrees of difficulty of generalized r.\u00a0e. separating classes. Arch. for Math. Logic\u00a045, 629\u2013647 (2008)","journal-title":"Arch. for Math. Logic"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Cenzer, D., Remmel, J.B.: $\\Pi^0_1$ classes, in Handbook of Recursive Mathematics, Vol. 2: Recursive Algebra, Analysis and Combinatorics. In: Ersov, Y., Goncharov, S., Marek, V., Nerode, A., Remmel, J. (eds.). Elsevier Studies in Logic and the Foundations of Mathematics, vol.\u00a0139, pp. 623\u2013821 (1998)","DOI":"10.1016\/S0049-237X(98)80046-3"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Delvenne, J.-C., Kurka, P., Blondel, V.D.: Decidability and Universality in Symbolic Dynamical Systems. Fund. Informaticae (2005)","DOI":"10.1007\/978-3-540-31834-7_8"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0168-0072(97)00060-2","volume":"93","author":"K. Ko","year":"1998","unstructured":"Ko, K.: On the computability of fractal dimensions and Julia sets. Ann. Pure Appl. Logic\u00a093, 195\u2013216 (1998)","journal-title":"Ann. Pure Appl. Logic"},{"key":"10_CR9","first-page":"501","volume":"104","author":"Y. Medvedev","year":"1955","unstructured":"Medvedev, Y.: Degrees of difficulty of the mass problem. Dokl. Akad. Nauk SSSR\u00a0104, 501\u2013504 (1955)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10_CR10","unstructured":"Miller, J.: Two notes on subshifts (preprint)"},{"key":"10_CR11","first-page":"177","volume-title":"Proc. 35th ACM Symposium on Theory of Computing","author":"R. Rettinger","year":"2003","unstructured":"Rettinger, R., Weihrauch, K.: The computational complexity of some Julia sets. In: Goemans, M.X. (ed.) Proc. 35th ACM Symposium on Theory of Computing, San Diego, June 2003, pp. 177\u2013185. ACM Press, New York (2003)"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2178\/bsl\/1107959497","volume":"11","author":"S.G. Simpson","year":"2005","unstructured":"Simpson, S.G.: Mass problems and randomness. Bull. Symbolic Logic\u00a011, 1\u201327 (2005)","journal-title":"Bull. Symbolic Logic"},{"key":"10_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511581007","volume-title":"Subsystems of Second Order Arithmetic","author":"S.G. Simpson","year":"2009","unstructured":"Simpson, S.G.: Subsystems of Second Order Arithmetic, 2nd edn. Cambridge U. Press, Cambridge (2009)","edition":"2"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Simpson, S.G.: Medvedev degrees of two-dimensional subshifts of finite type. Ergodic Theory and Dynamical Systems (to appear)","DOI":"10.1017\/etds.2012.152"},{"key":"10_CR15","series-title":"London Mathematical Society Lecture Notes","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1017\/CBO9780511629167.015","volume-title":"Computability, Enumerability, Unsolvability: Directions in Recursion Theory","author":"A. Sorbi","year":"1996","unstructured":"Sorbi, A.: The Medvedev lattice of degrees of difficulty. In: Cooper, S.B., et al. (eds.) Computability, Enumerability, Unsolvability: Directions in Recursion Theory. London Mathematical Society Lecture Notes, vol.\u00a0224, pp. 289\u2013312. Cambridge University Press, Cambridge (1996)"},{"key":"10_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Programs, Proofs, Processes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13962-8_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:45:56Z","timestamp":1606185956000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13962-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642139611","9783642139628"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13962-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}