Turing Machines
Mostrando 1-6 de 6 artigos, teses e dissertações.
-
1. Linguagens de domínio específico e sensores baseados em modelos biológicos de computação
A Domain Specific Language is a specification language dedicated to a particular domain, representation technique, or solution searching method. On the other hand, a general-purpose programming language is a language designed with the goal of emulating Lambda Calculus or Turing Machine. Since general-purpose languages must accept any algorithm that can be ex
Publicado em: 2010
-
2. Paraconsisted computation : a logic approach to quantum / Computação paraconsistente : uma abordagem logica a computação quantica
This work provides evidences to view computational complexity as logic-relative, by introducing new models of computation through non-classical logics and by studying their features with respect to computational expressivity and efficiency. From this point of view, we suggest a new way to study the efficiency of quantum computational models consisting in the
Publicado em: 2009
-
3. Da computação paraconsistente a computação quantica
As diferentes interpretações da mecânica quântica levanta sérios problemas filosóficos a respeito da natureza do mundo físico e do estatuto das teorias físicas. Tais interpretações desempenham um papel importante na compreensão dos modelos de computação quântica, e por sua vez os modelos de computação quântica abrem a possibilidade de se con
Publicado em: 2006
-
4. Chemical implementation of finite-state machines.
With methods developed in a prior article on the chemical kinetic implementation of a McCulloch-Pitts neuron, connections among neurons, logic gates, and a clocking mechanism, we construct examples of clocked finite-state machines. These machines include a binary decoder, a binary adder, and a stack memory. An example of the operation of the binary adder is
-
5. Chemical implementation of neural networks and Turing machines.
We propose a reversible reaction mechanism with a single stationary state in which certain concentrations assume either high or low values dependent on the concentration of a catalyst. The properties of this mechanism are those of a McCulloch-Pitts neuron. We suggest a mechanism of interneuronal connections in which the stationary state of a chemical neuron
-
6. Computational functions in biochemical reaction networks.
In prior work we demonstrated the implementation of logic gates, sequential computers (universal Turing machines), and parallel computers by means of the kinetics of chemical reaction mechanisms. In the present article we develop this subject further by first investigating the computational properties of several enzymatic (single and multiple) reaction mecha