{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:33:01Z","timestamp":1725535981413},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029585"},{"type":"electronic","value":"9783642029592"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02959-2_28","type":"book-chapter","created":{"date-parts":[[2009,7,25]],"date-time":"2009-07-25T01:02:22Z","timestamp":1248483742000},"page":"371-387","source":"Crossref","is-referenced-by-count":7,"title":["Complexity of Fractran and Productivity"],"prefix":"10.1007","author":[{"given":"J\u00f6rg","family":"Endrullis","sequence":"first","affiliation":[]},{"given":"Clemens","family":"Grabmayer","sequence":"additional","affiliation":[]},{"given":"Dimitri","family":"Hendriks","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(99)00207-8","volume":"236","author":"T. Arts","year":"2000","unstructured":"Arts, T., Giesl, J.: Termination of Term Rewriting Using Dependency Pairs. Theoretical Computer Science\u00a0236, 133\u2013178 (2000)","journal-title":"Theoretical Computer Science"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-1-4612-4808-8_2","volume-title":"Open Problems in Communication and Computation","author":"J.H. Conway","year":"1987","unstructured":"Conway, J.H.: Fractran: A Simple Universal Programming Language for Arithmetic. In: Open Problems in Communication and Computation, pp. 4\u201326. Springer, Heidelberg (1987)"},{"key":"28_CR3","unstructured":"Endrullis, J., Geuvers, H., Zantema, H.: Degrees of Undecidabililty of TRS Properties. In: CSL 2009 (to appear, 2009)"},{"key":"28_CR4","unstructured":"Endrullis, J., Grabmayer, C., Hendriks, D.: ProPro: an Automated Productivity Prover (2008), http:\/\/infinity.few.vu.nl\/productivity\/"},{"key":"28_CR5","unstructured":"Endrullis, J., Grabmayer, C., Hendriks, D.: Complexity of Fractran and Productivity (2009), http:\/\/arxiv.org\/abs\/0903.4366"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-540-74240-1_24","volume-title":"Fundamentals of Computation Theory","author":"J. Endrullis","year":"2007","unstructured":"Endrullis, J., Grabmayer, C., Hendriks, D., Isihara, A., Klop, J.W.: Productivity of Stream Definitions. In: Csuhaj-Varj\u00fa, E., \u00c9sik, Z. (eds.) FCT 2007. LNCS, vol.\u00a04639, pp. 274\u2013287. Springer, Heidelberg (2007)"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Grue Simonsen, J.: The \u03c0 0 2-Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity). In: RTA 2009 (to appear, 2009)","DOI":"10.1007\/978-3-642-02348-4_24"},{"issue":"1","key":"28_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1002\/malq.19710170117","volume":"17","author":"G.T. Herman","year":"1971","unstructured":"Herman, G.T.: Strong Computability and Variants of the Uniform Halting Problem. Zeitschrift f\u00fcr Math. Logik und Grundlagen der Mathematik\u00a017(1), 115\u2013131 (1971)","journal-title":"Zeitschrift f\u00fcr Math. Logik und Grundlagen der Mathematik"},{"key":"28_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12898-5","volume-title":"Recursion-Theoretic Hierarchies","author":"P.G. Hinman","year":"1978","unstructured":"Hinman, P.G.: Recursion-Theoretic Hierarchies. Springer, Heidelberg (1978)"},{"key":"28_CR10","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"J.W. Klop","year":"1992","unstructured":"Klop, J.W.: Term Rewriting Systems. In: Handbook of Logic in Computer Science, vol.\u00a02, pp. 1\u2013116. Oxford University Press, Oxford (1992)"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/978-3-540-72504-6_49","volume-title":"Theory and Applications of Models of Computation","author":"S.A. Kurtz","year":"2007","unstructured":"Kurtz, S.A., Simon, J.: The Undecidability of the Generalized Collatz Problem. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol.\u00a04484, pp. 542\u2013553. Springer, Heidelberg (2007)"},{"issue":"1","key":"28_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.2307\/2322189","volume":"92","author":"J.C. Lagarias","year":"1985","unstructured":"Lagarias, J.C.: The 3x\u2009+\u20091 Problem and its Generalizations. AMM\u00a092(1), 3\u201323 (1985)","journal-title":"AMM"},{"key":"28_CR13","volume-title":"The Implementation of Functional Programming Languages","author":"S. Peyton Jones","year":"1987","unstructured":"Peyton Jones, S.: The Implementation of Functional Programming Languages. Prentice-Hall, Englewood Cliffs (1987)"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Ro\u015fu, G.: Equality of Streams is a ${\\rm \\Pi}^{0}_{2}$ -complete Problem. In: ICFP, pp. 184\u2013191 (2006)","DOI":"10.1145\/1160074.1159827"},{"issue":"4","key":"28_CR15","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1145\/69558.69563","volume":"11","author":"B.A. Sijtsma","year":"1989","unstructured":"Sijtsma, B.A.: On the Productivity of Recursive List Definitions. ACM Transactions on Programming Languages and Systems\u00a011(4), 633\u2013649 (1989)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"28_CR16","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Term Rewriting Systems","author":"Terese","year":"2003","unstructured":"Terese: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol.\u00a055. Cambridge University Press, Cambridge (2003)"},{"key":"28_CR17","first-page":"274","volume-title":"LICS","author":"Y. Toyama","year":"1992","unstructured":"Toyama, Y.: Strong Sequentiality of Left-Linear Overlapping Term Rewriting Systems. In: LICS, pp. 274\u2013284. IEEE Computer Society Press, Los Alamitos (1992)"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE-22"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02959-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T13:52:05Z","timestamp":1558446725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02959-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029585","9783642029592"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02959-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}