Summary: Topology and Computability
Thesis Proposal
Andrej Bauer
Carnegie Mellon University
School of Computer Science
April 14, 1998
Committee members: S.M. Awodey, Carnegie Mellon University
A. Edalat, Imperial College, London
F. Pfenning, Carnegie Mellon University
D.S. Scott, Carnegie Mellon University
In this thesis I will relate standard computability to computability of
reals---and related spaces---and link these notions with denotational seman­
tics of computer languages. The framework for the proposed study was
worked out in collaboration with Steve Awodey, Lars Birkedal and Dana
Scott. The first section gives a motivation for our setup and indicates how
standard computability fits in it. The subsequent sections discuss appli­
cations of the ideas to examples in analysis, topology, and domain theory.
They are meant to demonstrate the nature of the work that I intend to
accomplish.
1 Motivation and Background

Source: Andrews, Peter B. - Department of Mathematical Sciences, Carnegie Mellon University

Collections: Mathematics