FLOC 2018: FEDERATED LOGIC CONFERENCE 2018
Computability over locally finite structures from algebra

Author: Siddharth Bhaskar

PapersPapers with AbstractsPrefaceAuthor IndexKeyword Index

Paper Information

Title:Computability over locally finite structures from algebra
Authors:Siddharth Bhaskar
Proceedings:LCC Contributed Talks
Editors: Erich Grädel and Jan Hoffmann
Keywords:abstract recursion theory, field theory, computational complexity, cons-free computation
Abstract:

ABSTRACT. Working with a particular notion of computability over general, first- order structures, we argue that computability classes over certain locally finite structures should capture Turing machine complexity classes. We exhibit this phenomenon for some locally finite structures from algebra.

Pages:4
Talk:Jul 13 11:45 (Session 86F: LCC: Contributed Talks)
Paper: