Epstein Secrets

Looks. Competent Program Evolution. PhD Thesis, Computer Science Department, Wash- ington University, 2006. LRN87. John Laird, Paul Rosenbloom, and Alan Newell. Soar: An architecture for general intelligence. Artificial Intelligence, 33, 1987. L505. J Lisman and N Spruston. Postsynaptic depolarization req

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

hat Is Human-Like General Intelligence? 2.3.3 Newell’s Criteria for a Human Cognitive Architecture Finally, another related perspective is given by Alan Newell’s “functional criteria for a human cognitive architecture” [New90], which require that a humanlike AGI system should: 1. Behave as an (almost) arbit

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

Looks. Competent Program Evolution. PhD Thesis, Computer Science Department, Wash- ington University, 2006. LRN87. John Laird, Paul Rosenbloom, and Alan Newell. Soar: An architecture for general intelligence. Artificial Intelligence, 33, 1987. LS05. J Lisman and N Spruston. Postsynaptic depolarization requi

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