Computational Complexity and Probability Constructions

DOI10.1145/321574.321578zbMATH Open0233.68013OpenAlexW1990103540MaRDI QIDQ5642017FDOQ5642017

David G. Willis

Publication date: 1970

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321574.321578

Mathematics Subject Classification ID

Cited In (8)

• Model discrimination using an algorithmic information criterion
• New error bounds for Solomonoff prediction
• Title not available (Why is that?)
• Meeting of the Association for Symbolic Logic, Dallas 1973
• SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY
• Probabilistic automata
• Title not available (Why is that?)
• The discovery of algorithmic probability

This page was built for publication: Computational Complexity and Probability Constructions

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