Induction, Algorithmic Learning Theory, and PhilosophyMichèle Friend, Norma B. Goethe, Valentina S. Harizanov Springer Science & Business Media, 2007. gada 21. aug. - 290 lappuses The idea of the present volume emerged in 2002 from a series of talks by Frank Stephan in 2002, and John Case in 2003, on developments of algorithmic learning theory. These talks took place in the Mathematics Department at the George Washington University. Following the talks, ValentinaHarizanovandMichèleFriendraised thepossibility ofanexchange of ideas concerning algorithmic learning theory. In particular, this was to be a mutually bene?cial exchange between philosophers, mathematicians and computer scientists. Harizanov and Friend sent out invitations for contributions and invited Norma Goethe to join the editing team. The Dilthey Fellowship of the George Washington University provided resources over the summer of 2003 to enable the editors and some of the contributors to meet in Oviedo (Spain) at the 12th International Congress of Logic, Methodology and Philosophy of Science. The editing work proceeded from there. The idea behind the volume is to rekindle interdisciplinary discussion. Algorithmic learning theory has been around for nearly half a century. The immediate beginnings can be traced back to E.M. Gold’s papers: “Limiting recursion” (1965) and “Language identi?cation in the limit” (1967). However, from a logical point of view, the deeper roots of the learni- theoretic analysis go back to Carnap’s work on inductive logic (1950, 1952). |
Saturs
Technical Papers | 18 |
Inductive Inference Systems for Learning Classes | 27 |
Deduction Induction and beyond in Parametric Logic | 55 |
How Simplicity Helps You Find the Truth without | 111 |
Induction over the Continuum 145 | 144 |
Logically Reliable Inductive Inference | 157 |
Some Philosophical Concerns about the Confidence | 179 |
How to do Things with an Infinite Regress 199 | 198 |
TradeOffs | 219 |
Two Ways of Thinking About Induction | 233 |
Between History and Logic | 259 |
279 | |
Citi izdevumi - Skatīt visu
Induction, Algorithmic Learning Theory, and Philosophy Michèle Friend,Norma B. Goethe,Valentina S. Harizanov Priekšskatījums nav pieejams - 2007 |
Induction, Algorithmic Learning Theory, and Philosophy Michèle Friend,Norma B. Goethe,Valentina S. Harizanov Priekšskatījums nav pieejams - 2007 |
Induction, Algorithmic Learning Theory, and Philosophy Michèle Friend,Norma B. Goethe,Valentina S. Harizanov Priekšskatījums nav pieejams - 2010 |
Bieži izmantoti vārdi un frāzes
algorithmic answer apply argument assume assumptions Borel bound called classical classifier closed compactness complexity computable concept conclusion consider consistent contains convergence correct deductive defined Definition discussion elements emeralds empirical enumeration equivalent evidence example exists finite first-order formal formula function given grammar green Hence hypothesis idea ideals identifier inductive inductive inference infinite input inquiry justification language learner least limit logical consequence marbles mathematical means method methodological mind changes natural notion observed output paradigm parameters particular philosophical philosophy of science positive possible presented Press probability problem procedure produces Proof Proposition question reasoning refuted regress relation reliable requires retractions rule satisfies scientific scientist sense sentences sequence solution space strategy stream structures subset success Suppose Theorem true truth University