A quest for algorithmically random infinite structures. II

DOI10.1007/978-3-319-27683-0_12MaRDI QIDQ5283425zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

measurehalting problemMartin-Löf randomnesscomputable infinite structure

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Computable structure theory, computable model theory (03C57)

Recommendations

• A quest for algorithmically random infinite structures
• Effective aspects of algorithmically random structures
• Algorithmically random universal algebras
• The interplay of classes of algorithmically random objects
• Algorithmic randomness and Ramsey properties of countable homogeneous structures

Cites work

• scientific article; zbMATH DE number 3427210 (Why is no real title available?)
• scientific article; zbMATH DE number 53151 (Why is no real title available?)
• scientific article; zbMATH DE number 3557225 (Why is no real title available?)
• scientific article; zbMATH DE number 1911266 (Why is no real title available?)
• A quest for algorithmically random infinite structures
• A unified approach to the definition of random sequences
• Algorithmic randomness and complexity.
• An introduction to Kolmogorov complexity and its applications
• Computability and Randomness
• Computable Algebra, General Theory and Theory of Computable Fields
• On the Length of Programs for Computing Finite Binary Sequences
• Randnomness, computability, and algebraic specifications
• Recurrence of distributional limits of finite planar graphs
• 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

Cited in

(8)

• Martin-Löf randomness, invariant measures and countable homogeneous structures
• Algorithmically random universal algebras
• Effective aspects of algorithmically random structures
• Algorithmic randomness and Ramsey properties of countable homogeneous structures
• The random members of a \({\Pi }_{1}^{0}\) class
• Random Subgroups of Rationals
• Computability in infinite Galois theory and algorithmically random algebraic fields
• A quest for algorithmically random infinite structures

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)