{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:25:42Z","timestamp":1777645542308,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"2-3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["FI"],"published-print":{"date-parts":[[2021,8,4]]},"abstract":"<jats:p>Interval-valued computing is a kind of massively parallel computing. It operates on specific subsets of the interval [0,1) \u2013 unions of subintervals. They serve as basic data units and are called interval-values. It was established in [9], by a rather simple observation, that interval-valued computing, as a digital computing model, has computing power equivalent to Turing machines. However, this equivalence involves an unlimited number of interval-valued variables. In [14], the equivalence with Turing machines is established using a simulation that uses only a fixed number of interval-valued variables and this number depends only on the number of states of the Turing machine \u2013 in a logarithmic way. The simulation given there allows us to extend interval-valued computations into infinite length to capture the computing power of red-green Turing machines. In this extension of [14], based on the quasi-periodic techniques used in the simulations in that paper, a reformulation of the interval-valued computations is given, named circular interval-valued computers. This reformulation enforces the finiteness of the number of used interval-valued variables by building the finiteness into the syntax rules.<\/jats:p>","DOI":"10.3233\/fi-2021-2057","type":"journal-article","created":{"date-parts":[[2021,8,6]],"date-time":"2021-08-06T12:46:41Z","timestamp":1628254001000},"page":"213-238","source":"Crossref","is-referenced-by-count":1,"title":["Circular Interval-valued Computers and Simulation of (Red-green) Turing Machines"],"prefix":"10.1177","volume":"181","author":[{"given":"Benedek","family":"Nagy","sequence":"first","affiliation":[{"name":"Department of Mathematics, Eastern Mediterranean University, Famagusta, North Cyprus, via Mersin-10, Turkey. nbenedek.inf@gmail.com"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e1ndor","family":"V\u00e1lyi","sequence":"additional","affiliation":[{"name":"Institute of Mathematics and Informatics, University of Ny\u00edregyh\u00e1za, Hungary. valyi.sandor@nye.hu"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","container-title":["Fundamenta Informaticae"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/FI-2021-2057","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:32:31Z","timestamp":1777444351000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/FI-2021-2057"}},"subtitle":[],"editor":[{"given":"J\u00e9r\u00f4me","family":"Durand-Lose","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Jarkko","family":"Kari","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Sergey","family":"Verlan","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2021,8,4]]},"references-count":0,"journal-issue":{"issue":"2-3"},"URL":"https:\/\/doi.org\/10.3233\/fi-2021-2057","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,4]]}}}