Epstein Secrets

Supercompilation 319 18.3.1 Three Aspects of Supercompilation 321 18.3.2 Supercompilation for Goal-Directed Program Modification 322 18.4 Self-Modification via Theorem-Proving 323 A Glossary 325 A.1 List of Specialized Acronyms 325 A.2 Glossary of Specialized Terms 326 References 343 EFTA006

h to Superhuman AGI 317 18.1 Introduction 317 18.2 Cognitive Schema Learning 318 18.3 Self-Modification via Supercompilation 319 18.3.1 Three Aspects of Supercompilation 321 18.3.2 Supercompilation for Goal-Directed Program Modification 322 18.4 Self-Modification via Theorem-Proving 323 A Glossary 325 A.1

cision graph looks like: Input: List L Output: List If ( P1 (L) ) N1(L) Else If ( P2 (L) ) N2 (L) Else If ( Pk (L) ) Nk(L) EFTA00624098 18.4 Self-Modification via Theorem-Proving 323 where the Pi are predicates, and the Ni are schemata corresponding to other nodes of the decision graph (children of the c

summary. For an accessible overview of the supercompila- tion algorithm, the reader is referred to the article 'What is Supercompilation? Ui 18.3.1 Three Aspects of Supercompilation There are three separate levels to the supercompilation idea: first, a general philosophy; second a translation of this philosophy into a concrete

cts of Supercompilation .............0..00 000022 eee eee ee 321 18.3.2 Supercompilation for Goal-Directed Program Modification............. 322 18.4 Self-Modification via Theorem-Proving ........... 0.00 eee eee eee 323 A Glossary ..... 0.00000 tne teen eee 325 A.1 List of Specialized Acronyms.........0.. 00 0c ce

Cognitive Schema Learning .......... 0.000 e cee eee eens 318 18.3 Self-Modification via Supercompilation ..............0..00 000 cee eee 319 18.3.1 Three Aspects of Supercompilation .............0..00 000022 eee eee ee 321 18.3.2 Supercompilation for Goal-Directed Program Modification............. 322 18.4 Self-Modification via T

nt decision graphs. The decision graph leading to maximal optimization, may not be the one that leads CogPrime cognition in optimal directions. 18.4 Self-Modification via Theorem-Proving Supercompilation is a potentially very valuable tool for self-modification. If one wants to take an existing schema and graduall

ummary. For an accessible overview of the supercompila- tion algorithm, the reader is referred to the article “What is Supercompilation?” [1] 18.3.1 Three Aspects of Supercompilation There are three separate levels to the supercompilation idea: first, a general philosophy; second a translation of this philosophy into a concrete a