A universal inductive inference machine
From MaRDI portal
Recommendations
Cites work
Cited in
(16)- Belief revision in the service of scientific discovery
- On the danger of half-truths
- On learning formulas in the limit and with assurance.
- The complexity of universal text-learners.
- Induction by enumeration
- Putnam's diagonal argument and the impossibility of a universal learning machine
- Relevant consequence and empirical inquiry
- Learning theory and epistemology
- Scientific discovery based on belief revision
- scientific article; zbMATH DE number 1839426 (Why is no real title available?)
- The complexity of universal text-learners
- Universal inference
- Trial and error mathematics. I: Dialectical and quasidialectical systems
- Induction and Physical Theory Formation As Well As Universal Computation by Machine Learning
- Towards a mathematical theory of machine discovery from facts
- Learning with belief levels
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)