{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:18:55Z","timestamp":1759335535631},"reference-count":10,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO. Inform. th\u00e9or."],"published-print":{"date-parts":[[1983]]},"DOI":"10.1051\/ita\/1983170100491","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T15:39:03Z","timestamp":1486395543000},"page":"49-54","source":"Crossref","is-referenced-by-count":6,"title":["Independent instances for some undecidable problems"],"prefix":"10.1051","volume":"17","author":[{"given":"Cristian","family":"Calude","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gheorghe","family":"P\u0103un","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. DAVIS M., MATIJASEVI\u010c YU. and ROBINSON J., Hilbert's Tenth Problem. Diophantine Equations : Positive Aspects of a Negative Solution, Proc. Symposia Pure Math., vol. 28, 1976, p. 223-378.4325340346.02026","DOI":"10.1090\/pspum\/028.2\/0432534"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. GREIBACH S. and HOPCROFT J., Scattered Context Grammars, J. Comput. Systems Sci., vol. 3, 1969, p. 233-247.2467270174.02801","DOI":"10.1016\/S0022-0000(69)80015-2"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. HARTMANIS J. and HOPCROFT J., Independence Results in Computer Science, ACM SIGACT News, vol. 8, 1976, p. 13-24.","DOI":"10.1145\/1008335.1008336"},{"key":"R4","unstructured":"4. MATIJASEVIC Yu., Enumerable Sets Are Diophantine. Dokl. Akad. Nauk SSSR, vol. 191, 1970, p. 279-282.2587440212.33401"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. MAURER H. A., Simple Matrix Languages with a Leftmost Restriction, Inform. Control, vol., 23, 1973, p. 128-139.3888680261.68037","DOI":"10.1016\/S0019-9958(73)90627-X"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. PARIS J. and HARRINGTON L., A Mathematical Incompleteness in Peano Arithmetic, in J. Barwise (ed.), Handbook of Mathematical Logic, North-Holland, Amsterdam, 1977, p. 1133-1142.457132","DOI":"10.1016\/S0049-237X(08)71130-3"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. POST E., A Variant of a Recursively Unsolvable Problem, Bull. AMS, vol. 52, 1946, p. 264-268.153430063.06329","DOI":"10.1090\/S0002-9904-1946-08555-9"},{"key":"R8","unstructured":"8. ROGERS H. Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.2244620183.01401"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"9. ROSENKRANTZ D., Programmed Grammars and Classes of Formal Languages, J. of ACM, vol. 16, 1969, p. 107-131.2359400182.02004","DOI":"10.1145\/321495.321504"},{"key":"R10","unstructured":"10. SALOMAA A., Formal Languages, Academic Press, New York, London, 1973.4387550262.68025"}],"container-title":["RAIRO. Informatique th\u00e9orique"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1983170100491\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T09:34:54Z","timestamp":1568799294000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1983170100491"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":10,"journal-issue":{"issue":"1"},"alternative-id":["ita1983170100491"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1983170100491","relation":{},"ISSN":["0399-0540"],"issn-type":[{"value":"0399-0540","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}