{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:44:41Z","timestamp":1757616281531,"version":"3.44.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"3","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":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"vor","delay-in-days":5662,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1990,6]]},"DOI":"10.1016\/0022-0000(90)90006-7","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"444-449","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["A note on A.E. h-complex functions"],"prefix":"10.1016","volume":"40","author":[{"given":"Mark A.","family":"Fulk","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(90)90006-7_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. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(90)90006-7_BIB2","series-title":"Proceedings, 12th Annual Symposium on the Theory of Computation","article-title":"Independence results in computer science?","author":"Joseph","year":"1980"},{"key":"10.1016\/0022-0000(90)90006-7_BIB3","series-title":"Proceedings, 19th Symposium on Foundations of Computer Science","article-title":"Model theoretic aspects of computational complexity","author":"Lipton","year":"1978"},{"year":"1978","series-title":"An Introduction to the General Theory of Algorithms","author":"Machtey","key":"10.1016\/0022-0000(90)90006-7_BIB4"},{"key":"10.1016\/0022-0000(90)90006-7_BIB5","article-title":"Degree of Difficulty of Computing a Function","volume":"2","author":"Rabin","year":"1960","journal-title":"Hebrew University Technical Report"},{"year":"1967","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","key":"10.1016\/0022-0000(90)90006-7_BIB6"},{"key":"10.1016\/0022-0000(90)90006-7_BIB7","series-title":"Proceedings, First International Conference on Automata, Languages, and Programming","first-page":"585","article-title":"Does the computational speed-up concern programming?","author":"Schnorr","year":"1972"},{"article-title":"A Note on Arbitrarily Complex Recursive Functions","year":"1985","author":"Smith","key":"10.1016\/0022-0000(90)90006-7_BIB8"},{"key":"10.1016\/0022-0000(90)90006-7_BIB10","unstructured":"Notre Dame J. Formal Logic, in press."},{"key":"10.1016\/0022-0000(90)90006-7_BIB9","article-title":"Theory of Formal Systems","volume":"Vol. 47","author":"Smullyan","year":"1961"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000090900067?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000090900067?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T18:10:49Z","timestamp":1757095849000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000090900067"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["0022000090900067"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(90)90006-7","relation":{},"ISSN":["0022-0000"],"issn-type":[{"type":"print","value":"0022-0000"}],"subject":[],"published":{"date-parts":[[1990,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A note on A.E. h-complex functions","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0022-0000(90)90006-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}