Turing Machine
Mostrando 1-12 de 12 artigos, teses e dissertações.
-
1. Teorias da Aleatoriedade
Este trabalho apresenta uma revisão bibliográfica sobre a definição de “seqüência aleatória”. Nós enfatizamos a definição de Martin-Löf e a definição baseada em incompressividade (complexidade de Kolmogorov). Complexidade de Kolmogorov é uma teoria sofisticada e profunda da informação e da aleatoriedade baseada na máquina de Turing. Esta
Publicado em: 2010
-
2. Gramáticas de formas como modelo computacional teórico : o poder computacional de gramáticas de formas comparado a outros modelos computacionais teóricos, como máquina de Turing e gramática generativa de Chomsky
Gramáticas de formas têm sido as principais ferramentas para o estudo envolvendo linguagens de design, permitindo os processos de análise e de síntese sobre elementos de desenho, servindo em última instância para a concepção e manipulação de estilos estéticos específicos. Comparado a outros modelos generativos, especialmente os simbólicos como a
Publicado em: 2010
-
3. 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
-
4. Context-free adaptive grammars with appearance checking. / Gramáticas livres de contexto adaptativas com verificação de aparência.
This work introduces and describes the formalism of the context-free adaptive grammar with appearance checking. Such gramatical devices have as its kernel a subjacent context-free grammar and, as mechanism of self-modification, one or several adaptive functions which determines the productions able to be applied at each step of a derivation. The appearance c
Publicado em: 2004
-
5. A CONTRIBUTION TO THE STUDY OF UNIVERSAL CELLULAR SPACES - A CONTEXT-FREE LANGUAGE ACCEPTOR APPLICATION / CONTRIBUIÇÃO AO ESTUDO DE ESPAÇOS CELULARES UNIVERSAIS APLICAÇÃO EM RECONHECEDORES DE LINGUAGENS DE CONTEXTOS LIVRES
This work presents a study of Universal Computation- Construction Cellular Spaces. To proove the universality of a especific cellular space we develop a design of a Universal Computer-Contructor (UCC) realizable in that space. By UCC we mean a machine able to compute any Turing computable function, as well as able to construct any other machine constructable
Publicado em: 1974
-
6. Limit, logic, and computation
We introduce “ultrafilter limits” into the classical Turing model of computation and develop a paradigm for interpreting the problem of distinguishing the class P from NP as a logical problem of decidability. We use P(NP) to denote decision problems which can be solved on a (nondeterministic) Turing machine in polynomial time. The concept is that in an a
The National Academy of Sciences.
-
7. A dynamical systems perspective on the relationship between symbolic and non-symbolic computation
It has been claimed that connectionist (artificial neural network) models of language processing, which do not appear to employ “rules”, are doing something different in kind from classical symbol processing models, which treat “rules” as atoms (e.g., McClelland and Patterson in Trends Cogn Sci 6(11):465–472, 2002). This claim is hard to assess in
Springer Netherlands.
-
8. Protein–DNA computation by stochastic assembly cascade
The assembly of RecA on single-stranded DNA is measured and interpreted as a stochastic finite-state machine that is able to discriminate fine differences between sequences, a basic computational operation. RecA filaments efficiently scan DNA sequence through a cascade of random nucleation and disassembly events that is mechanistically similar to the dynamic
The National Academy of Sciences.
-
9. 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
-
10. 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
-
11. P/NP, and the quantum field computer
The central problem in computer science is the conjecture that two complexity classes, P (polynomial time) and NP (nondeterministic polynomial time—roughly those decision problems for which a proposed solution can be checked in polynomial time), are distinct in the standard Turing model of computation: P ≠ NP. As a generality, we propose that each physic
National Academy of Sciences.
-
12. Demonstration of a universal surface DNA computer
A fundamental concept in computer science is that of the universal Turing machine, which is an abstract definition of a general purpose computer. A general purpose (universal) computer is defined as one which can compute anything that is computable. It has been shown that any computer which is able to simulate Boolean logic circuits of any complexity is such
Oxford University Press.