Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings

DOI10.1002/malq.19880340605zbMath0672.03026OpenAlexW2058721256MaRDI QIDQ3824298

Rolf Wiehagen, E. B. Kinber, Rūsiņš Freivalds

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

zbMATH Keywords

probabilistic algorithmspartial recursive functionGödel numberingsprobabilistic inductive inference

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10) Theory of computing (68Q99)

Related Items (5)

Probabilistic language learning under monotonicity constraints ⋮ Learning recursive functions: A survey ⋮ Probabilistic language learning under monotonicity constraints ⋮ On the power of inductive inference from good examples ⋮ Aspects of complexity of probabilistic learning under monotonicity constraints

This page was built for publication: Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings