Autor:	Barlag, Timon, Vollmer, Heribert
Rok vydání:	2020
Předmět:	Computer Science - Computational Complexity F.1.1 F.1.3 F.4.1
Druh dokumentu:	Working Paper
Popis:	In this paper we give an Immerman's Theorem for real-valued computation. We define circuits operating over real numbers and show that families of such circuits of polynomial size and constant depth decide exactly those sets of vectors of reals that can be defined in first-order logic on R-structures in the sense of Cucker and Meer. Our characterization holds both non-uniformily as well as for many natural uniformity conditions. Comment: 45 pages, submitted to WoLLIC 2021 special issue of Journal of Logic and Computation
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2005.04916 Zobrazit plný text záznamu View this record from Arxiv