A quest for algorithmically random infinite structures. II
From MaRDI portal
Publication:5283425
DOI10.1007/978-3-319-27683-0_12zbMATH Open1476.03058OpenAlexW2293220713MaRDI QIDQ5283425FDOQ5283425
Authors: Bakhadyr Khoussainov
Publication date: 21 July 2017
Published in: Logical Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-27683-0_12
Recommendations
Algorithmic randomness and dimension (03D32) Computable structure theory, computable model theory (03C57)
Cites Work
- Recurrence of distributional limits of finite planar graphs
- Title not available (Why is that?)
- Algorithmic randomness and complexity.
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Length of Programs for Computing Finite Binary Sequences
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The definition of random sequences
- Computability and Randomness
- A unified approach to the definition of random sequences
- An introduction to Kolmogorov complexity and its applications
- Computable Algebra, General Theory and Theory of Computable Fields
- Title not available (Why is that?)
- Randnomness, computability, and algebraic specifications
- A quest for algorithmically random infinite structures
Cited In (4)
This page was built for publication: A quest for algorithmically random infinite structures. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283425)