Equivalences between learning of data and probability distributions, and their applications
From MaRDI portal
Publication:1784951
DOI10.1016/j.ic.2018.08.001zbMath1401.68130arXiv1801.02566OpenAlexW2963994091MaRDI QIDQ1784951
Nan Fang, Frank Stephan, George Barmpalias
Publication date: 27 September 2018
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.02566
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Identification of probabilities
- Weak completeness in \(\text{E}\) and \(\text{E}_{2}\)
- On the structure of degrees of inferability.
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Classical recursion theory. Vol. II
- Extremes in the degrees of inferability
- Algorithmic identification of probabilities is hard
- Computability on computable metric spaces
- Uniform test of algorithmic randomness over a general space
- On the learnability of discrete distributions
- Randomness for non-computable measures
- Algorithmic Identification of Probabilities Is Hard
- Von Neumann's Biased Coin Revisited
- Algorithmic Randomness and Complexity
- Randomness conservation inequalities; information and independence in mathematical theories
- Probabilistic inductive inference
- Inductive inference and unsolvability
- Toward a mathematical theory of inductive inference
- Measures and their random reals
- Degrees in Which the Recursive Sets are Uniformly Recursive
- The definition of random sequences
- Language identification in the limit
- Probabilistic inductive inference: A survey
This page was built for publication: Equivalences between learning of data and probability distributions, and their applications
