Computability in Europe 2008
Logic and Theory of Algorithms

Print current page  Print this page

Regular Talk:
Perfect Local Computability and Computable Simulations

Edit abstract data

Speaker: Russell Miller
Author(s): Russell Miller and Dustin Mulcahey
Slot: Wed, 11:30-11:50, Room 19 (col. 5)

Abstract

We study perfectly locally computable structures, which are (possibly
uncountable) structures S that have highly effective presentations of their
local properties.  We show that every such S can be simulated, in a strong
sense and even over arbitrary finite parameter sets, by a computable structure.
 We also study the category theory of a perfect cover of S, examining its
connections to the category of all finitely generated substructures of S.

websites: Arnold Beckmann 2008-05-30 Valid HTML 4.01! Valid CSS!