Theory of Computation
My research in the area of Theoretical Computer Science at the Open University of Hagen in the 1980s focused on the theoretical investigation of the computability and computational complexity of operations on non-countable domains such as real numbers of function spaces. The underlying Type-2 computability model was based on a variation of Oracle-Turing machines, while representations (an extension of the concept of numberings) were used to transfer computability concepts to arbitrary domains.
Most of my publications in the area of Theoretical Computer Science were written with a typewriter and are not available online. However, an abstract with a complete reference and corresponding bibtex entry is provided and I can send you a hard copy if you send an e-mail to . Note that my Master Thesis (Diplomarbeit) and PhD Thesis were written in German.     A list of related web pages is given to simplify cross references.

BACK
Back to main page
Related Sites
Systems Research Groups People Conferences / Journals Misc.







CU CS Theory
CU Mathematics
FernUni Hagen, Theory
TUD Mathematics




Klaus Weihrauch
Anil Nerode
Bob Constable
Dexter Kozen
Sergei Artemov
Klaus Keimel
Helmut Schwichtenberg


TCS
APAL





APAL Bibliography
IMath Consortium







Abstract Type 2 computational complexity of functions on Cantor's space.
Theoretical Computer Science, 1991.
PS Version PDF Version
Abstract Compactness in constructive analysis revisited.
Annals of pure and applied logic, 1987.
PS Version PDF Version
Abstract Representations of the real numbers and the open subsets of the set of real numbers.
Annals of pure and applied logic, 1987.
PS Version PDF Version
Abstract Theory of representations.
Theoretical Computer Science, 1985.
PS Version PDF Version
Abstract Theorie der Darstellungen und ihre Anwendungen in der konstruktiven Analysis.
PhD Thesis, Fernuniversität Hagen (German), 1984.
Not available online
Abstract Towards a theory of representations.
2nd Frege Conference, 1984.
Not available online
Abstract A unified approach to constructive and recursive analysis.
Logic Colloquium Aachen, 1984.
PS Version PDF Version
Abstract Complexity theory on real numbers and functions.
6th GI Conference on Theoretical Computer Science, 1983.
Not available online
Abstract Zulässige CPO's - ein Entwurf für ein allgemeines Berechenbarkeitskonzept.
Diplomarbeit, RWTH Aachen, 1981.
Not available online
BACK
Back to main page