{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T01:05:04Z","timestamp":1782263104721,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540133315","type":"print"},{"value":"9783540388562","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-13331-3_33","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:01:55Z","timestamp":1330192915000},"page":"62-76","source":"Crossref","is-referenced-by-count":5,"title":["Recursively enumerable extensions of R1 by finite functions"],"prefix":"10.1007","author":[{"given":"W.","family":"Menzel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"V.","family":"Sperschneider","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"4_CR1","unstructured":"BUCHBERGER, B. & MENZEL, W. (1977), Simulation-universal automata, Interner Bericht Nr. 14\/77, Institut f\u00fcr Informatik I, Universit\u00e4t Karlsruhe"},{"key":"4_CR2","unstructured":"MAIER, W., MENZEL, W. & SPERSCHNEIDER, V. (1982), Embedding properties of total recursive functions, Zeitschrift f. Math. Logik und Grundlagen der Mathematik, Band 28"},{"key":"4_CR3","unstructured":"MAL'CEV, A.I. (1970), Algorithms and recursive functions, Groningen"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"MENZEL, W. & SPERSCHNEIDER, V. (1982), Universal automata with uniform bound on simulation time, Information and Control, Vol. 52","DOI":"10.1016\/S0019-9958(82)80083-1"},{"key":"4_CR5","unstructured":"POUR-EL, M. & HOWARD, W.A. (1964), A structural criterion for recursive enumeration without repetition, Zeitschrift f. Math. Logik u. Grundl. der Mathematik, Band 10"},{"key":"4_CR6","unstructured":"ROGERS, H. JR. (1967), Theory of recursive functions and effective computability, New York"},{"key":"4_CR7","unstructured":"SPERSCHNEIDER, V., The Length-Problem, in this lecture notes volume"}],"container-title":["Lecture Notes in Computer Science","Logic and Machines: Decision Problems and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-13331-3_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:52:35Z","timestamp":1619556755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-13331-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540133315","9783540388562"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-13331-3_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984]]}}}