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 78 for “"Turing machine"”.
-
A fault-tolerant Turing machine
The Turing machine is the most studied universal model of computation. This thesis studies the question if there is a Turing machine that can compute reliably even when violations of its transition function occur independently of each other with some small probability. In this thesis, we prove the …
-
Turing machine algorithms and studies in quasi-randomness
… the derandomization of complexity classes using Turing machine simulations. 1. Connections between quasi-randomness and graph spectra. Quasi-random (or pseudo-random) objects are deterministic objects that behave almost like truly random objects. These objects have been widely studied in various …
-
On a Reducibility Concept Among Sets of Infinite Strings Induced by Turing Machine Transducers
Made available in DSpace on 2014-12-11T18:24:11Z (GMT). No. of bitstreams: 1 7500301.pdf: 1963619 bytes, checksum: cf36fe9cedab4965903d68950b525d13 (MD5) Previous issue date: 1974
-
A non-recursive universal Quantum turing machine simulation in SequenceL with a post-selection halting scheme
… models of quantum computation, the circuit and machine models. A SequenceL quantum interpreter is developed to show universality in the circuit model. A universal quantum Turing machine (UQTM) is introduced using non-recursive computational laws of the functional language, SequenceL with no …
-
Extended cognition, dynamics, and algorithms. A turing machine based approach to the study of arithmetical skills
… activities is explicitely recognized in Alan Turing's theory of computation, which is focused on the construction of idealized models of the mechanisms at work in a real cognitive system, namely the one consisting of a man performing calculations with paper and pencil. In the present thesis I …
-
Jogos de tabuleiro modernos e ensino de lógica no ensino médio: um estudo com o Turing Machine
… potencial didático do jogo de tabuleiro moderno Turing Machine para o ensino de lógica no Ensino Médio. Este se desdobra nos seguintes objetivos específicos: estabelecer relações entre o ensino de lógica e o uso de jogos de tabuleiro em situações de ensino; elaborar e aplicar uma sequência …
-
Oracle pointer machines
… the Schönhage-Strassen algorithm requires a Turing machine to perform O(n log(n) log(log(n))) operations. In 1980, Schönhage demonstrated that a Storage Modification Machine (SMM) could significantly reduce the number of operations required to multiply two integers of n bits to O(n). …
-
The power of parallel time
… we address the following question: Are parallel machines always faster than sequential machines? Our approach is to examine the common machine models of sequential computation. For each such machine ${\cal M}$ that runs in time T, we determine whether it is possible to speed up ${\cal M}$ by a …
-
UNIPARSE: a universal parser
… language. The system simulates a Universal Turing Machine and utilizes bounded Breadth-First search and development techniques to evaluate Type O languages.
-
Quantum cryptography
… cryptographic problems. It looks at the quantum turing machine concept, explores why use quantum computers and presents Deutsch's problem which allows one to select from amongst the parallel paths a quantum computer calculates.
-
Quantum cryptography
… cryptographic problems. It looks at the quantum turing machine concept, explores why use quantum computers and presents Deutsch's problem which allows one to select from amongst the parallel paths a quantum computer calculates.
-
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 …
-
Computational complexity of random-access models
… models is considered. These models are the Turing machine and its multidimensional variant, the random access machine (RAM), the tree machine, and the pointer machine. The basic computational properties of the pointer machine are examined in more detail. For example, time and space hierarchy …
-
Operators of Higher Order
… and sets of words, i.e. oracles if we think in a Turing machine model. In addition to the standard oracle access mechanism, we also consider quantifiers ranging over oracles to which access is restricted in a certain way.
-
Implementace pokročilých funkcí pro MIDI zařízení založené na STM32L4
… sekvenceru založeného na Eurorackovém modulu MTM Turing Machine a jednoduchého MIDI looperu. Implementace byla provedena v prostředí Arduino za využití funkcí MIDI knihovny pro C++. Text práce sestává z teoretické části, věnující se využitým prostředím a technologiím včetně samotného MIDI …
Page 1 of 4