A universal inductive inference machine

DOI10.2307/2274708MaRDI QIDQ3984440zbMATH OpenOpenAlexFDO

Authors Michael Stob, Scott Weinstein, Daniel N. Osherson

Publication date 27 June 1992

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2274708

zbMATH Keywords

detectabilityinductive inferenceTuring computabilityTuring machineoraclescientific discoveryregular logicLöwenheim-Skolem propertyuniversal scientist

Mathematics Subject Classification ID

Classical first-order logic (03B10) Turing machines and related notions (03D10) Other applications of logic (03B80) Other classical first-order model theory (03C68)

Recommendations

• Towards a mathematical theory of machine discovery from facts
• A universal method of scientific inquiry
• scientific article; zbMATH DE number 1351096
• scientific article; zbMATH DE number 1839426

Cites work

• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Paradigms of truth detection

Cited in

(15)

• Induction by enumeration
• The complexity of universal text-learners.
• On learning formulas in the limit and with assurance.
• Scientific discovery based on belief revision
• Trial and error mathematics. I: Dialectical and quasidialectical systems
• Universal inference
• Learning theory and epistemology
• Relevant consequence and empirical inquiry
• Induction and Physical Theory Formation As Well As Universal Computation by Machine Learning
• Belief revision in the service of scientific discovery
• scientific article; zbMATH DE number 1839426 (Why is no real title available?)
• Learning with belief levels
• On the danger of half-truths
• The complexity of universal text-learners
• Putnam's diagonal argument and the impossibility of a universal learning machine

This page was built for publication: A universal inductive inference machine

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