A quest for algorithmically random infinite structures
From MaRDI portal
Publication:4635641
Recommendations
- A quest for algorithmically random infinite structures. II
- Effective aspects of algorithmically random structures
- Algorithmically random universal algebras
- On elementary computability-theoretic properties of algorithmic randomness
- Algorithmic randomness and Ramsey properties of countable homogeneous structures
Cited in
(13)- Martin-Löf randomness, invariant measures and countable homogeneous structures
- Algorithmically random universal algebras
- Finitely repeated search and the diamond paradox
- Effective aspects of algorithmically random structures
- Computability theory. Abstracts from the workshop held January 7--13, 2018
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- A quest for algorithmically random infinite structures. II
- Algorithmic randomness and Ramsey properties of countable homogeneous structures
- The random members of a \({\Pi }_{1}^{0}\) class
- Random Subgroups of Rationals
- Computability in infinite Galois theory and algorithmically random algebraic fields
- Classifying word problems of finitely generated algebras via computable reducibility
- scientific article; zbMATH DE number 7407778 (Why is no real title available?)
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)