{"responseHeader":{"status":0,"QTime":6,"params":{"q":"{!q.op=AND}id:\"108088\"","hl":"true","hl.simple.post":"","hl.fragsize":"5000","fq":"!embargo_tdt:[NOW TO *]","hl.fl":"ocr_t","hl.method":"unified","wt":"json","hl.simple.pre":""}},"response":{"numFound":1,"start":0,"docs":[{"modified_tdt":"2016-11-18T00:00:00Z","thumb_s":"/dc/75/dc75b188765ca988351141d92f17e94cfd388c9b.jpg","oldid_t":"compsci 16201","setname_s":"ir_computersa","file_s":"/8a/0c/8a0c570edfed9f5b099c05fc3bf3c8a09149ce60.pdf","title_t":"Page 12","ocr_t":"1.2.1 Self-referential Systems Self-referential systems play a prominent role in the scientific heritage of twentieth century. They are the theme of two of the greatest intellectual achievements in this century. The first is the result of Godel [26] which shows that any fixed formal mathematical system is incomplete. A proof of this result involves a mathematical system that can express both propositions and metalevel propositions about the system. Metalevel propositions are propositions about propositions in this system. An extensive discussion of this result can be found in [33, 65]. Although Godel's result is negative, it is encouraging. It demonstrates that any formal system can be improved by adding new axioms to the system and that the ultimate truth in the sense of mathematical systems is impossible. Since computer programs can be viewed as formal systems, Godel's result in the realm of computer system can be loosely interpreted that any sufficiently complex system can be improved indefinitely. A sufficiently complex system is a system that is able of unsupervised learning in an unstructured environment. No such artificial systems exist today. This thesis presents the first step toward building artificial systems capable of unsupervised learning in an unstructured environment. The second result is the \"halting theorem\" by Turing [34, 85]. This result shows that a Turing machine cannot predict whether another Turing machine will halt or not. Since Turing machines are generic representatives of computer programs, it follows from this result that it is impossible to predict the complete behavior of a computer program just by analyzing its static program. A dynamic observation of an executing program thus reveals more about the program's behavior than it is available in its source code. 4","restricted_i":0,"id":108088,"created_tdt":"2016-11-18T00:00:00Z","format_t":"application/pdf","parent_i":108243,"_version_":1642982404902617090}]},"highlighting":{"108088":{"ocr_t":[]}}}