Computational Complexity and Probability Constructions
From MaRDI portal
Publication:5642017
DOI10.1145/321574.321578zbMath0233.68013OpenAlexW1990103540MaRDI QIDQ5642017
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
The discovery of algorithmic probability ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Probabilistic automata ⋮ Meeting of the Association for Symbolic Logic, Dallas 1973 ⋮ SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY ⋮ New error bounds for Solomonoff prediction ⋮ Model discrimination using an algorithmic information criterion
This page was built for publication: Computational Complexity and Probability Constructions
