[Alta-Logic] Introduction to Turing Categories 1

[ggpayett at ucalgary.ca]

Speaker: Robin Cockett

Date: Wednesday Oct 29th

Time: 13:00

Room: ICT 616

Abstract:

This is joint work with Pieter Hofstra and is part of a program to
provide a more abstract basis for computability theory. The work (among
other aspects) unifies two strands: one pioneered by Di Poala and Heller
and the other by Moggi and Longo. The former initiated the study of
computability from a categorical perspective, however, fundamentally
assumed that computability required the presence of partiality
(functions which are not totally defined). The latter considered total
categories of computable functions given by combinatory algebras and
excluded the possibility that there could be partiality! Turing
categories unify these viewpoints but also open up other possibilities
which are unexpected.

The first talk will lay out the basic theory and work toward some of the
basic results of computability.

-- 
Gillman Payette
Department of Philosophy
University of Calgary
2500 University Drive NW
Calgary, AB T2N 1N4, Canada
Ph 403.220.7518
Fax 403.289.5698