Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings

DOI10.1002/MALQ.19880340605MaRDI QIDQ3824298zbMATH OpenOpenAlexFDO

Authors Rolf Wiehagen, Rūsiņš Freivalds, Efim 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

zbMATH Keywords

Gödel numberingspartial recursive functionprobabilistic algorithmsprobabilistic inductive inference

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4119662
• On the power of probabilistic strategies in inductive inference
• Probabilistic inductive inference
• scientific article; zbMATH DE number 408784
• scientific article; zbMATH DE number 517033

Cited in

(12)

• On the power of inductive inference from good examples
• Probabilistic language learning under monotonicity constraints
• Non-standard numbers: a semantic obstacle for modelling arithmetical reasoning
• scientific article; zbMATH DE number 3950511 (Why is no real title available?)
• Probabilistic inductive inference
• scientific article; zbMATH DE number 408784 (Why is no real title available?)
• scientific article; zbMATH DE number 517033 (Why is no real title available?)
• scientific article; zbMATH DE number 4119662 (Why is no real title available?)
• Aspects of complexity of probabilistic learning under monotonicity constraints
• Probabilistic language learning under monotonicity constraints
• On the power of probabilistic strategies in inductive inference
• Learning recursive functions: A survey

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

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