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 8 of 8 for “"computable analysis"”.
-
Universal envelopes of discontinuous functions
This thesis is a contribution to computable analysis in the tradition of Grzegorczyk, Lacombe, and Weihrauch. The main theorem of computable analysis asserts that any computable function is continuous. The solution operators for many interesting problems encountered in practice turn out to be …
-
Computability of Function Spaces from Harmonic Analysis
In computer science and mathematics, a computable function is one for which a computer program exists and can give its values in finite time. We explore notions of computability for function spaces such as the Hardy space H^1(R) and the Besov space B^p(T) from harmonic analysis. After a …
-
Fractals in complexity and geometry
… geometry, we will discuss some new results in computable analysis, which will include an effective extension of the famous analyst's Traveling Salesman Theorem from geometric measure theory and the existence of a wicked simple curve that forces a computer to retrace. These results are not …
-
Computability and Structure
… 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 in hand is divided into two parts. Part I …
-
Computational Complexity in Analysis and Geometry
Computable analysis studies problems involving real numbers, sets and functions from the viewpoint of computability. Elements of uncountable sets (such as real numbers) are represented through approximation and processed by Turing machines. However, application of this approach to computational …
-
Computing, modelling, and scientific practice: foundational analyses and limitations
… rather, there are two incompatible approaches --computable analysis and BSS model--, both claiming to formalise algorithmic computation and to oer foundations for scientific computing. The dissertation consists of three parts. In the first part, we examine what notion of ‘algorithmic computation’ …
-
Existence, Continuity, and Computability of Unique Fixed Points in Analog Network Models
<p>The thesis consists of three research projects concerning mathematical models for analog computers, originally developed by John Tucker and Jeff Zucker. The models are capable of representing systems that essentially “diverge,” exhibiting no valid behaviour---much the way that digital computers …