{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:37:58Z","timestamp":1742395078644},"reference-count":20,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1999,9]]},"DOI":"10.1016\/s0020-0190(99)00116-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:21:21Z","timestamp":1027621281000},"page":"193-197","source":"Crossref","is-referenced-by-count":2,"title":["Counter machines"],"prefix":"10.1016","volume":"71","author":[{"given":"Arkadiusz","family":"Wojna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(99)00116-7_ID003","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/S0019-9958(66)80003-7","article-title":"Turing machines with restricted memory access","volume":"9","author":"Fischer","year":"1966","journal-title":"Inform. and Control"},{"key":"10.1016\/S0020-0190(99)00116-7_ID004","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01694011","article-title":"Counter machines and counter languages","volume":"3","author":"Fischer","year":"1968","journal-title":"Mathematical Systems Theory"},{"key":"10.1016\/S0020-0190(99)00116-7_ID005","series-title":"Logic Colloquium '69","first-page":"361","article-title":"Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory","author":"Friedman","year":"1971"},{"key":"10.1016\/S0020-0190(99)00116-7_ID006","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0022-0000(73)80040-6","article-title":"Program schemes, recursion schemes, and formal languages","volume":"7","author":"Garland","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(99)00116-7_ID007","series-title":"Record of Project MAC Conference on Concurrent Systems and Parallel Computation","first-page":"119","article-title":"Comparative schematology","author":"Hewitt","year":"1970"},{"key":"10.1016\/S0020-0190(99)00116-7_ID008","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0020-0190(99)00116-7_ID009","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/S0022-0000(74)80030-9","article-title":"Translatability of schemas over restricted interpretations","volume":"8","author":"Kfoury","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(99)00116-7_ID010","first-page":"35","article-title":"Some open problems in the theory of program schemes and dynamic logics","volume":"44","author":"Kfoury","year":"1989","journal-title":"Uspekhi Mat. Nauk"},{"key":"10.1016\/S0020-0190(99)00116-7_ID011","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0304-3975(96)00080-1","article-title":"Small universal register machines","volume":"168","author":"Korec","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(99)00116-7_ID012","series-title":"Automata and Computability","author":"Kozen","year":"1997"},{"key":"10.1016\/S0020-0190(99)00116-7_ID013","series-title":"Elements of the Theory of Computation","author":"Lewis","year":"1981"},{"key":"10.1016\/S0020-0190(99)00116-7_ID014","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/0304-3975(94)90038-8","article-title":"Nonerasing Turing machines: A frontier between a decidable halting problem and universality","volume":"129","author":"Margenstern","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(99)00116-7_ID015","series-title":"The equivalence of programme schemes in structures with equality, Ph.D. Thesis","author":"McKay","year":"1976"},{"issue":"3","key":"10.1016\/S0020-0190(99)00116-7_ID016","doi-asserted-by":"crossref","first-page":"437","DOI":"10.2307\/1970290","article-title":"Recursive unsolvability of Post's problem of `tag' and other topics in the theory of Turing machines","volume":"74","author":"Minsky","year":"1961","journal-title":"Ann. of Math."},{"key":"10.1016\/S0020-0190(99)00116-7_ID017","series-title":"Computation: Finite and Infinite Machines","author":"Minsky","year":"1967"},{"issue":"1\u20132","key":"10.1016\/S0020-0190(99)00116-7_ID018","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01977114","article-title":"Varianten von Turingmaschinen","volume":"4","author":"Oberschelp","year":"1958","journal-title":"Arch. Math. Logik Grund."},{"key":"10.1016\/S0020-0190(99)00116-7_ID019","series-title":"Proc. Fourth Annual ACM Symposium on the Theory of Computing, Denver, CO","first-page":"44","article-title":"Flowchart schemata with counters","author":"Plaisted","year":"1972"},{"key":"10.1016\/S0020-0190(99)00116-7_ID020","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1145\/321160.321170","article-title":"Computability of recursive functions","volume":"10","author":"Shepherdson","year":"1963","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(99)00116-7_ID021","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1112\/plms\/s2-42.1.230","article-title":"On computable numbers with an application to the Entscheidungsproblem","volume":"42","author":"Turing","year":"1936","journal-title":"Proc. London Math. Soc. Ser. 2"},{"key":"10.1016\/S0020-0190(99)00116-7_ID022","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/320856.320867","article-title":"A variant to Turing's theory of computing machines","volume":"4","author":"Wang","year":"1957","journal-title":"J. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019099001167?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019099001167?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:50:20Z","timestamp":1556059820000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019099001167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":20,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[1999,9]]}},"alternative-id":["S0020019099001167"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(99)00116-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1999,9]]}}}