Algorithmic identification of probabilities is hard (Q1747492): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1609488243 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1405.5139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic tests and randomness with respect to a class of measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive equivalence relations on computable probability measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of identification criteria for machine inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform test of algorithmic randomness over a general space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak completeness in \(\text{E}\) and \(\text{E}_{2}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to Kolmogorov complexity and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. Vol. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identification of probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning recursive functions: A survey / rank
 
Normal rank

Revision as of 14:18, 15 July 2024

scientific article
Language Label Description Also known as
English
Algorithmic identification of probabilities is hard
scientific article

    Statements

    Identifiers