University of Birmingham > Talks@bham > Theoretical computer science seminar > Computability in Locally Compact Spaces

## Computability in Locally Compact SpacesAdd to your list(s) Download to your calendar using vCal - Paul Taylor
- Wednesday 14 April 2010, 16:00-17:00
- UG06 Learning Centre.
If you have a question about this talk, please contact Paul Levy. Stephen Kleene showed that any recursive enumerable predicate
The normal form is developed in a similar way to Peter Landin’s
SECD machine, but we observe some connections between programming
and topology.
The stack consists of values like h,
which, like the open part β of the basis, is covariant,
and indeed preserves meets.^{n}The formal meets of the basis elements lead to a generalisation of unification, which is Cleary’s “Logical Arithmetic” in the case of the reals. Roundedness with respect to the way-below or cover relation indicates how to improve the precision of a value and how to perform universal quantification over a compact subspace. Although this investigation clearly offers a plan for a compiler for the ASD language, I was prompted to do it by theoretical questions. In particular, I can show that any overt subspace of Cantor space or the reals is the image of an RE subset of ℕ. This talk is part of the Theoretical computer science seminar series. ## This talk is included in these lists:- Computer Science Departmental Series
- Computer Science Distinguished Seminars
- Theoretical computer science seminar
- UG06 Learning Centre
Note that ex-directory lists are not shown. |
## Other listsPhysics and Astronomy Colloquia Algebra Reading Group on Sporadic Groups PIPS - Postgraduate Informal Physics Seminars## Other talks |