Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 50 for “"Turing machines"”.
-
Turing machines, computers and artificial intelligence
… with current digital equipment. The Church -Turing thesis and the specific properties of Turing machines are examined and some of the philosophical 'in principle' objections, such as the application of Gödel's incompleteness theorem, are discussed. It is argued that the misinterpretation of …
-
Structural properties of one-tape Turing machines.
The model of Turing machines has been studied since its birth in 1936. Researchers have continuously proposed variants of such a model. Upon imposing different constraints, the power of each model varies or even remains the same, accordingly. Some well-known result (for example, the equivalence of …
-
Quantum Turing Machines and Quantum Prover-Verifier Interactions
We present results on quantum Turing machines and on prover-verifier interactions. In our work on quantum Turing machines, we continue the line of research opened by Yao (1993), who proved that quantum Turing machines and quantum circuits are polynomially equivalent computational models: t ≥ n …
-
Turing Machines and Automatic Functions as Models of Computation
… function is automatic if and only if a one-tape Turing machine can compute it in linear time where input and output have to start at the left end of the tape. It is also shown that the same equivalence holds when non-deterministic one-tape Turing machines are considered. This result is extended …
-
Optimality and hierarchical representation in emergent neural Turing machines and their visual navigation
"Traditional Turing Machines (TMs) are symbolic in the sense that representations in these TMs are static and hand-crafted. This paper presents a new kind of TM - emergent neural Turing Machine. By neural, we mean that the control of the TM has neurons as basic computing elements. By emergent, we …
-
Unambiguous Functions in Logarithmic Space
… nondeterminism. In the context of space-bounded Turing Machines, several variants of unambiguity have been proposed and studied, and some interesting results have been established, narrowing slightly the gap between deterministic and nondeterministic logarithmic-space computation.</p> <p> We …
-
Characterising Computational Devices with Logical Systems
… develop the concept of a theory machine. Theory machines describe computation via logical systems, providing an overarching formalism for characterising computational systems such as Turing machines, type-2 machines, quantum computers, infinite time Turing machines, and various physical …
-
Computational Complexity of Hopfield Networks
… of discrete Hopfield network, and simulation of Turing machines by discrete Hopfield Network.
-
Complexity Aspects of Stack Automata
… measures are defined analogously as for Turing machines: space complexity describes how many stack cells are used in a computation, and time complexity describes how many steps a computation takes. We use three different measures of complexity for nondeterministic machines: weak, accept, …
-
Comparing and Evaluating Models of Tile-Assembly Using Intrinsic Simulation
… universality, the ability to simulate arbitrary Turing machines, but also intrinsic universality, a notion borrowed from the study of cellular automata, where one set of tiles is capable of simulating the full dynamics of all others in some class at scale. Unlike the purely symbolic notion of …
-
The size and depth of Boolean circuits
… between simultaneous time and space bounds on Turing machines and Boolean circuit depth. We observe a new connection between planar circuit size and simultaneous time and space products of input-oblivious Turing machines. We use this to prove quadratic lower bounds on the product of time and …
-
A non-recursive universal Quantum turing machine simulation in SequenceL with a post-selection halting scheme
… in the circuit model. A universal quantum Turing machine (UQTM) is introduced using non-recursive computational laws of the functional language, SequenceL with no explicit recursion. The SequenceL UQTM is implemented based on the rules of Bernstein and Vasari’s UQTM. Bernstein and Vasari’s …
-
A calculus for composable, computational cryptography
… computational model underlying UC—interactive Turing machines (ITMs)—by adapting ITMs to a subset of the π-calculus through an affine typing discipline. In other words, well-typed ILC programs are expressible as ITMs. In turn, ILC’s strong confluence property enables reasoning about …
-
An information theoretic approach to the expressiveness of programming languages
… programming model. The programming models are Turing Machines, λ-Calculus, SKI, RASP, RASP2, and RASP3. The information content of the programs and models are measured as characters. They are compared to investigate hypotheses relating to how the mean program size changes as the size of the …
-
Model-checking problems, machines and parameterized complexity
… <br>tractable algorithms of random access machines whose use of <br>nondeterminism is bounded in terms of the parameters. By <br>further tuning the nondeterminism that the random access machines can use, <br>say, allowing alternating, or restricting the access to <br>the guessed numbers, we …
-
Polycommit: Building Better Habits Through Gamification
Computer-assisted learning is older than Turing machines, and constantly evolves as technology improves. While some teachers are resistant to using technology in the classroom, “e-learning” techniques are becoming more common in almost every school, from K-12 to universities. As technology becomes …
-
Universality in algorithmic self-assembly
… is computationally universal, i.e., that any Turing machine can be encoded into a finite set of tile types whose self-assembly simulates that Turing machine. In this thesis, we investigate tile-based self-assembly systems that exhibit Turing universality, geometric universality and intrinsic …
-
Application of two frameworks--Physics and Signal Processing--as a Basis for Efficient Designs in Physical Computing
… Thesis, paralleling the Church-Turing Thesis, which highlights computational equivalences unique to physical systems and underscores that many physical computing phenomena cannot be fully and efficiently replicated by classical digital Turing machines. Drawing on a holographic …
-
REDUCING INFORMATION OVERLOAD VIA AN ANALOG MODEL FOR CYBER RISK
… human reporting or other means. Limitations of Turing machines used as automated sensors, ever-increasing network size and speed of transmission, limited numbers of qualified personnel, and the necessity to work in uncertainty all serve to exacerbate the continual condition of information …
Page 1 of 3