545625

9780262581264

Computational Learning Theory and Natural Learning Systems Constraints and Prospects
Computational Learning Theory and Natural Learning Systems Constraints and Prospects
$94.49
$3.95 Shipping
  • Condition: New
  • Provider: Ergodebooks Contact
  • Provider Rating:
    83%
  • Ships From: Multiple Locations
  • Shipping: Standard
  • Comments: Buy with confidence. Excellent Customer Service & Return policy. Ships Fast. Expedite Shipping Available.

   30-day money back guarantee
$4.27
$3.95 Shipping
List Price
$65.00
Discount
93% Off
You Save
$60.73

  • Condition: Good
  • Provider: Better World Books Contact
  • Provider Rating:
    93%
  • Ships From: Mishawaka, IN
  • Shipping: Standard, Expedited
  • Comments: Shows some signs of wear, and may have some markings on the inside. 100% Money Back Guarantee. Shipped to over one million happy customers. Your purchase benefits world literacy!

   30-day money back guarantee

Ask the provider about this item.

Most renters respond to questions in 48 hours or less.
The response will be emailed to you.
Cancel
  • ISBN-13: 9780262581264
  • ISBN: 0262581264
  • Publisher: MIT Press

AUTHOR

SUMMARY

These original contributions converge on an exciting and fruitful intersection of three historically distinct areas of learning research: computational learning theory, neural networks, and symbolic machine learning. Bridging theory and practice, computer science and psychology, they consider general issues in learning systems that could provide constraints for theory and at the same time interpret theoretical results in the context of experiments with actual learning systems. In all, nineteen chapters address questions such as, What is a natural system? How should learning systems gain from prior knowledge? If prior knowledge is important, how can we quantify how important? What makes a learning problem hard? How are neural networks and symbolic machine learning approaches similar? Is there a fundamental difference in the kind of task a neural network can easily solve as opposed to those a symbolic algorithm can easily solve? Stephen J. Hanson heads the Learning Systems Department at Siemens Corporate Research and is a Visiting Member of the Research Staff and Research Collaborator at the Cognitive Science Laboratory at Princeton University. George A. Drastal is Senior Research Scientist at Siemens Corporate Research. Ronald J. Rivest is Professor of Computer Science and Associate Director of the Laboratory for Computer Science at the Massachusetts Institute of Technology.Hanson, Stephen J. is the author of 'Computational Learning Theory and Natural Learning Systems Constraints and Prospects' with ISBN 9780262581264 and ISBN 0262581264.

[read more]

Questions about purchases?

You can find lots of answers to common customer questions in our FAQs

View a detailed breakdown of our shipping prices

Learn about our return policy

Still need help? Feel free to contact us

View college textbooks by subject
and top textbooks for college

The ValoreBooks Guarantee

The ValoreBooks Guarantee

With our dedicated customer support team, 30-day no-questions-asked return policy, and our price match guarantee, you can rest easy knowing that we're doing everything we can to save you time, money, and stress.