{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:51:23Z","timestamp":1740099083409,"version":"3.37.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319924014"},{"type":"electronic","value":"9783319924021"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-92402-1_8","type":"book-chapter","created":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T10:28:51Z","timestamp":1527244131000},"page":"137-152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Extension of Interval-Valued Computing Equivalent to Red-Green Turing Machines"],"prefix":"10.1007","author":[{"given":"Benedek","family":"Nagy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e1ndor","family":"V\u00e1lyi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,26]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-319-23111-2_3","volume-title":"Machines, Computations, and Universality","author":"E Csuhaj-Varj\u00fa","year":"2015","unstructured":"Csuhaj-Varj\u00fa, E., Freund, R., Vaszil, G.: A connection between red-green turing machines and watson-crick T0L systems. In: Durand-Lose, J., Nagy, B. (eds.) MCU 2015. LNCS, vol. 9288, pp. 31\u201344. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-23111-2_3"},{"issue":"1\u20132","key":"8_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.3233\/FI-2017-1578","volume":"155","author":"E Csuhaj-Varj\u00fa","year":"2017","unstructured":"Csuhaj-Varj\u00fa, E., Freund, R., Vaszil, G.: Watson-Crick T0L systems and red-green register machines. Fundamenta Informaticae 155(1\u20132), 111\u2013129 (2017)","journal-title":"Fundamenta Informaticae"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.tcs.2011.12.040","volume":"429","author":"J Leeuwen van","year":"2012","unstructured":"van Leeuwen, J., Wiedermann, J.: Computation as an unbounded process. Theoret. Comput. Sci. 429, 202\u2013212 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR4","unstructured":"Nagy, B.: An interval-valued computing device. In: CiE 2005, Computability in Europe: New Computational Paradigms, Amsterdam, Netherlands, pp. 166\u2013177 (2005)"},{"key":"8_CR5","unstructured":"Nagy, B., V\u00e1lyi, S.: Solving a PSPACE-complete problem by a linear interval-valued computation. In: CiE 2006, Computability in Europe: Logical Approaches to Computational Barriers. University of Wales, Swansea, UK, pp. 216\u2013225 (2006)"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.tcs.2007.12.013","volume":"394","author":"B Nagy","year":"2008","unstructured":"Nagy, B., V\u00e1lyi, S.: Interval-valued computations and their connection with PSPACE. Theoret. Comput. Sci. 394, 208\u2013222 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"539","DOI":"10.5486\/PMD.2011.5134","volume":"79","author":"B Nagy","year":"2011","unstructured":"Nagy, B., V\u00e1lyi, S.: Prime factorization by interval-valued computing. Publicationes Mathematicae Debrecen 79, 539\u2013551 (2011)","journal-title":"Publicationes Mathematicae Debrecen"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"76","DOI":"10.4204\/EPTCS.143.7","volume":"143","author":"B Nagy","year":"2014","unstructured":"Nagy, B., V\u00e1lyi, S.: Computing discrete logarithm by interval-valued paradigm. Electron. Proc. Theoret. Comput. Sci. 143, 76\u201386 (2014)","journal-title":"Electron. Proc. Theoret. Comput. Sci."},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-319-23111-2_11","volume-title":"Machines, Computations, and Universality","author":"B Nagy","year":"2015","unstructured":"Nagy, B., V\u00e1lyi, S.: A characterization of NP within interval-valued computing. In: Durand-Lose, J., Nagy, B. (eds.) MCU 2015. LNCS, vol. 9288, pp. 164\u2013179. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-23111-2_11"},{"issue":"1\u20132","key":"8_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.3233\/FI-2017-1581","volume":"155","author":"B Nagy","year":"2017","unstructured":"Nagy, B., V\u00e1lyi, S.: A shift-free characterization of NP within interval-valued computing. Fundamenta Informaticae 155(1\u20132), 187\u2013207 (2017)","journal-title":"Fundamenta Informaticae"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/S0022-0000(76)80037-2","volume":"12","author":"VR Pratt","year":"1976","unstructured":"Pratt, V.R., Rabin, M.O., Stockmeyer, L.J.: A characterization of the power of vector machines. J. Comput. Syst. Sci. 12, 198\u2013221 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.tcs.2004.07.001","volume":"334","author":"D Woods","year":"2005","unstructured":"Woods, D., Naughton, T.: An optical model of computation. Theoret. Comput. Sci. 334, 227\u2013258 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR13","first-page":"29","volume":"2017","author":"J Wiedermann","year":"2017","unstructured":"Wiedermann, J., van Leeuwen, J.: Non-classical turing machines: extending the notion of computation. Proc. NCMA 2017, 29\u201340 (2017)","journal-title":"Proc. NCMA"}],"container-title":["Lecture Notes in Computer Science","Machines, Computations, and Universality"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92402-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T10:34:46Z","timestamp":1527244486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-92402-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319924014","9783319924021"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92402-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}