Testability and Ockham's razor: How formal and statistical learning theory converge in the new riddle of induction (Q1037380): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10992-009-9111-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987328002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ockham's razor, empirical complexity, and truth-finding efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3256189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The logic of reliable and efficient inquiry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Means-Ends Epistemology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4935997 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:56, 2 July 2024

scientific article
Language Label Description Also known as
English
Testability and Ockham's razor: How formal and statistical learning theory converge in the new riddle of induction
scientific article

    Statements

    Testability and Ockham's razor: How formal and statistical learning theory converge in the new riddle of induction (English)
    0 references
    0 references
    16 November 2009
    0 references
    0 references
    Goodman
    0 references
    new riddle of induction
    0 references
    Ockham's razor
    0 references
    simplicity
    0 references
    testability
    0 references
    formal learning theory
    0 references
    statistical learning theory
    0 references
    inductive inference
    0 references
    0 references