{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T16:10:49Z","timestamp":1673712649592},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2007,3,1]],"date-time":"2007-03-01T00:00:00Z","timestamp":1172707200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":2366,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic and Algebraic Programming"],"published-print":{"date-parts":[[2007,3]]},"DOI":"10.1016\/j.jlap.2006.09.001","type":"journal-article","created":{"date-parts":[[2006,11,3]],"date-time":"2006-11-03T12:54:13Z","timestamp":1162558453000},"page":"44-78","source":"Crossref","is-referenced-by-count":1,"title":["Universality and semicomputability for nondeterministic programming languages over abstract algebras"],"prefix":"10.1016","volume":"71","author":[{"given":"Wei","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Yuan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jeffery","family":"Zucker","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jlap.2006.09.001_bib1","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"issue":"7","key":"10.1016\/j.jlap.2006.09.001_bib2","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1145\/358886.358892","article-title":"On folk theorems","volume":"23","author":"Harel","year":"1980","journal-title":"Communications of the ACM"},{"key":"10.1016\/j.jlap.2006.09.001_bib3","unstructured":"W. Jiang, Universality and semicomputability for non-deterministic programming languages over abstract algebras, Master\u2019s thesis, Department of Computing and Software, McMaster University, 2002, Technical Report CAS 03-01-JZ, Department of Computing and Software, McMaster University, 2003."},{"key":"10.1016\/j.jlap.2006.09.001_bib4","unstructured":"J. Koster, Relative strengths of while-programs with and without counters and stacks, Master\u2019s thesis, Department of Computing and Software, McMaster University, 2002, Technical Report CAS 02-05-JZ, Department of Computing and Software, McMaster University, 2002."},{"key":"10.1016\/j.jlap.2006.09.001_bib5","unstructured":"L. Luo, Specifiability and computability of functions by equations on partial algebras, Master\u2019s thesis, Department of Computing and Software, McMaster University, 2003, Technical Report CAS 03-07-JZ, Department of Computing and Software, McMaster University, 2003."},{"key":"10.1016\/j.jlap.2006.09.001_bib6","unstructured":"G. Mirkowska, Algorithmic logic and its applications, Ph.D. thesis, University of Warsaw, 1972."},{"key":"10.1016\/j.jlap.2006.09.001_bib7","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0304-3975(98)00297-7","article-title":"Computability by \u2018while\u2019 programs on topological partial algebras","volume":"219","author":"Tucker","year":"1999","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jlap.2006.09.001_bib8","first-page":"317","article-title":"Computable functions and semicomputable sets on many-sorted algebras","volume":"vol. 5","author":"Tucker","year":"2000"},{"key":"10.1016\/j.jlap.2006.09.001_bib9","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1145\/1024922.1024924","article-title":"Abstract versus concrete computation on metric partial algebras","volume":"5","author":"Tucker","year":"2004","journal-title":"ACM Trans. Comput. Logic"},{"key":"10.1016\/j.jlap.2006.09.001_bib10","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.jlap.2003.10.001","article-title":"Computable total functions on metric algebras, algebraic specifications and dynamical systems","volume":"62","author":"Tucker","year":"2005","journal-title":"J. Logic Algebr. Program."},{"key":"10.1016\/j.jlap.2006.09.001_bib11","first-page":"230","article-title":"On computable numbers, with an application to the Entscheidungsproblem","volume":"42","author":"Turing","year":"1936","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/j.jlap.2006.09.001_bib12","unstructured":"Y. Wang, Semantics of non-deterministic programs and the universal function theorem over abstract algebras, Master\u2019s thesis, Department of Computing and Software, McMaster University, 2001, Technical Report CAS 01-03-JZ, Department of Computing and Software, McMaster University, 2001."}],"container-title":["The Journal of Logic and Algebraic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1567832606000506?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1567832606000506?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,11]],"date-time":"2019-01-11T18:50:13Z","timestamp":1547232613000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1567832606000506"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,3]]}},"alternative-id":["S1567832606000506"],"URL":"https:\/\/doi.org\/10.1016\/j.jlap.2006.09.001","relation":{},"ISSN":["1567-8326"],"issn-type":[{"value":"1567-8326","type":"print"}],"subject":[],"published":{"date-parts":[[2007,3]]}}}