PhD Theses

This is an extraction of the CCA Bibliography with PhD theses on topics related to Constructivity, Computability and Complexity in Analysis. 41 references, last updated Sat Feb 14 19:24:44 Europe/Berlin 2009

Georgios Barmpalias. Computability and Applications to Analysis. PhD thesis, University of Leeds, School of Mathematics, Leeds, 2004.
Andrej Bauer. The Realizability Approach to Computable Analysis and Topology. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, 2000.
Jens Blanck. Computability on topological spaces by effective domain representations. PhD thesis, Uppsala University, Department of Mathematics, Uppsala, Sweden, 1997.
Vasco Brattka. Recursive and Computable Operations over Topological Structures. PhD thesis, Fachbereich Informatik, FernUniversität Hagen, 1998.
Manuel Lameiras Campagnolo. Computational Complexity of Real Valued Recursive Functions and Analog Circuits. PhD thesis, Instituto Superior Técnico, Universidade Técnica de Lisboa, Lisbon, 2001.
Thomas Chadzelek. Analytische Maschinen. PhD thesis, Technische Fakultät der Universität des Saarlandes, Saarbrücken, 1998.
Thomas Deil. Darstellungen und Berechenbarkeit reeller Zahlen. PhD thesis, Fachbereich Mathematik und Informatik, FernUniversität Hagen, 1984.
Hans Joachim Dettki. Untersuchungen zur Darstellungsberechenbarkeit von Ordinalzahlfunktionen. PhD thesis, Fachbereich Mathematik und Informatik, FernUniversität Hagen, 1985.
Pietro Di Gianantonio. A Functional Approach to Computability on Real Numbers. Dottorato di ricerca in informatica, Università di Pisa-Genova-Udine, Udine, June 1993.
Martín Hötzel Escardó. PCF extended with real numbers: a domain-theoretic approach to higher-order exact real number computation. PhD thesis, Imperial College, University of London, London, Great Britain, 1997.
Xiaolin Ge. Some Algorithms in Euclidean Space and Group Representations. Thesis, University of Minnesota, Minneapolis, May 1993.
Philipp Gerhardy. Applications of Proof Interpretations. PhD thesis, Department of Computer Science, University of Aarhus, Denmark, Aarhus, 2006.
Guido Gherardi. Some Results in Computable Analysis and Effective Borel Measurability. PhD thesis, University of Siena, Department of Mathematics and Computer Science, Siena, 2006.
Robin Siale Havea. Constructive Spectral and Numerical Range Theory. PhD thesis, Department of Mathematics & Statistics, University of Canterbury, Christchurch, 2001.
Peter Hertling. Unstetigkeitsgrade von Funktionen in der effektiven Analysis. PhD thesis, Fachbereich Informatik, FernUniversität Hagen, 1996.
Mark L. Hogarth. Predictability, Computability, and Spacetime. Phd thesis, University of Cambridge, UK, 2000.
H. James Hoover. Feasible Constructive Analysis. Ph.d. dissertation, Dept. of Computer Science, University of Toronto, Toronto, Canada, 1987.
L. Hudes. Hyperarithmetical real numbers and hyperarithmetical analysis. Ph.d. dissertation, Massachusetts Institute of Technology, Cambridge, Mass., 1962.
Hajime Ishihara. Boundedness, normability and compactness of constructive linear mappings. Dissertation, Tokyo Institute of Technology, Tokyo, mar 1990.
Michal Konecny. Many-Valued Real Functions Computable by Finite Transducers using IFS-Representations. PhD thesis, School of Computer Science, University of Birmingham, Birmingham, 2000.
Christoph Kreitz. Theorie der Darstellungen und ihre Anwendungen in der konstruktiven Analysis. PhD thesis, Fachbereich Mathematik und Informatik, FernUniversität Hagen, 1984.
Branimir Lambov. Topics in the Theory and Practice of Computable Analysis. PhD thesis, Department of Computer Science, University of Aarhus, Denmark, Aarhus, 2005.
Peter Lietz. From Constructive Mathematics to Computable Analysis via the Realizability Interpretation. PhD thesis, Fachbereich Mathematik, TU Darmstadt, Darmstadt, 2004.
Joseph Stephen Miller. Pi-0-1 Classes in Computable Analysis and Topology. PhD thesis, Cornell University, Ithaca, USA, 2002.
Norbert Th. Müller. Untersuchungen zur Komplexität reeller Funktionen. PhD thesis, Fachbereich Mathematik und Informatik, FernUniversität Hagen, 1988.
Milad Niqui. Formalizing Exact Arithmetic -- Representations, Algorithms and Proofs. PhD thesis, Institute for Programming Research and Algorithmics, University of Nijmegen, Nijmegen, 2004.
Paulo Oliva. Proof Mining in Subsystems of Analysis. PhD thesis, Department of Computer Science, University of Aarhus, Denmark, Aarhus, 2003.
Gabriela Popa. A theoretical constructivisation of mathematical economics. PhD thesis, Department of Mathematics & Statistics, University of Canterbury, Christchurch, 2003.
Matthias Schröder. Admissible Representations for Continuous Computations. PhD thesis, Fachbereich Informatik, FernUniversität Hagen, 2002.
Bas Spitters. Constructive and intuitionistic integration theory and functional analysis. PhD thesis, University of Nijmegen, 2002.
Kristian Jon Stewart. Concrete and Abstract Models of Computation over Metric Algebras. PhD thesis, University of Wales Swansea, Singleton Park, Swansea, SA2 8PP, UK, 1999.
Philipp Sünderhauf. Discrete Approximation of Spaces, A Uniform Approach to Topologically Structured Datatypes and their Function Spaces. PhD thesis, Fachbereich Mathematik, Technische Hochschule Darmstadt, Darmstadt, Germany, 1994.
Sebastiaan Augustinus Terwijn. Computability and Measure. PhD thesis, Institute for Logic, Language and Computation, University Amsterdam, 1998.
Konrad R. Theobald. Eine allgemeine Theorie der Stetigkeit und Berechenbarkeit für natürliche Halbordnungen. PhD thesis, Fachbereich Mathematik und Informatik, FernUniversität Hagen, 1984.
W. Veldman. Investigations in Intuitionistic Hierarchy Theory. Ph.d. thesis, Katholieke Universiteit, Nijmegen, Nijmegen, The Netherlands, 1981.
Luminita Simona Vîta. A Constructive Development of Operator Algebra Theory. PhD thesis, Department of Mathematics & Statistics, University of Canterbury, Christchurch, 2000.
Frank Waaldijk. Modern Intuitionistic Topology. PhD thesis, Radboud University Nijmegen, 1996.
Wang Yuchuan. Constructive Analysis of Partial Differential Equations. PhD thesis, Department of Mathematics, University of Waikato, Hamilton, 1997.
Xizhong Zheng. Weak Computability and Semi-Computability in Analysis. PhD thesis, Fachbereich Informatik, FernUniversität Hagen, 1998.
Qing Zhou. Computability on open and closed subsets of Euclidean space. Thesis, University of Minnesota, Minneapolis, 1992.
Martin Ziegler. Zur Berechenbarkeit reeller geometrischer Probleme. PhD thesis, Fachbereich Mathematik/Informatik, Universität Paderborn, Paderborn, 2002.