16,542 research outputs found

    Simulation of a molecular QCA wire

    Get PDF
    Molecular Quantum Dot Cellular Automata (MQCA) are among the most promising emerging technologies for the expected theoretical operating frequencies (THz), the high device densities and the non-cryogenic working temperature. In this work we simulated a molecular QCA wire, based on a molecule synthesized ad-hoc for this technology. The results discussed are obtained by means of iterative steps of ab-initio calculation

    Quantum Genetics, Quantum Automata and Quantum Computation

    Get PDF
    The concepts of quantum automata and quantum computation are studied in the context of quantum genetics and genetic networks with nonlinear dynamics. In a previous publication (Baianu,1971a) the formal concept of quantum automaton was introduced and its possible implications for genetic and metabolic activities in living cells and organisms were considered. This was followed by a report on quantum and abstract, symbolic computation based on the theory of categories, functors and natural transformations (Baianu,1971b). The notions of topological semigroup, quantum automaton,or quantum computer, were then suggested with a view to their potential applications to the analogous simulation of biological systems, and especially genetic activities and nonlinear dynamics in genetic networks. Further, detailed studies of nonlinear dynamics in genetic networks were carried out in categories of n-valued, Lukasiewicz Logic Algebras that showed significant dissimilarities (Baianu, 1977) from Bolean models of human neural networks (McCullough and Pitts,1945). Molecular models in terms of categories, functors and natural transformations were then formulated for uni-molecular chemical transformations, multi-molecular chemical and biochemical transformations (Baianu, 1983,2004a). Previous applications of computer modeling, classical automata theory, and relational biology to molecular biology, oncogenesis and medicine were extensively reviewed and several important conclusions were reached regarding both the potential and limitations of the computation-assisted modeling of biological systems, and especially complex organisms such as Homo sapiens sapiens(Baianu,1987). Novel approaches to solving the realization problems of Relational Biology models in Complex System Biology are introduced in terms of natural transformations between functors of such molecular categories. Several applications of such natural transformations of functors were then presented to protein biosynthesis, embryogenesis and nuclear transplant experiments. Other possible realizations in Molecular Biology and Relational Biology of Organisms are here suggested in terms of quantum automata models of Quantum Genetics and Interactomics. Future developments of this novel approach are likely to also include: Fuzzy Relations in Biology and Epigenomics, Relational Biology modeling of Complex Immunological and Hormonal regulatory systems, n-categories and Topoi of Lukasiewicz Logic Algebras and Intuitionistic Logic (Heyting) Algebras for modeling nonlinear dynamics and cognitive processes in complex neural networks that are present in the human brain, as well as stochastic modeling of genetic networks in Lukasiewicz Logic Algebras

    COMPUTER SIMULATION AND COMPUTABILITY OF BIOLOGICAL SYSTEMS

    Get PDF
    The ability to simulate a biological organism by employing a computer is related to the ability of the computer to calculate the behavior of such a dynamical system, or the "computability" of the system.* However, the two questions of computability and simulation are not equivalent. Since the question of computability can be given a precise answer in terms of recursive functions, automata theory and dynamical systems, it will be appropriate to consider it first. The more elusive question of adequate simulation of biological systems by a computer will be then addressed and a possible connection between the two answers given will be considered. A conjecture is formulated that suggests the possibility of employing an algebraic-topological, "quantum" computer (Baianu, 1971b) for analogous and symbolic simulations of biological systems that may include chaotic processes that are not, in genral, either recursively or digitally computable. Depending on the biological network being modelled, such as the Human Genome/Cell Interactome or a trillion-cell Cognitive Neural Network system, the appropriate logical structure for such simulations might be either the Quantum MV-Logic (QMV) discussed in recent publications (Chiara, 2004, and references cited therein)or Lukasiewicz Logic Algebras that were shown to be isomorphic to MV-logic algebras (Georgescu et al, 2001)

    Quantum Genetics and Quantum Automata Models of Quantum-Molecular Evolution Involved in the Evolution of Organisms and Species

    Get PDF
    Previous theoretical or general approaches to the problems of Quantum Genetics and Molecular Evolution are considered in this article from the point of view of Quantum Automata Theory first published by the author in 1971 and further developed in several recent articles. The representation of genomes and Interactome networks in categories of many-valued logic LMn –algebras that are naturally transformed during biological evolution, or evolve through interactions with the environment provide a new insight into the mechanisms of molecular evolution, as well as organismal evolution, in terms of sequences of quantum automata. Phenotypic changes are expressed only when certain environmentally-induced quantum-molecular changes are coupled with an internal re-structuring of major submodules of the genome and Interactome networks related to cell cycling and cell growth. Contrary to the commonly held view of `standard’ Darwinist models of evolution, the evolution of organisms and species occurs through coupled multi-molecular transformations induced not only by the environment but actually realized through internal re-organizations of genome and interactome networks. The biological, evolutionary processes involve certain epigenetic transformations that are responsible for phenotypic expression of the genome and Interactome transformations initiated at the quantum-molecular level. It can thus be said that only quantum genetics can provide correct explanations of evolutionary processes that are initiated at the quantum--multi-molecular levels and propagate to the higher levels of organismal and species evolution.

Biological evolution should be therefore regarded as a multi-scale process which is initiated by underlying quantum (coupled) multi-molecular transformations of the genomic and interactomic networks, followed by specific phenotypic transformations at the level of organism and the variable biogroupoids associated with the evolution of species which are essential to the survival of the species. The theoretical framework introduced in this article also paves the way to a Quantitative Biology approach to biological evolution at the quantum-molecular, as well as at the organismal and species levels. This is quite a substantial modification of the 'established’ modern Darwinist, and also of several so-called `molecular evolution’ theories

    Ɓukasiewicz-Moisil Many-Valued Logic Algebra of Highly-Complex Systems

    Get PDF
    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
    • 

    corecore