Effective aspects of algorithmically random structures

DOI10.3233/COM-180101MaRDI QIDQ5211070zbMATH OpenOpenAlexFDO

Authors Matthew Harrison-Trainor, Bakh Khoussainov, Daniel Turetsky

Publication date 17 January 2020

Published in Computability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/com-180101

zbMATH Keywords

degree of a structurerandom groupsrandom structuresword problem

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32) Theory of numerations, effectively presented structures (03D45)

Recommendations

• A quest for algorithmically random infinite structures. II
• A quest for algorithmically random infinite structures
• Algorithmically random universal algebras
• Martin-Löf randomness, invariant measures and countable homogeneous structures
• Algorithmic randomness and Ramsey properties of countable homogeneous structures

Cited in

(8)

• Algorithmic randomness and Ramsey properties of countable homogeneous structures
• Algorithmically random universal algebras
• A quest for algorithmically random infinite structures
• Random Subgroups of Rationals
• 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
• On sequential structures in incompressible multidimensional networks

This page was built for publication: Effective aspects of algorithmically random structures

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