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

word problemrandom groupsrandom structuresdegree of a structure

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Computable structure theory, computable model theory (03C57) Other Turing degree structures (03D28) 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

(7)

• A quest for algorithmically random infinite structures. II
• Computability in infinite Galois theory and algorithmically random algebraic fields
• A quest for algorithmically random infinite structures
• Classifying word problems of finitely generated algebras via computable reducibility
• On sequential structures in incompressible multidimensional networks
• Algorithmically random universal algebras
• Algorithmic randomness and Ramsey properties of countable homogeneous structures

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)