Turing machines with atoms, constraint satisfaction problems, and descriptive complexity

Bartek Klin, Sławomir Lasota, Joanna Ochremiak, Szymon Toruńczyk
2014 Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) - CSL-LICS '14  
We study deterministic computability over sets with atoms. We characterize those alphabets for which Turing machines with atoms determinize. To this end, the determinization problem is expressed as a Constraint Satisfaction Problem, and a characterization is obtained from deep results in CSP theory. As an application to Descriptive Complexity Theory, within a substantial class of relational structures including Cai-Fürer-Immerman graphs, we precisely characterize those subclasses where the
more » ... IFP+C captures order-invariant polynomial time computation.
doi:10.1145/2603088.2603135 dblp:conf/csl/KlinLOT14 fatcat:whpzig7cnbhlzogjpkqpsuczbq