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 23 for “"Theory of Computation"”.
-
Applications of the theory of computation to nanoscale self-assembly
<p>This thesis applies the theory of computing to the theory of nanoscale self-assembly, to explore the ability -- and under certain conditions, the inability -- of molecules to automatically arrange themselves in computationally sophisticated ways. In particular, we investigate a model of …
-
Issues of control and causation in quantum information theory
<p>Issues of control and causation are central to the Quantum Theory of Computation. Yet there is no place for them in fundamental laws of Physics when expressed in the prevailing conception, i.e., in terms of initial conditions and laws of motion.</p> <p>This thesis aims at arguing that …
-
Classical and Quantum Computation in Ground States and Beyond
… quantum spin systems with applications to the theory of computation. In particular, we examine computational aspects of these systems beyond their ground states by considering the effects of non-zero temperatures and excited energy states. In the first part we show that universal classical …
-
WhileCC-approximability and Acceptability of Elementary Functions
In this thesis, we study models of computation for partial functions on the reals. Existing work [Fu and Zucker, 2014, Tucker and Zucker, 1999, 2004] studies classes of computable partial functions on R, namely • GL-computability, • tracking computability, • multipolynomial approximability, and • …
-
Extended cognition, dynamics, and algorithms. A turing machine based approach to the study of arithmetical skills
The fields of philosophy of mind and cognitive science have been characterized, in the last few decades, by a growing interest for explanations of mind's activity in terms of interaction between brains, bodies and the world. Embodiment, embeddedness, situatededness are key words that most often can …
-
Random Variable Spaces: Mathematical Properties and an Extension to Programming Computable Functions
This dissertation aims to extend the boundaries of Programming Computable Functions (PCF) by introducing a novel collection of categories referred to as Random Variable Spaces. Originating as a generalization of Quasi-Borel Spaces, Random Variable Spaces are rigorously defined as categories where …
-
Efficient Bounded Timestamping from Standard Synchronization Primitives
Timestamping systems are at the core of many solutions to fundamental problems in distributed algorithms [2, 4, 11, 13, 15, 22, 25, 27], and are well-studied. These systems allow processes to determine the temporal ordering of events by assigning a timestamp to each event and defining an ordering …
-
CRYPTOGRAPHY FROM CONSENSUS TO THE COSMOS
… in two parts. First, we re-visit the foundations of consensus protocols, arguing that despite 50 years of research, there is room to make them simpler, more secure, and more efficient. As a pillar of distributed systems, consensus algorithms power everything from distributed databases to …
-
The subject in the big data era: reading fictions of algorithmic manipulation
… explores fiction’s response to the question of how the contemporary internet is reshaping subjectivity. Through case studies on Joshua Cohen’s Book of Numbers (2015), Nicola Barker’s H(A)PPY (2017), David Foster Wallace’s The Pale King (2011), and Neal Stephenson’s Fall; or, Dodge in Hell …
-
Deflating Representation: Computation, Structure, and Content
The present work focuses on the notions of representation and computation, and the explanatory role they play in the cognitive sciences. I put forward a deflationary view of representational content, and argue that explanatory internal states in the cognitive sciences are primarily individuated by …
-
Amidakuji: Gray Code Algorithms for Listing Ladder Lotteries
… ladders differ by the addition/removal of a single bar or the relocation of a bar. Ladder lotteries are an abstract mathematical object which correspond to permutations. They are a network of vertical lines and horizontal bars, which induce transpositions on elements in a specific …
-
Properties of difference inclusions with computable reachable set
… if a dynamical system describes the motion of a drone, it is important to know if the drone can reach a desired location; the dual problem of safety is also important: if an area is unsafe, it is important to know that the drone cannot reach the unsafe area. These types of problems fall …
-
A Kleene Theorem and Decision Problems for Probability and Angelic Nondeterminism
… to reason about the capabilities and limitations of a specific com-puting model or programming language, a formal system that can model the behavior of a computational device is required. Once such a correspondence is established, we have access to tools to reason about the performed computation …
-
Infinite and standard computation with unconventional and quantum methods using automata
… in this dissertation falls into the field of the Theoretical Computer Science. It mainly concerns the use of “Unconventional” methods of computing, such as membrane and quantum automata. This dissertation concerns elements from automata theory. Automata theory is a subfield of the …
-
A Theory for Comparing Robot Systems
… to be useful, they must act effectively in spite of uncertainty about the current state. This reality motivates a careful study of the information requirements of the problems we intend to solve. What sensing and actuation abilities are needed to complete a given task? Are some robot systems …
-
Efficient and Precise Pointer Analysis with Fine-Grained Context Sensitivity
… in the program. It underpins almost all forms of other static analysis, including program understanding, program verification, bug detection, security analysis, compiler optimization, and symbolic execution. However, existing pointer analysis techniques suffer from efficiency and scalability …
-
AUTOMATIC REGISTER MACHINE: A COMPUTATION MODEL WITH AUTOMATIC FUNCTIONS AND RELATIONS AS ITS OPERATIONS
We propose a new model of computation incorporating automatic functions and relations as primitive operations, called Automatic Register Machine. We show that the model is able to generalize register machine operations without giving an unrealistic speed up, thus it is comparable to fairer …
-
Problems Related to Shortest Strings in Formal Languages
In formal language theory, studying shortest strings in languages, and variations thereof, can be useful since these strings can serve as small witnesses for properties of the languages, and can also provide bounds for other problems involving languages. For example, the length of the shortest …
Page 1 of 2