Random Subgroups of Rationals
From MaRDI portal
Recommendations
- Effective aspects of algorithmically random structures
- RANDOM GENERATION OF FINITELY GENERATED SUBGROUPS OF A FREE GROUP
- Algorithmic randomness and Ramsey properties of countable homogeneous structures
- Generic properties of random subgroups of a free group for general distributions.
- Random subgroups of linear groups are free.
Cites work
- scientific article; zbMATH DE number 1303204 (Why is no real title available?)
- A New Approach to Formal Language Theory by Kolmogorov Complexity
- A characterization of the subgroups of the additive rationals
- A quest for algorithmically random infinite structures
- A quest for algorithmically random infinite structures. II
- A unified approach to the definition of random sequences
- Abelian groups without elements of finite order
- Algorithmic randomness and complexity.
- An introduction to Kolmogorov complexity and its applications
- Belief revision in the service of scientific discovery
- Classical recursion theory. The theory of functions and sets of natural numbers
- Comparison of identification criteria for machine inductive inference
- Computability and randomness
- Elementary properties of Abelian groups
- Factoring groups into subsets.
- Language identification in the limit
- Learning algebraic structures from text
- Martin-Löf random quantum states
- Model Theory
- Random walk in random groups.
- Some decidability results on grammatical inference and complexity
- The additive group of the rationals does not have an automatic presentation
- The definition of random sequences
- Toward a mathematical theory of inductive inference
Cited in
(2)
This page was built for publication: Random Subgroups of Rationals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092384)