{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T09:02:48Z","timestamp":1712307768068},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8447,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1990,6]]},"DOI":"10.1016\/0304-3975(90)90160-j","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"1-46","source":"Crossref","is-referenced-by-count":17,"title":["Reversible parallel computation: An evolving space-model"],"prefix":"10.1016","volume":"73","author":[{"given":"G.","family":"Jacopini","sequence":"first","affiliation":[]},{"given":"G.","family":"Sontacchi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90160-J_BIB1","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","article-title":"Machine independent theory of the complexity of recursive functions","volume":"14","author":"Blum","year":"1967","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(90)90160-J_BIB2","article-title":"Theory of Self-reproducing Automata","author":"von Neumann","year":"1966"},{"key":"10.1016\/0304-3975(90)90160-J_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/1970696","article-title":"A model of set theory in which every set of reals is Lebesgue numerable","volume":"92","author":"Solovay","year":"1970","journal-title":"Ann. Math."},{"key":"10.1016\/0304-3975(90)90160-J_BIB4","series-title":"Group Theory","author":"Wigner","year":"1959"},{"key":"10.1016\/0304-3975(90)90160-J_BIB5","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1147\/rd.176.0525","article-title":"Logical reversibility of computation","volume":"6","author":"Bennett","year":"1973","journal-title":"IBM J. Res. Dev."},{"key":"10.1016\/0304-3975(90)90160-J_BIB6","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0022-0000(77)80007-X","article-title":"Computation and construction universality of reversible cellular automata","volume":"15","author":"Toffoli","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(90)90160-J_BIB7","series-title":"Tech. Report","article-title":"Quantum mechanical computers","author":"Feynman","year":"1984"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090160J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090160J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:51:36Z","timestamp":1555127496000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090160J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["030439759090160J"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90160-j","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}