Not to argue with Matt's well-founded main point with this pedantic nit:
Any deterministic dynamical system can be simulated to an arbitrary degree of precision with a finite directed *cyclic* NOR (or NAND) graph. There was even some guy at the second IJCNN in San Diego (1990) with a "trainable" *acyclic* graph generator that was attempting to grow combinatorial logic. IIRC he even had some "pruning" capability. (Probably a lot of people have barked up that tree over the decades -- I haven't been keeping track since then.) ------------------------------------------ Artificial General Intelligence List: AGI Permalink: https://agi.topicbox.com/groups/agi/T77af318d4abfa8a8-Mab9c69dcd29898496f4d432f Delivery options: https://agi.topicbox.com/groups/agi/subscription
