A quest for algorithmically random infinite structures

DOI10.1145/2603088.2603114zbMATH Open1395.03018OpenAlexW1974840846MaRDI QIDQ4635641FDOQ4635641

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 setshalting problemMartin-Löf randomnessfinitely generated universal algebragraphs and trees of bounded degree

Mathematics Subject Classification ID

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

Cited In (9)

• The random members of a \({\Pi }_{1}^{0}\) class
• A Quest for Algorithmically Random Infinite Structures, II
• Finitely repeated search and the diamond paradox
• Computability in infinite Galois theory and algorithmically random algebraic fields
• Random Subgroups of Rationals
• Classifying word problems of finitely generated algebras via computable reducibility
• Title not available (Why is that?)
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• Computability theory. Abstracts from the workshop held January 7--13, 2018

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)