{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:19Z","timestamp":1725488959515},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_64","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"726-737","source":"Crossref","is-referenced-by-count":0,"title":["Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Meer","sequence":"first","affiliation":[]},{"given":"Martin","family":"Ziegler","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"64_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0701-6","volume-title":"Complexity and Real Computation","author":"L. Blum","year":"1998","unstructured":"Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, Heidelberg (1998)"},{"key":"64_CR2","doi-asserted-by":"crossref","unstructured":"Blum, L., Shub, M., Smale, S.: On a Theory of Computation and Complexity over the Real Numbers: \n                    \n                      \n                    \n                    $\\mathcal{NP}$\n                  -Completeness, Recursive Functions, and Universal Machines. Bulletin of the American Mathematical Society (AMS Bulletin), vol.\u00a021, pp. 1\u201346 (1989)","DOI":"10.1090\/S0273-0979-1989-15750-9"},{"key":"64_CR3","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1073\/pnas.44.10.1061","volume":"44","author":"W.W. Boone","year":"1958","unstructured":"Boone, W.W.: The word problem. Proc. Nat. Acad. Sci.\u00a044, 265\u2013269 (1958)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"4","key":"64_CR4","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/1521-3870(200111)47:4<493::AID-MALQ493>3.0.CO;2-S","volume":"47","author":"M. Bourgade","year":"2001","unstructured":"Bourgade, M.: S\u00e9parations et transferts dans la hi\u00e9rarchie polynomiale des groupes ab\u00e9liens infinis. Mathematical Logic Quarterly\u00a047 (4), 493\u2013502 (2001)","journal-title":"Mathematical Logic Quarterly"},{"key":"64_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0166-8641(99)00103-0","volume":"106","author":"J.W. Cannon","year":"2000","unstructured":"Cannon, J.W., Conner, G.R.: The combinatorial structure of the Hawaiian earring group. Topology and its Applications\u00a0106, 225\u2013271 (2000)","journal-title":"Topology and its Applications"},{"issue":"3","key":"64_CR6","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1093\/logcom\/2.3.375","volume":"2","author":"F. Cucker","year":"1992","unstructured":"Cucker, F.: The arithmetical hierarchy over the reals. Journal of Logic and Computation\u00a02(3), 375\u2013395 (1992)","journal-title":"Journal of Logic and Computation"},{"key":"64_CR7","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.jsc.2004.11.008","volume":"39","author":"H. Derksen","year":"2005","unstructured":"Derksen, H., Jeandel, E., Koiran, P.: Quantum automata and algebraic groups. J. Symbolic Computation\u00a039, 357\u2013371 (2005)","journal-title":"J. Symbolic Computation"},{"key":"64_CR8","series-title":"The DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS","volume-title":"Groups and Computation","author":"L. Finkelstein","year":"1991","unstructured":"Finkelstein, L., Kantor, W.M.: Groups and Computation. The DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, vol.\u00a011. AMS, Providence, RI (1991)"},{"key":"64_CR9","series-title":"The DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS","volume-title":"Groups and Computation II","author":"L. Finkelstein","year":"1995","unstructured":"Finkelstein, L., Kantor, W.M. (eds.): Groups and Computation II. The DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, vol.\u00a028. AMS, Providence, RI (1995)"},{"key":"64_CR10","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1006\/jcom.2001.0583","volume":"17","author":"C. Gassner","year":"2001","unstructured":"Gassner, C.: The \n                    \n                      \n                    \n                    $\\mathcal{P}=\\mathcal{DNP}$\n                   problem for infinite abelian groups. Journal of Complexity\u00a017, 574\u2013583 (2001)","journal-title":"Journal of Complexity"},{"key":"64_CR11","doi-asserted-by":"crossref","unstructured":"Holt, D.F., Eick, B., O\u2019Brien, E.: Handbook of Computational Group Theory. Chapman&Hall\/CRC (2005)","DOI":"10.1201\/9781420035216"},{"key":"64_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1007\/978-3-540-30140-0_62","volume-title":"Algorithms \u2013 ESA 2004","author":"L. Kettner","year":"2004","unstructured":"Kettner, L., Mehlhorn, K., Pion, S., Schirra, S., Yap, C.K.: Classroom Examples of Robustness Problems in Geometric Computations. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 702\u2013713. Springer, Heidelberg (2004)"},{"key":"64_CR13","volume-title":"Combinatorial Group Theory","author":"R.C. Lyndon","year":"1977","unstructured":"Lyndon, R.C., Schupp, P.E.: Combinatorial Group Theory. Springer, Heidelberg (1977)"},{"issue":"2","key":"64_CR14","first-page":"354","volume":"11","author":"Y. Matiyasevich","year":"1970","unstructured":"Matiyasevich, Y.: Enumerable sets are Diophantine. Soviet Mathematics. Doklady\u00a011(2), 354\u2013358 (1970)","journal-title":"Soviet Mathematics. Doklady"},{"key":"64_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/11537311_41","volume-title":"Fundamentals of Computation Theory","author":"K. Meer","year":"2005","unstructured":"Meer, K., Ziegler, M.: An Explicit Solution to Post\u2019s Problem over the Reals. In: Li\u015bkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol.\u00a03623, pp. 456\u2013467. Springer, Heidelberg (2005) full version to appear in the journal of complexity, see also arXiv:cs.LO\/0603071"},{"key":"64_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/11780342_39","volume-title":"Logical Approaches to Computational Barriers","author":"K. Meer","year":"2006","unstructured":"Meer, K., Ziegler, M.: Uncomputability Below the Real Halting Problem. In: Beckmann, A., Berger, U., L\u00f6we, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol.\u00a03988, pp. 368\u2013377. Springer, Heidelberg (2006)"},{"key":"64_CR17","first-page":"1","volume":"44","author":"P.S. Novikov","year":"1959","unstructured":"Novikov, P.S.: On the algorithmic unsolvability of the word problem in group theory. Trudy Mat. Inst. Steklov\u00a044, 1\u2013143 (1959)","journal-title":"Trudy Mat. Inst. Steklov"},{"key":"64_CR18","doi-asserted-by":"publisher","first-page":"235","DOI":"10.2178\/jsl\/1190150041","volume":"67","author":"M. Prunescu","year":"2002","unstructured":"Prunescu, M.: A model-theoretic proof for \n                    \n                      \n                    \n                    $\\mathcal{P} \\neq \\mathcal{NP}$\n                   over all infinite abelian groups. The Journal of Symbolic Logic\u00a067, 235\u2013238 (2002)","journal-title":"The Journal of Symbolic Logic"},{"key":"64_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4176-8","volume-title":"An Introduction to the Theory of Groups 4th Edition","author":"J.J. Rotman","year":"1995","unstructured":"Rotman, J.J.: An Introduction to the Theory of Groups 4th Edition. Springer, Heidelberg (1995)"},{"key":"64_CR20","doi-asserted-by":"publisher","first-page":"103","DOI":"10.2307\/2273358","volume":"45","author":"J.V. Tucker","year":"1980","unstructured":"Tucker, J.V.: Computability and the algebra of fields. J. Symbolic Logic\u00a045, 103\u2013120 (1980)","journal-title":"J. Symbolic Logic"},{"issue":"2","key":"64_CR21","first-page":"230","volume":"42","author":"A.M. Turing","year":"1936","unstructured":"Turing, A.M.: On Computable Numbers, with an Application to the Entscheidungsproblem. Proc. London Math. Soc.\u00a042(2), 230\u2013265 (1936)","journal-title":"Proc. London Math. Soc."},{"key":"64_CR22","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","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_64.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:29:37Z","timestamp":1619519377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}