Algorithmically random universal algebras

DOI10.1142/9789813109032_0005MaRDI QIDQ2973065zbMATH OpenOpenAlexFDO

Authors Bakhadyr Khoussainov

Publication date 31 March 2017

Published in Information and Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/9789813109032_0005

zbMATH Keywords

computable algebraMartin-Löf testmeasurerandom algebra

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Algebraic structures (08A99)

Recommendations

• A quest for algorithmically random infinite structures. II
• Effective aspects of algorithmically random structures
• A quest for algorithmically random infinite structures
• Randnomness, computability, and algebraic specifications
• On relative randomness

Cited in

(8)

• Uniform random generation of expressions respecting algebraic identities
• Randnomness, computability, and algebraic specifications
• The deluge of spurious correlations in big data
• Embedding recursive functions in universal algorithms
• scientific article; zbMATH DE number 3761286 (Why is no real title available?)
• A quest for algorithmically random infinite structures
• Effective aspects of algorithmically random structures
• A quest for algorithmically random infinite structures. II

This page was built for publication: Algorithmically random universal algebras

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