{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T18:49:26Z","timestamp":1672253366783},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1971,4,1]],"date-time":"1971-04-01T00:00:00Z","timestamp":39312000000},"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":15448,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1971,4]]},"DOI":"10.1016\/s0022-0000(71)80030-2","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T09:46:40Z","timestamp":1289382400000},"page":"118-128","source":"Crossref","is-referenced-by-count":9,"title":["Abstract computational complexity and cycling computations"],"prefix":"10.1016","volume":"5","author":[{"given":"Giorgio","family":"Ausiello","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0022-0000(71)80030-2_bib1","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","article-title":"A machine-independent theory of the complexity of recursive functions","volume":"14","author":"Blum","year":"1967","journal-title":"J. of ACM"},{"key":"10.1016\/S0022-0000(71)80030-2_bib2","author":"Rogers","year":"1967"},{"key":"10.1016\/S0022-0000(71)80030-2_bib3","series-title":"Fourth Annual Princeton Conference on Information Sciences and Systems","article-title":"Parallel universal computation","author":"Ausiello","year":"1970"},{"key":"10.1016\/S0022-0000(71)80030-2_bib4","series-title":"ACM Symposium on Theory of Computing","article-title":"Complexity Classes of Recursive Functions and the Existence of Complexity Gaps","author":"Borodin","year":"1969"},{"key":"10.1016\/S0022-0000(71)80030-2_bib5","series-title":"ACM Symposium on Theory of Computing","article-title":"Classes of Computable Functions Defined by Bounds on Computations","author":"Meyer","year":"1969"},{"key":"10.1016\/S0022-0000(71)80030-2_bib6","series-title":"Second Annual ACM Symposium on Theory of Computing","article-title":"On Bounds on the Number of Steps to Computer Functions","author":"Ausiello","year":"1970"},{"key":"10.1016\/S0022-0000(71)80030-2_bib7","article-title":"Upward and downward diagonalization over axiomatic complexity classes","author":"Constable","year":"1969"},{"key":"10.1016\/S0022-0000(71)80030-2_bib8","series-title":"Second Annual ACM Symposium on Theory of Computing","article-title":"Recursive Properties of Abstract Complexity Classes","author":"Landweber","year":"1970"},{"key":"10.1016\/S0022-0000(71)80030-2_bib9","series-title":"Second Annual ACM Symposium on Theory of Computing","article-title":"Decision Problems for Complexity Classes of Computable Functions","author":"Lewis","year":"1970"},{"key":"10.1016\/S0022-0000(71)80030-2_bib10","article-title":"Weak complexity measures","author":"Havel","year":"1970"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000071800302?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000071800302?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T23:53:03Z","timestamp":1544140383000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000071800302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1971,4]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1971,4]]}},"alternative-id":["S0022000071800302"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(71)80030-2","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1971,4]]}}}