{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:29:31Z","timestamp":1750307371570,"version":"3.41.0"},"reference-count":7,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[1973,4,1]],"date-time":"1973-04-01T00:00:00Z","timestamp":102470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[1973,4]]},"abstract":"<jats:p>Greg Chaitin, a frequent past contributor to SIGACT News, has produced a non-technical exposition of some of the concepts and methods in information-theoretic computational complexity, and some of his results, as presented in \"Information Theoretic Limitations of Formal Systems\". Both a revised version of the technical paper (see SIGACT News, December 1971, page 12, for an abstract) and the non-technical exposition should appear in the literature soon. Meanwhile, we excerpt - by permission - some of the philosophical implications which we find interesting. -Ed.<\/jats:p>","DOI":"10.1145\/1811123.1811125","type":"journal-article","created":{"date-parts":[[2010,6,11]],"date-time":"2010-06-11T18:52:51Z","timestamp":1276282371000},"page":"21-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Some philosophical implications of information-theoretic computational complexity"],"prefix":"10.1145","volume":"5","author":[{"given":"G. J.","family":"Chaitin","sequence":"first","affiliation":[{"name":"IBM Argentina"}]}],"member":"320","published-online":{"date-parts":[[1973,4]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_1_1_1","DOI":"10.1016\/S0019-9958(64)90223-2"},{"key":"e_1_2_1_2_1","first-page":"16","article-title":"On the difficulty of computations","author":"Chaitin G. J.","year":"1970","journal-title":"IEEE Transactions on Information Theory"},{"key":"e_1_2_1_3_1","article-title":"Information-theoretic limitations of formal systems","author":"Chaitin G. J.","year":"1971","journal-title":"This paper was read by J. T. Schwartz at the Courant Institute Computational Complexity Symposium, New York"},{"volume-title":"Princeton University Press","year":"1944","author":"von Neumann J.","key":"e_1_2_1_4_1"},{"volume-title":"Yale University Press","year":"1958","author":"von Neumann J.","key":"e_1_2_1_5_1"},{"volume-title":"University of Illinois Press","year":"1966","author":"von Neumann J.","key":"e_1_2_1_6_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_7_1","DOI":"10.1145\/1247047.1247052"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1811123.1811125","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1811123.1811125","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:22:54Z","timestamp":1750245774000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1811123.1811125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1973,4]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1973,4]]}},"alternative-id":["10.1145\/1811123.1811125"],"URL":"https:\/\/doi.org\/10.1145\/1811123.1811125","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[1973,4]]},"assertion":[{"value":"1973-04-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}