A quest for algorithmically random infinite structures

DOI10.1145/2603088.2603114MaRDI QIDQ4635641zbMATH OpenOpenAlexFDO

Authors Bakhadyr Khoussainov

Publication date 23 April 2018

Published in Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2603088.2603114

zbMATH Keywords

algorithmic randomnesscomputably enumerable setsfinitely generated universal algebragraphs and trees of bounded degreehalting problemMartin-Löf randomness

Mathematics Subject Classification ID

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

Recommendations

• A quest for algorithmically random infinite structures. II
• Effective aspects of algorithmically random structures
• Algorithmically random universal algebras
• On elementary computability-theoretic properties of algorithmic randomness
• Algorithmic randomness and Ramsey properties of countable homogeneous structures

Cited in

(15)

• Computability theory. Abstracts from the workshop held January 7--13, 2018
• The random members of a \({\Pi }_{1}^{0}\) class
• Martin-Löf randomness, invariant measures and countable homogeneous structures
• Finitely repeated search and the diamond paradox
• Algorithmic randomness and Ramsey properties of countable homogeneous structures
• Algorithmically random universal algebras
• INFINITE STRINGS AND THEIR LARGE SCALE PROPERTIES
• Random Subgroups of Rationals
• Foundations of online structure theory. II: The operator approach
• Effective aspects of algorithmically random structures
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• A quest for algorithmically random infinite structures. II
• Classifying word problems of finitely generated algebras via computable reducibility
• Computability in infinite Galois theory and algorithmically random algebraic fields
• Defining algorithmically presented structures in first order logic

This page was built for publication: A quest for algorithmically random infinite structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635641)