Computability in Europe 2006
Logical Approaches to Computational Barriers

Print current page  Print this page

Regular Talk:
The Method of Approximation in Real Computation

Speaker: Kerry Ojakian
Slot: Tue, 14:50-15:10, Faraday D (col. 4)

Abstract

Campagnolo, Costa, and Moore  found connections between discrete
complexity classes and
analog classes defined on the reals.  Building on these ideas Bournez
and Hairney found
function algebra descriptions of classes of functions defined via
computable analysis.  We
develop a general collection of tools which allow us to nicely
compare different classes
of functions via a notion of "approximation."  We apply these general
tools to obtain
some previous results and prove new ones, along the lines of the
aforementioned authors.



websites: Arnold Beckmann 2006-04-26 Valid HTML 4.01! Valid CSS! eXTReMe Tracker hit counters by www.free-counters.net