"7751","Łukasiewicz-Moisil Many-Valued Logic Algebra of Highly-Complex Systems","A novel approach to self-organizing, highly-complex systems (HCS), such as living organisms and artificial intelligent systems (AIs), is presented which is relevant to Cognition, Medical Bioinformatics and Computational Neuroscience. Quantum Automata (QAs) were defined in our previous work as generalized, probabilistic automata with quantum state spaces (Baianu, 1971). Their next-state functions operate through transitions between quantum states defined by the quantum equations of motion in the Schroedinger representation, with both initial and boundary conditions in space-time. Such quantum automata operate with a quantum logic, or Q-logic, significantly different from either Boolean or Łukasiewicz many-valued logic. A new theorem is proposed which states that the category of quantum automata and automata--homomorphisms has both limits and colimits. Therefore, both categories of quantum automata and classical automata (sequential machines) are bicomplete. A second new theorem establishes that the standard automata category is a subcategory of the quantum automata category. The quantum automata category has a faithful representation in the category of Generalized (M,R)--Systems which are open, dynamic biosystem networks with defined biological relations that represent physiological functions of primordial organisms, single cells and higher organisms.","http://cogprints.org/7751/","Baianu, Professor I.C. and Georgescu, Professor George and Glazebrook, Professor James F.","Iantovics, Dr. Barna"," Baianu, Professor I.C. and Georgescu, Professor George and Glazebrook, Professor James F. (2010) Łukasiewicz-Moisil Many-Valued Logic Algebra of Highly-Complex Systems. [Journal (Paginated)] ","ibaianu@illinois.edu,georgescu@funinf.cs.unibuc.ro,jfglazebrook@eiu.edu","2010-07-12"