Perfect Local Computability and Computable Simulations

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. Key words: Category theory, computability, local computability, perfect local computability, simulation

• Type: Conference
• Year: 2008
• Where: CIE
• Authors: Russell Miller, Dustin Mulcahey
• Keywords: Applied Computing, Category Theory, CIE 2008, Computable Structure, Local Computability