Probabilistic inference of approximations

From MaRDI portal





The paper is concerned with the probabilistic inductive inference of Gödel numbers of total recursive functions, when the set of possible errors is allowed to be infinite but with bounded density. Finite probabilistic identification, probabilistic identification in the limit, and deterministic identification up to sets with bounded density have been studied, together with their corresponding hierarchies of function classes. In the case at hand the obtained hierarchies of classes of functions identifiable with different probabilities are proved to be essentially different from hierarchies in the case of exact identification. For the entire collection see [Zbl 0819.68110].











This page was built for publication: Probabilistic inference of approximations

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