A universal inductive inference machine
From MaRDI portal
Publication:3984440
DOI10.2307/2274708zbMath0763.03023OpenAlexW2090580120MaRDI QIDQ3984440
Scott Weinstein, Michael Stob, 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
Turing machineinductive inferenceoracleTuring computabilitydetectabilityscientific discoveryregular logicLöwenheim-Skolem propertyuniversal scientist
Classical first-order logic (03B10) Turing machines and related notions (03D10) Other applications of logic (03B80) Other classical first-order model theory (03C68)
Related Items
Relevant consequence and empirical inquiry, On the danger of half-truths, The complexity of universal text-learners, Learning Theory and Epistemology, Learning with belief levels, Scientific discovery based on belief revision, TRIAL AND ERROR MATHEMATICS I: DIALECTICAL AND QUASIDIALECTICAL SYSTEMS, Belief revision in the service of scientific discovery, The complexity of universal text-learners., On learning formulas in the limit and with assurance.
Cites Work
