Metric structures and probabilistic computation
From MaRDI portal
Publication:541224
DOI10.1016/j.tcs.2011.02.005zbMath1222.03041arXiv0806.0398OpenAlexW2070221296WikidataQ59199685 ScholiaQ59199685MaRDI QIDQ541224
Publication date: 6 June 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0806.0398
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Computable structure theory, computable model theory (03C57) Algorithmic randomness and dimension (03D32)
Related Items (max. 100)
Generalized effective completeness for continuous logic ⋮ Continuous logic and embeddings of Lebesgue spaces
Cites Work
- Effective categoricity of abelian \(p\)-groups
- Countable algebra and set existence axioms
- Computable structures and the hyperarithmetical hierarchy
- Isoperimetric and isodiametric functions of groups
- Isoperimetric functions of groups and computational complexity of the word problem
- Order-computable sets
- Theory of computation.
- Effective categoricity of equivalence structures
- Continuous first order logic and local stability
- Foundations of recursive model theory
- A proof of completeness for continuous first-order logic
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Metric structures and probabilistic computation