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 4 of 4 for “"uncomputability"”.
-
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.
-
Abstract state machines: verification problems and computational power
… rather directly to undecidability respectively uncomputability results in the unrestricted case. Consequently, we arrive rather early at the question whether there exist expressive classes of ASMs for which we can prove decidability and computability results. In the first part of this thesis, we …
-
Methods for Constructing and Exploiting Information Measures for Neural Networks
… While practical results are elusive due to the uncomputability of Kolmogorov complexity, recent work on subjects such as simplicity bias and generalization in deep neural networks have brought algorithmic information theory back into the applied spotlight. We present our paper on regularising …
-
ON THE FOUNDATIONS OF COMPUTABILITY THEORY
The principal motivation for this work is the observation that there are significant 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 …