Skip to main content

Induction, Algorithmic Learning Theory, and Philosophy

  • Book
  • © 2007

Overview

  • Only book to combine philosophy essays with technical essays on algorithmic learning theory
  • Invaluable for the reflective computer scientist or the mathematician/logician interested in modelling learning
  • Deepens the argument and debate about mathematically modelling learning
  • No-one with a serious interest in the philosophy of science can afford to ignore this development
  • Refracts the classical problem of induction into a spectrum of new insights and questions

Part of the book series: Logic, Epistemology, and the Unity of Science (LEUS, volume 9)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (11 chapters)

  1. Introduction to the Philosophy and Mathematics of Algorithmic Learning Theory

  2. Technical Papers

  3. Philosophy Papers

Keywords

About this book

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).

Editors and Affiliations

  • George Washington University, Washington, U.S.A

    Michèle Friend, Valentina S. Harizanov

  • National University of Cordoba, Cordoba, Argentina

    Norma B. Goethe

Bibliographic Information

Publish with us