Epstein Secrets

ssible to make AGI on digital computers. While we suspect this is correct, we must note that it isn’t proven. It might be that — as Penrose [Pen96], Hameroff [Mam87] and others have argued — we need quantum computers or quantum gravity computers to make AGI. However, there is no evidence of this at this st

sists of the wealthiest nodes and links. Figures 3.3 and 3.4 illustrate the existence and flow of attentional focus in OpenCog. On the other hand, in Hameroff’s recent model of the brain [Ham10], the brain’s moving bubble of attention is achieved through dendro-dendritic connections and the emergent dendrit

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

sts of the wealthiest nodes and links. Figures 3.3 and 3.4 illustrate the existence and flow of attentional focus in OpenCog. On the other hand, in Hameroff's recent model of the brain 'Hamill], the brain's moving bubble of attention is achieved through dendro-dendritic connections and the emergent dendr

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

ulation of the human mind. Development and Learning, International Conf. on, 0, 2002. AGBD+08. Derek Abbott, Julio Gea-Banacloche, Paul C W Davies, Stuart Hameroff, Anton Zeilinger, lens Eisert, Howard M. Wiseman, Sergey M. Bezrukov, and Hans Frauenfelder. Plenary debate: quan- tum effects in biologetrivial or

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

mulation of the human mind. Development and Learning, International Conf. on, 0, 2002. AGBDt08. Derek Abbott, Julio Gea-Banacloche, Paul C W Davies, Stuart Hameroff, Anton Zeilinger, Jens Eisert, Howard M. Wiseman, Sergey M. Bezrukov, and Hans Frauenfelder. Plenary debate: quan- tum effects in biology?trivial or

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