A quest for algorithmically random infinite structures

DOI10.1145/2603088.2603114zbMath1395.03018OpenAlexW1974840846MaRDI QIDQ4635641

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

halting problemMartin-Löf randomnessalgorithmic randomnesscomputably enumerable setsfinitely generated universal algebragraphs and trees of bounded degree

Mathematics Subject Classification ID

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

Related Items (7)

A Quest for Algorithmically Random Infinite Structures, II ⋮ Classifying word problems of finitely generated algebras via computable reducibility ⋮ Computability theory. Abstracts from the workshop held January 7--13, 2018 ⋮ The random members of a \({\Pi }_{1}^{0}\) class ⋮ FOUNDATIONS OF ONLINE STRUCTURE THEORY ⋮ Random Subgroups of Rationals ⋮ Unnamed Item

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