Epstein Secrets

for Computational Linguistics. Mih07. Rada Nlihalcea. Wand sense disambiguation. Encyclopedia of Machine Learning. Springer-Verlag, 2007. Min88. Marvin Minsky. The Society of Mind. MIT Press, 1988. Mit96. Steven !Althorn The Prehistory of Mind. Thames and Hudson, 1996. MS99. Christopher Manning and Hein

r the latter are learned via MOSES or via some other means. The textual realization of Combo resembles LISP with less syntactic sugar. Internally a Combo program is represented as a program tree. • Composer: In the PLN design, a rule is denoted a composer if it needs premises for generating its conse

ve its fingers to pick up a cup, coordinating its movements with its visual perceptions. It's certainly possible to represent this sort of thing in Combo, but Combo may be an awkward tool. However, if one represents low-level procedures like this using another method, e.g. learned cell assemblies in a

the question of programs in what programming language, and in this context we have made a fairly traditional choice, using a special language called Combo that is essentially a minor variant of LISP, and supplying Combo with a set of customized primitives intended to reduce the length of the typical p

g of how CogPrime is intended to function, and a detailed understanding of the OCF is necessary for doing concrete implementation work on CogPrime. Marvin Minsky, in a personal conversation with one of the authors (Goertzel), once expressed the opinion that a human-level general intelligence could probably be

its own hardware and software infrastructure. CogPrime represents procedures as programs in an internal programming language called "Combo." While Combo has a textual representation, described online at the OpenCog wiki, this isn't one of its more important aspects (and may be redesigned slightly or

an internal node of a program, can also live in its own Atom. For example. a number in a program tree corresponds to a NmnberNode; an argument in a Combo program already corresponds to some Atom; and an operator in a program can be wrapped up in a Schemallode all its own, and considered as a one-leaf

r qualitative differences. It's true that an individual human mind may be viewed as a collective, both from a theory-of- cognition perspective (e.g. Minsky's "society of mind" theory IMM88I) and from a personality- psychology perspective (e.g. the theory of subpersonalities Illow901). And it's true that

uesses produced by pure procedure learning methods), it may still be valuable to have this procedure in compact and rapidly executable form such as Combo provides. To proceed with the technical description of predicate schematization in CogPrime. we first need the notion of an "executable predicate".

tand: all else equal, a predicate embodied in a small Combo tree is better than a predicate embodied in a big one. There is some work hidden here in Combo tree reduction; ideally, one would like to find the smallest representation of a given Combo tree, but this is a computationally formidable problem

McKibben. Enough: Staying Human in an Engineered Age. Saint Martins Griffin. 2003. Met04. Thomas Nfetzinger. Being No One. Bradford, 2004. Min88. Marvin Minsky. The Society of Mind. MIT Press. 1988. Min07. Marvin Minsky. The Emotion Machine. 2007. MK07. Joseph Modayil and Benjamin Kuipers. Autonomous dev

r the latter are learned via MOSES or via some other means. The textual realization of Combo resembles LISP with less syntactic sugar. Internally a Combo program is represented as a program tree. • Composer: In the PLN design, a rule is denoted a composer if it needs premises for generating its conse

p the rules might profitably be ported into the Atomspace as ImplicationLinks. • Representation Building: A stage within MOSES, wherein a candidate Combo program tree (within a deme) is modified by replacing one or more tree nodes with alternative tree nodes, thus obtaining a new, different candidate

. Bill McKibben. Enough: Staying Human in an Engineered Age. Saint Martins Griffin, 2003. et04. Thomas Metzinger. Being No One. Bradford, 2004. in88. Marvin Minsky. The Society of Mind. MIT Press, 1988. inO7. Marvin Minsky. The Emotion Machine. 2007. KO7. Joseph Modayil and Benjamin Kuipers. Autonomous developme

d up the rules might profitably be ported into the Atomspace as ImplicationLinks. Representation Building: A stage within MOSES, wherein a candidate Combo program tree (within a deme) is modified by replacing one or more tree nodes with alternative tree nodes, thus obtaining a new, different candidate p

her the latter are learned via MOSES or via some other means. The textual realization of Combo resembles LISP with less syntactic sugar. Internally a Combo program is represented as a program tree. e Composer: In the PLN design, a rule is denoted a composer if it needs premises for generating its conseq