{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:43:42Z","timestamp":1740109422816,"version":"3.37.3"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,6,28]],"date-time":"2016-06-28T00:00:00Z","timestamp":1467072000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["14-11-00085"],"award-info":[{"award-number":["14-11-00085"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s00224-016-9698-9","type":"journal-article","created":{"date-parts":[[2016,6,28]],"date-time":"2016-06-28T01:24:31Z","timestamp":1467077071000},"page":"671-676","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Generic Undecidability of the Halting Problem for Normalized Turing Machines"],"prefix":"10.1007","volume":"60","author":[{"given":"Alexander","family":"Rybalov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,28]]},"reference":[{"issue":"3","key":"9698_CR1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/j.aam.2007.01.001","volume":"40","author":"CS Calude","year":"2008","unstructured":"Calude, C.S., Stay, M.A.: Most programs stop quickly or never halt. Adv. Appl. Math. 40(3), 295\u2013308 (2008)","journal-title":"Adv. Appl. Math."},{"key":"9698_CR2","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1145\/321892.321894","volume":"22","author":"GJ Chaitin","year":"1975","unstructured":"Chaitin, G.J.: A theory of program size formally identical to information theory. J. ACM 22, 329\u2013340 (1975)","journal-title":"J. ACM"},{"issue":"4","key":"9698_CR3","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1305\/ndjfl\/1168352664","volume":"47","author":"JD Hamkins","year":"2006","unstructured":"Hamkins, J.D., Miasnikov, A.: The halting problem is decidable on a set of asymptotic probability one. Notre Dame J. Formal Logic 47(4), 515\u2013524 (2006)","journal-title":"Notre Dame J. Formal Logic"},{"issue":"2","key":"9698_CR4","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1016\/S0021-8693(03)00167-4","volume":"264","author":"I Kapovich","year":"2003","unstructured":"Kapovich, I., Myasnikov, A., Schupp, P., Shpilrain, V.: Generic-case complexity, decision problems in group theory and random walks. J. Algebra 264(2), 665\u2013694 (2003)","journal-title":"J. Algebra"},{"key":"9698_CR5","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1016\/j.tcs.2007.02.010","volume":"377","author":"A Rybalov","year":"2007","unstructured":"Rybalov, A.: On the strongly generic undecidability of the Halting Problem. Theor. Comput. Sci. 377, 268\u2013270 (2007)","journal-title":"Theor. Comput. Sci."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9698-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-016-9698-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9698-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9698-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T13:19:40Z","timestamp":1498310380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-016-9698-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,28]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["9698"],"URL":"https:\/\/doi.org\/10.1007\/s00224-016-9698-9","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2016,6,28]]}}}