A note on the Kolmogorov data complexity and nonuniform logical definitions
From MaRDI portal
Publication:290271
DOI10.1016/S0020-0190(97)00172-5zbMath1338.03053OpenAlexW2040072426MaRDI QIDQ290271
Publication date: 1 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00172-5
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity of computation (including implicit computational complexity) (03D15) Logic with extra quantifiers and operators (03C80) Model theory of finite structures (03C13) Descriptive complexity and finite models (68Q19)
Cites Work
This page was built for publication: A note on the Kolmogorov data complexity and nonuniform logical definitions