{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T00:01:26Z","timestamp":1752192086195,"version":"3.41.2"},"reference-count":14,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[1976,9,1]],"date-time":"1976-09-01T00:00:00Z","timestamp":210384000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1976,9,1]],"date-time":"1976-09-01T00:00:00Z","timestamp":210384000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1976,9,1]],"date-time":"1976-09-01T00:00:00Z","timestamp":210384000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[1976,9]]},"DOI":"10.1109\/tit.1976.1055603","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T09:44:54Z","timestamp":1083059094000},"page":"580-586","source":"Crossref","is-referenced-by-count":10,"title":["Theoretical bounds on the complexity of inexact computations"],"prefix":"10.1109","volume":"22","author":[{"given":"J.","family":"Pearl","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1147\/rd.144.0417"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1975.4309400"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1975.18"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055496"},{"journal-title":"A theory of program size formally identical to information theory","year":"1974","author":"chaitin","key":"ref14"},{"journal-title":"Perceptrons","year":"1969","author":"minsky","key":"ref4"},{"journal-title":"The Design and Analysis of Computer Algorithms","year":"1974","author":"aho","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0025-5564(75)90047-4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1973.5408575"},{"key":"ref8","first-page":"142","article-title":"Coding theorems for a discrete source with fidelity criterion","author":"shannon","year":"1959","journal-title":"IRE Nat Convention Record"},{"key":"ref7","first-page":"615","article-title":"Theoretical impediments to artificial intelligence","author":"rabin","year":"1974","journal-title":"Proc IFIP Congress 1974"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/321724.321731"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/321574.321575"},{"journal-title":"Rate Distortion Theory","year":"1971","author":"berger","key":"ref9"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22692\/01055603.pdf?arnumber=1055603","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T23:17:25Z","timestamp":1752103045000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1055603\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,9]]},"references-count":14,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.1976.1055603","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[1976,9]]}}}