A boolean net as an adaptive and universal robot control

We consider a McCulloch and Pitts, also called Boolean, net in the Caianiello formalism, as a set of “node assemblies”, to implement an Hebbian rule [1]. So we obtain a system learning, by examples, how to control a robot in the execution of task sequences, without any limitation on their length.