Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings
From MaRDI portal
Publication:3824298
DOI10.1002/malq.19880340605zbMath0672.03026MaRDI QIDQ3824298
Rolf Wiehagen, Rūsiņš Freivalds, E. B. Kinber
Publication date: 1988
Published in: Zeitschrift für Mathematische Logik und Grundlagen der Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19880340605
probabilistic algorithms; partial recursive function; Gödel numberings; probabilistic inductive inference
03D20: Recursive functions and relations, subrecursive hierarchies
03D10: Turing machines and related notions
68Q99: Theory of computing
Related Items
Aspects of complexity of probabilistic learning under monotonicity constraints, Learning recursive functions: A survey, On the power of inductive inference from good examples, Probabilistic language learning under monotonicity constraints