Epstein Secrets

. • Imitation Learning: Learning via copying what some other agent is observed to do. • Implication: Often refers to an ImplicationLink between two PredicateNodes, indicating an (extensional, intensional or mixed) logical implication. • Implicit Knowledge Representation: Representation of knowledge via having

FTA00624680 534 A Glossary Sch06. .1. Schmidhuber. Code! machines: Fully Self-referential Optimal Universal Self-improvers. In B. Go- ertzel and C. Pennachin, editors, Artificial General Intelligence, pages 119-226. 2006. SDCCK08a. Steven Schockaert, Martine De Cock. Chris Cornelis, and Etienne E. Kerne.

. • Imitation Learning: Learning via copying what some other agent is observed to do. • Implication: Often refers to an ImplicationLink between two PredicateNodes, indicating an (extensional, intensional or mixed) logical implication. • Implicit Knowledge Representation: Representation of knowledge via having

EFTA00624125 350 A Glossary Sch06. J. Schmidhuber. Godel machines: Ashy Self-referential Optimal Universal Self-improvers. In B. Goertzel and C. Pennachin, editors, Artificial General Intelligence, pages 119-226. 2006. Sch07. Dale Schunk. Theories of Learning: An Educational Perspective. Prentice Hall

er atoms. Grounded- PredicateNodes and GroundedSchemaNodes connect to explicitly represented procedures (sometimes in the Combo language); ungrounded PredicateNodes and SchemaNodes are abstract and, like ConceptNodes, purely characterized by their relationships. Node Probability: Many PLN inference rules rely on

_OVERSIGHT_013265 350 A Glossary Sch06. J. Schmidhuber. Godel machines: Fully Self-referential Optimal Universal Self-improvers. In B. Goertzel and C. Pennachin, editors, Artificial General Intelligence, pages 119-226. 2006. SchO7. Dale Schunk. Theories of Learning: An Educational Perspective. Prentice Hall,