Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Introduction to Non-standard Computation

In studies of the solvent effect in non-aqueous solutions, electronic excitation (U V and visible) spectroscopy is most frequently used as a method for measuring equilibrium. The utilization of this methodology is not limited by solvent exchange. The potentiometric and other electroanalytical procedures used most often for the study of complex equilibria in aqueous solutions cannot be employed (or to only a very limited extent) for the determination of the compositions and/or stabilities of complexes in aprotic systems and systems with low relative permittivities. The results obtained by their means in the various solutions cannot always be compared, as they refer to different standard states. Spectrophotometric equilibrium measurements are not influenced by the dielectric properties of the solution or by the protic or aprotic nature of the solvent. All processes which are accompanied by a change in the light absorption of the system (whatever the solvent may be in which the process takes place) may be studied with the aid of this method. Since the introduction of computers for the evaluation of complex equilibrium measure-... [Pg.107]

Cook s theorem (cf. [10]) states that any NP-problem can be converted to the satisfiability problem in CPL in poljmomial time. The proof shows, in a constructive way, how to translate a Turing machine into a set of CPL formulas in such a way that the machine outputs T if, and only if, the formulas are consistent. As mentioned in the introduction, a model of paraconsistent Turing machines presented in [1] was proved to solve Deutsch-Jozsa problem in an efficient way. We conjecture that a similar result as Cook s theorem can be proven to paraconsistent Turing machines. In this way, paraconsistent circuits could be shown to efficiently solve Deutsch-Jozsa problem. Consequences of this approach would be the definition of non-standard complexity classes relative to such unconventional models of computation founded over non-classical logics. [Pg.39]


See other pages where Introduction to Non-standard Computation is mentioned: [Pg.2]    [Pg.3]    [Pg.5]    [Pg.7]    [Pg.9]    [Pg.11]    [Pg.13]    [Pg.2]    [Pg.3]    [Pg.5]    [Pg.7]    [Pg.9]    [Pg.11]    [Pg.13]    [Pg.104]    [Pg.106]    [Pg.650]    [Pg.152]    [Pg.86]    [Pg.42]    [Pg.80]    [Pg.136]    [Pg.46]    [Pg.37]   


SEARCH



Standard computation

© 2024 chempedia.info