{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:26:14Z","timestamp":1725891974003},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642357213"},{"type":"electronic","value":"9783642357220"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35722-0_28","type":"book-chapter","created":{"date-parts":[[2013,1,4]],"date-time":"2013-01-04T06:16:29Z","timestamp":1357280189000},"page":"387-400","source":"Crossref","is-referenced-by-count":0,"title":["Conservatively Approximable Functions"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Wyman","sequence":"first","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Bauer, M., Zheng, X.: On the Weak Computability of Continuous Real Functions. In: CCA 2010, pp. 29\u201340 (2010)","key":"28_CR1","DOI":"10.4204\/EPTCS.24.8"},{"key":"28_CR2","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":"28_CR3","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., Yampolsky, M.: Non-computable Julia sets. J. Amer. Math. Soc.\u00a019, 551\u2013578 (2006)","journal-title":"J. Amer. Math. Soc."},{"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 (1993)","key":"28_CR4"},{"key":"28_CR5","doi-asserted-by":"crossref","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":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-13962-8_10","volume-title":"Programs, Proofs, Processes","author":"D. Cenzer","year":"2010","unstructured":"Cenzer, D., Dashti, A., Toska, F., Wyman, S.: Computability of Countable Subshifts. In: Ferreira, F., L\u00f6we, B., Mayordomo, E., Mendes Gomes, L. (eds.) CiE 2010. LNCS, vol.\u00a06158, pp. 88\u201397. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"Cenzer, D., Dashti, A., Toska, F., Wyman, S.: Computability of countablesub shifts in one dimension. Theory of Computing Systems (2012)","key":"28_CR7","DOI":"10.1007\/s00224-011-9358-z"},{"key":"28_CR8","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. e. separating classes. Arch. for Math. Logic\u00a045, 629\u2013647 (2008)","journal-title":"Arch. for Math. Logic"},{"doi-asserted-by":"crossref","unstructured":"Cenzer, D., Remmel, J.B.: \n                  \n                    \n                  \n                  $\\Pi^0_1$\n                 classes. In: Ersov, Y., Goncharov, S., Marek, V., Nerode, A., Remmel, J. (eds.) Handbook of Recursive Mathematics, Vol. 2: Recursive Algebra, Analysis and Combinatorics. Elsevier Studies in Logic and the Foundations of Mathematics, vol.\u00a0139, pp. 623\u2013821 (1998)","key":"28_CR9","DOI":"10.1016\/S0049-237X(98)80046-3"},{"unstructured":"Cenzer, D., Remmel, J.B.: Effectively Closed Sets, Perspectives in Mathematical Logic. Cambridge University Press (2013)","key":"28_CR10"},{"doi-asserted-by":"crossref","unstructured":"Delvenne, J.-C., Kurka, P., Blondel, V.: Decidability and Universality in Symbolic Dynamical Systems. Fund. Informaticae (2005)","key":"28_CR11","DOI":"10.1007\/978-3-540-31834-7_8"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s00222-008-0161-7","volume":"176","author":"M. Hochman","year":"2009","unstructured":"Hochman, M.: On the dynamics and recursive properties of multidimensional symbolic systems. Invent. Math.\u00a0176, 131\u2013167 (2009)","journal-title":"Invent. Math."},{"key":"28_CR13","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":"28_CR14","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"},{"unstructured":"Miller, J.: Two notes on subshifts. Proc. Amer. Math. Soc. (to appear)","key":"28_CR15"},{"key":"28_CR16","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. In: Goemans, M.X. (ed.) Proc. 35th ACM Symposium on Theory of Computing, San Diego, pp. 177\u2013185. ACM Press, New York (2003)"},{"key":"28_CR17","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"},{"doi-asserted-by":"crossref","unstructured":"Simpson, S.G.: Subsystems of Second Order Arithmetic, 2nd edn. Cambridge U. Press (2009)","key":"28_CR18","DOI":"10.1017\/CBO9780511581007"},{"unstructured":"Simpson, S.G.: Medvedev degrees of two-dimensional subshifts of finite type. Ergodic Theory and Dynamical Systems (to appear)","key":"28_CR19"},{"doi-asserted-by":"crossref","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 (1996) ISBN 0-521-55736-4","key":"28_CR20","DOI":"10.1017\/CBO9780511629167.015"},{"doi-asserted-by":"crossref","unstructured":"Weihrauch, K.: Computable Analysis. Springer (2000)","key":"28_CR21","DOI":"10.1007\/978-3-642-56999-9"},{"key":"28_CR22","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0304-3975(98)00045-0","volume":"234","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K., Zheng, X.: Computability on continuous, lower semi-continuous and upper semi-continuous real functions. Theoretical Computer Science\u00a0234, 109\u2013133 (2000)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35722-0_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T09:24:29Z","timestamp":1620120269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35722-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642357213","9783642357220"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35722-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}