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 35 for “"Computability"”.
-
Computability and Structure
This dissertation contains results in the area of constructive mathematics with emphasis to computable algebra and computable analysis. Mal'cev [66] and Rabin [86] initiated the study of computable groups, and Turing [96, 95] started the investigation of effective procedures in analysis. The thesis …
-
Computability and Fractal Dimension
This thesis combines computability theory and various notions of fractal dimension, mainly Hausdorff dimension. An algorithmic approach to Hausdorff measures makes it possible to define the Hausdorff dimension of individual points instead of sets in a metric space. This idea was first realized by …
-
Partition Theorems and Computability Theory
"We also study Ramsey degrees, i.e. those Turing degrees which are able to compute homogeneous sets for every computable 2-coloring of pairs of natural numbers, in an attempt to further understand the effective content of Ramsey's Theorem for exponent 2. We establish some new results about these …
-
ON THE FOUNDATIONS OF COMPUTABILITY THEORY
… deficiencies in the foundations of conventional computability theory. This thesis examines the problems with conventional computability theory, including its failure to address discrepancies between theory and practice in computer science, semantic confusion in terminology, and limitations in the …
-
Computability, inference and modeling in probabilistic programming
We investigate the class of computable probability distributions and explore the fundamental limitations of using this class to describe and compute conditional distributions. In addition to proving the existence of noncomputable conditional distributions, and thus ruling out the possibility of …
-
An analysis of the computability of horse races
Thesis (B.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1985.
-
Fair division of indivisibles: on the computability of maximin share (MMS) allocations
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-15 without embargo terms
-
Computability of rational points on curves over function fields in characteristic p
The motivating problem of this thesis is that of explicitly computing the K-rational points of a regular nonsmooth curve X over a αnitely generated αeld K of characteristic p. We start with an in-depth study of such curves in general and the tools exclusive to characteristic p geometry needed to …
-
Modeling Optimal Information Acquisition Time Driven by Event Importance for Decision Making: Integrating Gödel's Incompleteness, Turing's Computability, and Simon's Bounded Rationality
Στο πλαίσιο της λήψης αποφάσεων υπό συνθήκες αβεβαιότητας, η διαδικασία απόκτησης πληροφορίας διαδραματίζει κρίσιμο ρόλο στη βελτιστοποίηση των αποτελεσμάτων. Η παρούσα διπλωματική εργασία διερευνά τον βέλτιστο χρονισμό της απόκτησης πληροφορίας, ιδιαίτερα σε σενάρια όπου η σημαντικότητα των …
-
Taming the impossible
… from counterpossibles as they appear in relative computability theory. I show that relative computability theorists crucially invoke counterpossibles when they define the central notions of their theory. I also provide a model theory for a quantified language that can express such …
-
The Dehn function, word problem, and bounded word problem for finitely generated decidable group presentations
… of the bounded word problem, and computability/uncomputability of the Dehn function.
-
On the Foundations of Computation and Sampling for Reconstruction and Approximation
… To ensure this we investigate the foundations of computability and the numerical behaviour of the following methods. These are the linear reconstruction methods: generalized sampling and the parametrized background data weak (PBDW)-method. Moreover, we also analyse their non-linear cousin …
-
Decision Problems in the Lattice of P01 Classes
Given an (undecidable) elementary theory of a computability-theoretic structure, it is natural to ask how much of the theory is decidable. An AE-sentence is a sentence in prenex normal form with all universal quantifiers preceding all existential quantifiers, and the AE-theory of a structure is the …
-
Turing Decidability and Computational Complexity of MorseHomology
… by Robin Forman, as well as an introduction to computability and computational complexity. Since general point-set data equipped with a smooth structure can admit a triangulation, discrete Morse theory finds numerous applications in data analysis which can range from traffic control to …
-
Universal domains for sequential computation
… In my thesis, I develop a theory of higher order computability based on a new formulation of domain theory. This new formulation interprets elements of any data domain as lazy trees. Like classical domain theory, it provides a universal domain T and a universal language KL. A rich class of domains …
-
Quantifying Information Flow with Constraints
… mutual information, conditional entropy, etc. Computability entails that any automated analysis of information is necessarily incomplete. Thus quantitative flow of analyses aim to compute upper bounds on the sizes of the flows in a program. Virtually all the current quantitative analyses treat …
-
Defending distributed systems against adversarial attacks: consensus, consensus-based learning, and statistical learning
… the influence of communication range on the computability of reaching iterative approximate consensus. Particularly, we characterize the tight topological condition on the networks for consensus to be achievable in the presence of Byzantine components. Our results bridge the gap of previous …
-
SPARSE RECOVERY BY NONCONVEX LIPSHITZIAN MAPPINGS
… of Banach spaces, harmonic analysis, theory of computability, and information-based complexity. Together with theoretical and practical advancements, also several numeric methods and algorithmic techniques have been developed in order to capture the complexity and the wide scope that the theory …
-
Applied stochastic eigen-analysis
… sequence is shown to act as a certificate of the computability of the limiting eigenvalue distribution and, for a subclass, the limiting conditional “eigenvector distribution.” The limiting moments of algebraic random matrix sequences, when they exist, are shown to satisfy a finite depth linear …
-
Automated Care Pathway Modeling Using Agentic and Knowledge-Aware LLMs
… control-flow semantics needed for clarity and computability. Formalizing CPWs as process models - e.g., in the Business Process Model and Notation (BPMN) - improves comprehensibility and enables downstream automation. This thesis designs, implements, and evaluates LLM4CPW, a pipeline for …
Page 1 of 2