{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T11:46:14Z","timestamp":1773143174341,"version":"3.50.1"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319587400","type":"print"},{"value":"9783319587417","type":"electronic"}],"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"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-58741-7_8","type":"book-chapter","created":{"date-parts":[[2017,5,11]],"date-time":"2017-05-11T16:59:28Z","timestamp":1494521968000},"page":"77-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Eliminating Unbounded Search in Computable Algebra"],"prefix":"10.1007","author":[{"given":"Alexander G.","family":"Melnikov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,12]]},"reference":[{"key":"8_CR1","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Computable Structures and the Hyperarithmetical Hierarchy","author":"C Ash","year":"2000","unstructured":"Ash, C., Knight, J.: Computable Structures and the Hyperarithmetical Hierarchy. Studies in Logic and the Foundations of Mathematics, vol. 144. North-Holland Publishing Co., Amsterdam (2000)"},{"issue":"1","key":"8_CR2","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/s10469-016-9377-6","volume":"55","author":"PE Alaev","year":"2016","unstructured":"Alaev, P.E.: Existence and uniqueness of structures computable in polynomial time. Algebra Log. 55(1), 72\u201376 (2016)","journal-title":"Algebra Log."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.2307\/1970103","volume":"70","author":"W Boone","year":"1959","unstructured":"Boone, W.: The word problem. Ann. Math 70, 207\u2013265 (1959)","journal-title":"Ann. Math"},{"issue":"8","key":"8_CR4","doi-asserted-by":"publisher","first-page":"1463","DOI":"10.1142\/S0218196711006625","volume":"21","author":"G Braun","year":"2011","unstructured":"Braun, G., Str\u00fcngmann, L.: Breaking up finite automata presentable torsion-free abelian groups. Internat. J. Algebra Comput. 21(8), 1463\u20131472 (2011)","journal-title":"Internat. J. Algebra Comput."},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00153-008-0113-3","volume":"48","author":"D Cenzer","year":"2009","unstructured":"Cenzer, D., Downey, R.G., Remmel, J.B., Uddin, Z.: Space complexity of abelian groups. Arch. Math. Log. 48(1), 115\u2013140 (2009)","journal-title":"Arch. Math. Log."},{"key":"8_CR6","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1515\/9783110807486.15","volume-title":"Recursion Theory and Complexity, Proceedings 1997 Kazan Workshop","author":"D Cenzer","year":"1999","unstructured":"Cenzer, D., Remmel, J.B.: Polynomial time versus computable boolean algebras. In: Arslanov, M., Lempp, S. (eds.) Recursion Theory and Complexity, Proceedings 1997 Kazan Workshop, pp. 15\u201353. de Gruyter, Berlin (1999)"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0168-0072(91)90008-A","volume":"54","author":"DA Cenzer","year":"1991","unstructured":"Cenzer, D.A., Remmel, J.B.: Polynomial-time versus recursive models. Ann. Pure Appl. Logic 54(1), 17\u201358 (1991)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1\u20133","key":"8_CR8","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0168-0072(92)90076-C","volume":"56","author":"DA Cenzer","year":"1992","unstructured":"Cenzer, D.A., Remmel, J.B.: Polynomial-time abelian groups. Ann. Pure Appl. Logic 56(1\u20133), 313\u2013363 (1992)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"24","key":"8_CR9","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00968734","volume":"793","author":"V Dobritsa","year":"1983","unstructured":"Dobritsa, V.: Some constructivizations of abelian groups. Siberian J. Math. 793(24), 167\u2013173 (1983). (in Russian)","journal-title":"Siberian J. Math."},{"key":"8_CR10","doi-asserted-by":"crossref","DOI":"10.1201\/9781439865699","volume-title":"Word Processing in Groups","author":"DBA Epstein","year":"1992","unstructured":"Epstein, D.B.A., Cannon, J.W., Holt, D.F., Levy, S.V.F., Paterson, M.S., Thurston, W.P.: Word Processing in Groups. Jones and Bartlett Publishers, Boston (1992)"},{"key":"8_CR11","series-title":"Siberian School of Algebra and Logic","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4305-3","volume-title":"Constructive Models","author":"Y Ershov","year":"2000","unstructured":"Ershov, Y., Goncharov, S.: Constructive Models. Siberian School of Algebra and Logic. Consultants Bureau, New York (2000)"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Goncharov, S.: The problem of the number of non auto equivalent construc tivizations. Algebra i Logika 19(6), 621\u2013639, 745 (1980)","DOI":"10.1007\/BF01669323"},{"key":"8_CR13","series-title":"Siberian School of Algebra and Logic","volume-title":"Countable Boolean Algebras and Decidability","author":"S Goncharov","year":"1997","unstructured":"Goncharov, S.: Countable Boolean Algebras and Decidability. Siberian School of Algebra and Logic. Consultants Bureau, New York (1997)"},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"260","DOI":"10.2307\/2274966","volume":"55","author":"S Grigorieff","year":"1990","unstructured":"Grigorieff, S.: Every recursive linear ordering has a copy in dtime-space(n, log(n)). J. Symb. Log. 55(1), 260\u2013276 (1990)","journal-title":"J. Symb. Log."},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1098\/rspa.1961.0132","volume":"262","author":"G Higman","year":"1961","unstructured":"Higman, G.: Subgroups of finitely presented groups. Proc. Roy. Soc. Ser. A 262, 455\u2013475 (1961)","journal-title":"Proc. Roy. Soc. Ser. A"},{"issue":"4","key":"8_CR16","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.2178\/jsl\/1067620182","volume":"68","author":"DR Hirschfeldt","year":"2003","unstructured":"Hirschfeldt, D.R., Khoussainov, B., Shore, R.A.: A computably categorical structure whose expansion by a constant has infinite computable dimension. J. Symbolic Log. 68(4), 1199\u20131241 (2003)","journal-title":"J. Symbolic Log."},{"key":"8_CR17","unstructured":"Kalimullin, I., Melnikov, A., Ng, K.M.: Algebraic structures computable without delay (Submitted)"},{"key":"8_CR18","unstructured":"Kalimullin, I., Melnikov, A., Ng, K.M.: Cantor\u2019s back-and-forth method and computability without delay (to appear)"},{"key":"8_CR19","unstructured":"Kalimullin, I., Melnikov, A., Ng, K.M.: The diversity of categoricity without delay. Algebra i Logika (to appear)"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/3-540-60178-3_93","volume-title":"Logic and Computational Complexity","author":"B Khoussainov","year":"1995","unstructured":"Khoussainov, B., Nerode, A.: Automatic presentations of structures. In: Leivant, D. (ed.) LCC 1994. LNCS, vol. 960, pp. 367\u2013392. Springer, Heidelberg (1995). doi: 10.1007\/3-540-60178-3_93"},{"key":"8_CR21","first-page":"181","volume":"94","author":"B Khoussainov","year":"2008","unstructured":"Khoussainov, B., Nerode, A.: Open questions in the theory of automatic structures. Bull. EATCS 94, 181\u2013204 (2008)","journal-title":"Bull. EATCS"},{"issue":"2:2","key":"8_CR22","first-page":"1","volume":"3","author":"B Khoussainov","year":"2007","unstructured":"Khoussainov, B., Nies, A., Rubin, S., Stephan, F.: Automatic structures: richness and limitations. Log. Methods Comput. Sci. 3(2:2), 1\u201318 (2007)","journal-title":"Log. Methods Comput. Sci."},{"key":"8_CR23","unstructured":"Kristiansen, L.: Papers on Subrecursion Theory, Dr Scient Thesis, Research report 217. Ph.D. thesis, University of Oslo (1996)"},{"key":"8_CR24","series-title":"London Mathematical Society Lecture Notes","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1017\/CBO9780511565670.009","volume-title":"Models and Computability (Leeds, 1997)","author":"B Khoussainov","year":"1999","unstructured":"Khoussainov, B., Shore, R.A.: Effective model theory: the number of models and their complexity. In: Cooper, S.B., Truss, J.K. (eds.) Models and Computability (Leeds, 1997). London Mathematical Society Lecture Notes, vol. 259, pp. 193\u2013239. Cambridge University Press, Cambridge (1999)"},{"key":"8_CR25","first-page":"552","volume":"24","author":"P LaRoche","year":"1977","unstructured":"LaRoche, P.: Recursively presented boolean algebras. Notices AMS 24, 552\u2013553 (1977)","journal-title":"Notices AMS"},{"issue":"15","key":"8_CR26","doi-asserted-by":"publisher","first-page":"1599","DOI":"10.1016\/j.disc.2011.01.024","volume":"311","author":"D Macpherson","year":"2011","unstructured":"Macpherson, D.: A survey of homogeneous structures. Discrete Math. 311(15), 1599\u20131634 (2011)","journal-title":"Discrete Math."},{"key":"8_CR27","unstructured":"Melnikov, A., Montalban, A.: Computable polish group actions (to appear)"},{"key":"8_CR28","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.aim.2012.11.012","volume":"235","author":"A Montalb\u00e1n","year":"2013","unstructured":"Montalb\u00e1n, A.: A computability theoretic equivalent to Vaught\u2019s conjecture. Adv. Math. 235, 56\u201373 (2013)","journal-title":"Adv. Math."},{"key":"8_CR29","first-page":"1","volume":"44","author":"P Novikov","year":"1955","unstructured":"Novikov, P.: On the algorithmic unsolvability of the word problem in group theory. Trudy Mat. Inst. Steklov 44, 1\u2013143 (1955)","journal-title":"Trudy Mat. Inst. Steklov"},{"key":"8_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-540-72734-7_29","volume-title":"Logical Foundations of Computer Science","author":"A Nies","year":"2007","unstructured":"Nies, A., Semukhin, P.: Finite automata presentable abelian groups. In: Artemov, S.N., Nerode, A. (eds.) LFCS 2007. LNCS, vol. 4514, pp. 422\u2013436. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-72734-7_29"},{"issue":"2","key":"8_CR31","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1016\/j.jalgebra.2007.04.015","volume":"320","author":"A Nies","year":"2008","unstructured":"Nies, A., Thomas, R.M.: FA-presentable groups and rings. J. Algebra 320(2), 569\u2013585 (2008)","journal-title":"J. Algebra"},{"key":"8_CR32","unstructured":"Nurtazin, A.: Computable classes and algebraic criteria of autostability. Math. Inst. SB USSRAS, Novosibirsk, Summary of Scientific Schools (1974)"},{"issue":"3","key":"8_CR33","doi-asserted-by":"publisher","first-page":"595","DOI":"10.2307\/2273758","volume":"46","author":"JB Remmel","year":"1981","unstructured":"Remmel, J.B.: Recursive boolean algebras with recursive atoms. J. Symb. Log. 46(3), 595\u2013616 (1981)","journal-title":"J. Symb. Log."},{"key":"8_CR34","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/BFb0090954","volume-title":"Logic Year 1979\u201380","author":"RL Smith","year":"1981","unstructured":"Smith, R.L.: Two theorems on autostability in p-Groups. In: Lerman, M., Schmerl, J.H., Soare, R.I. (eds.) Logic Year 1979\u201380. LNM, vol. 859, pp. 302\u2013311. Springer, Heidelberg (1981). doi: 10.1007\/BFb0090954"},{"issue":"4","key":"8_CR35","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.2178\/jsl\/1318338853","volume":"76","author":"T Tsankov","year":"2011","unstructured":"Tsankov, T.: The additive group of the rationals does not have an automatic presentation. J. Symbolic Log. 76(4), 1341\u20131351 (2011)","journal-title":"J. Symbolic Log."}],"container-title":["Lecture Notes in Computer Science","Unveiling Dynamics and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58741-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T02:14:28Z","timestamp":1719195268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-58741-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319587400","9783319587417"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58741-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"12 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turku","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/math.utu.fi\/cie2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}