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 6 of 6 for “"Computability Theory"”.
-
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 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 …
-
Taming the impossible
… have proved to be obstacles to a satisfactory theory of conditionals. In my dissertation, which consists of two parts, I propose a new approach to the impossible that yields an improved theory of conditionals. A prominent response to the semantic paradoxes is glut theory. Glut theorists avoid …
-
On instabilities and trust in deep learning
… LLMs and neural networks, through the lens of computability theory and stability analysis. Chapter 1 provides relevant background material, outlining the motivation, objectives, and contributions of the research. The chapter introduces the key concepts of randomness, stability, and uncertainty …
-
Computable Model Theory on Loops
… We then give an overview of comptability theory, and apply it to loops and groups. We conclude by showing that a finitely presented residually finite algebra has a solvable word problem.</p>