{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,26]],"date-time":"2023-12-26T19:27:41Z","timestamp":1703618861200},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1972,3,1]],"date-time":"1972-03-01T00:00:00Z","timestamp":68256000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1972,3]]},"DOI":"10.1007\/bf01706069","type":"journal-article","created":{"date-parts":[[2005,6,21]],"date-time":"2005-06-21T05:20:54Z","timestamp":1119331254000},"page":"3-15","source":"Crossref","is-referenced-by-count":28,"title":["Subrecursiveness: Machine-independent notions of computability in restricted time and storage"],"prefix":"10.1007","volume":"6","author":[{"given":"David B.","family":"Thompson","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01706069_CR1","volume-title":"On Spectra","author":"J. H. Bennett","year":"1962","unstructured":"J. H. Bennett,On Spectra, Thesis, Princeton, 1962."},{"key":"BF01706069_CR2","first-page":"24","volume-title":"Proc. 1964 International Congress on Logic, Methodology and Philosophy of Science","author":"A. Cobham","year":"1965","unstructured":"A. Cobham, The intrinsic computational complexity of functions,Proc. 1964 International Congress on Logic, Methodology and Philosophy of Science, pp. 24\u201330, North-Holland, Amsterdam, 1965."},{"key":"BF01706069_CR3","unstructured":"M. J. Fischer andA. L. Rosenberg, Turing machines with reset operations,Notices Amer. Math. Soc., p. 845, 67T-629, 1967."},{"key":"BF01706069_CR4","unstructured":"A. Grzegorczyk, Some classes of recursive functions,Rozprawy Matematyczne, No. 4, 1953."},{"key":"BF01706069_CR5","first-page":"179","volume-title":"Hierarchies on memory limited computations, IEEE Conf. Record on Switching Circuit Theory and Logical Design","author":"J. Hartmanis","year":"1965","unstructured":"J. Hartmanis, P. M. Lewis II, andR. E. Stearns, Hierarchies on memory limited computations, IEEE Conf. Record on Switching Circuit Theory and Logical Design, 1965, pp. 179\u2013190, Ann Arbor, Michigan."},{"key":"BF01706069_CR6","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/S0019-9958(65)90399-2","volume":"8","author":"F. C. Hennie","year":"1965","unstructured":"F. C. Hennie, One-tape, off-line Turing machine computations,Information and Control 8 (1965), 553\u2013578.","journal-title":"Information and Control"},{"key":"BF01706069_CR7","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/321356.321362","volume":"13","author":"F. C. Hennie","year":"1966","unstructured":"F. C. Hennie andR. E. Stearns, Two-tape simulation of multitape Turing machines,J. Assoc. Comp. Mach. 13 (1966), 533\u2013546.","journal-title":"J. Assoc. Comp. Mach."},{"key":"BF01706069_CR8","volume-title":"Formal Languages and their relation to automata","author":"J. E. Hopcroft","year":"1969","unstructured":"J. E. Hopcroft andJ. D. Ullman, Formal Languages and their relation to automata, Addison Wesley, Reading, Mass., 1969."},{"key":"BF01706069_CR9","volume-title":"Introduction to Metamathematics","author":"S. C. Kleene","year":"1952","unstructured":"S. C. Kleene,Introduction to Metamathematics, Van Nostrand, New York, 1952."},{"key":"BF01706069_CR10","unstructured":"G. Kreisel, Recursive, subrecursive, metarecursive, Rome Air Development Center and Hughes-Fullerton TP 66-11-22, 1965."},{"key":"BF01706069_CR11","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1090\/S0002-9947-1963-0158822-2","volume":"106","author":"R. W. Ritchie","year":"1963","unstructured":"R. W. Ritchie, Classes of predictably computable functions,Trans. Amer. Math. Soc. 106 (1963), 137\u2013173.","journal-title":"Trans. Amer. Math. Soc."},{"key":"BF01706069_CR12","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"H. Rogers,Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967."},{"key":"BF01706069_CR13","volume-title":"Theory of Formal Systems, Annals of Math. Studies, No. 47","author":"Raymond M. Smullyan","year":"1961","unstructured":"Raymond M. Smullyan,Theory of Formal Systems, Annals of Math. Studies, No. 47, Princeton Univ. Press, Princeton, 1961."},{"key":"BF01706069_CR14","volume-title":"Subrecursiveness and Finite Computers","author":"D. B. Thompson","year":"1968","unstructured":"D. B. Thompson,Subrecursiveness and Finite Computers, Thesis, Stanford, 1968."},{"key":"BF01706069_CR15","unstructured":"D. B. Thompson, On the complexity of finite functions, in preparation."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01706069.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01706069\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01706069","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T08:32:17Z","timestamp":1557304337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01706069"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1972,3]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1972,3]]}},"alternative-id":["BF01706069"],"URL":"https:\/\/doi.org\/10.1007\/bf01706069","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1972,3]]}}}