Skip to content
Register Sign in Wishlist
Computational Learning Theory

Computational Learning Theory

CAD$61.95 (P)

Part of Cambridge Tracts in Theoretical Computer Science

  • Authors:
  • M. H. G. Anthony, London School of Economics and Political Science
  • N. Biggs, London School of Economics and Political Science
  • Date Published: March 1997
  • availability: Available
  • format: Paperback
  • isbn: 9780521599221

CAD$ 61.95 (P)

Add to cart Add to wishlist

Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • Computational learning theory is one of the first attempts to construct a mathematical theory of a cognitive process. It has been a field of much interest and rapid growth in recent years. This text provides a framework for studying a variety of algorithmic processes, such as those currently in use for training artificial neural networks. The authors concentrate on an approximate model for learning and gradually develop the ideas of efficiency considerations. Finally, they consider applications of the theory to artificial neural networks. An abundance of exercises and an extensive list of references round out the text. This volume provides a comprehensive review of the topic, including information drawn from logic, probability, and complexity theory. It forms a solid introduction to the theory of comptutational learning suitable for a broad spectrum of graduate students from theoretical computer science to mathematics.

    • Biggs is world leader
    • All mathematical concepts developed in an economic context
    Read more

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: March 1997
    • format: Paperback
    • isbn: 9780521599221
    • length: 172 pages
    • dimensions: 244 x 170 x 9 mm
    • weight: 0.29kg
    • availability: Available
  • Table of Contents

    1. Concepts, hypotheses, learning algorithms
    2. Boolean formulae and representations
    3. Probabilistic learning
    4. Consistent algorithms and learnability
    5. Efficient learning I
    6. Efficient learning II
    7. The VC dimension
    8. Learning and the VC dimension
    9. VC dimension and efficient learning
    10. Linear threshold networks.

  • Authors

    M. H. G. Anthony, London School of Economics and Political Science

    N. Biggs, London School of Economics and Political Science

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.