{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:42:01Z","timestamp":1725518521760},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540859574"},{"type":"electronic","value":"9783540859581"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85958-1_1","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T03:26:13Z","timestamp":1221881173000},"page":"1-20","source":"Crossref","is-referenced-by-count":0,"title":["Back to the Complexity of Universal Programs"],"prefix":"10.1007","author":[{"given":"Alain","family":"Colmerauer","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Bleuzen, N., Colmerauer, A.: Optimal Narrowing of a Block of Sortings in Optimal time. Constaints\u00a05(1-2), 85\u2013118 (2000), \n http:\/\/alain.colmerauer.free.fr","DOI":"10.1023\/A:1009870418160"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Colmerauer, A.: An Introduction to Prolog III. Communications of the ACM\u00a033(7), 68\u201390 (1990), \n http:\/\/alain.colmerauer.free.fr","DOI":"10.1145\/79204.79210"},{"key":"1_CR3","unstructured":"Colmerauer, A.: Prolog IV (1995), \n http:\/\/alain.colmerauer.free.fr"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Colmerauer, A.: On the complexity of universal programs. In: Machine, Computations and Universality (Saint-Petersburg 2004). LNCS, pp. 18\u201335 (2005), \n http:\/\/alain.colmerauer.free.fr","DOI":"10.1007\/978-3-540-31834-7_2"},{"volume-title":"shape Computations: Finite and Infinite Machines","year":"1967","author":"M. Minsky","key":"1_CR5","unstructured":"Minsky, M.: shape Computations: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)"},{"volume-title":"Theory of Recursive Functions and Effective Computability","year":"1967","author":"H. Rogers","key":"1_CR6","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967); fifth printing. MIT Press (2002)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Rogozin, Y.: Small universal Turing machines. Theoretical Computer Science\u00a0168(2) (November 1996)","DOI":"10.1016\/S0304-3975(96)00077-1"},{"key":"1_CR8","unstructured":"Sipser, M.: Introduction to the Theory of Computation. PWS Publishing Company (1997)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85958-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T07:03:15Z","timestamp":1715238195000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85958-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540859574","9783540859581"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85958-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}