On the power of probabilistic strategies in inductive inference
Publication:760795
DOI10.1016/0304-3975(83)90067-1zbMath0555.68014OpenAlexW1997380360MaRDI QIDQ760795
Rolf Wiehagen, E. B. Kinber, Rūsiņš Freivalds
Publication date: 1984
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(83)90067-1
probabilistic algorithmsTuring machineGödel numberingrecursive functionsinductive inference of programsprobabilistic strategies
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10) Algorithms in computer science (68W99)
Related Items (14)
Cites Work
- Research in the theory of inductive inference by GDR mathematicians - A survey
- Inductive Inference and Computable One‐One Numberings
- The Power of Pluralism for Automatic Program Synthesis
- Toward a mathematical theory of inductive inference
- Inductive inference of automata, functions and programs
- Limiting recursion
- Monadic Elementary Formal Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the power of probabilistic strategies in inductive inference